Abstract
This paper shows a configuration scheme for networks with WFQ schedulers. It guarantees maximum revenue for the service provider in the worst case of network congestion. We focus on best effort traffic and select those flows that maximize the benefit while keeping the network utilization high. We show that optimum network configuration is feasible based only on knowledge of the topology. Its dependence on the pricing scheme can be reduced and even eliminated. We offer a formulation that reaches a tradeoff between network utilization, fairness, and user satisfaction.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Chen and K. Nahrstedt, An overview of quality-of-service routing for the next generation highspeed networks: Problems and solutions, Special Issue on Transmission and Distribution of Digital Video of IEEE Network (1998).
V. Chvatal, Linear Programming (Freeman, New York, 1983).
A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, Journal of Internetworking Research and Experience 1(1) (1990) 3–26.
R. Edell and P. Varaiya, Providing Internet access: What we learn from INDEX, Technical Report, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley (1999).
S. Floyd and V. Jacobson, Link-sharing and resource management models for packet networks, IEEE/ACM Transactions on Networking 3(4) (1995) 365–386.
A.V. Goldberg, Scaling algorithms for the shortest paths problem, in: ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 222–231.
J. Liebeherr and N. Christin, Rate allocation and buffer management for differentiated services, Special Issue on the New Internet Architecture of Computer Networks (2002).
Q. Ma, P. Steenkiste and H. Zang, Routing high-bandwidth traffic in max-min fair share networks, in: ACM SIGCOMM'96, 1996, pp. 226–227.
J. Mackie-Mason and H.R. Varian, Some FAQs about usage-based pricing, Computer Networks and ISDN Systems 28(1/2) (1995) 257–265.
A. Medina et al., BRITE: An approach to universal topology generation, in: Internat. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems-MASCOTS'01, Cincinnati, OH, 2001.
A. Medina et al., BRITE: Boston University Representative Internet Topology Generator, http://www.cs.bu.edu/brite (2001).
A. Orda, Routing with end to end QoS guarantees in broadband networks, in: IEEE INFOCOM, 1998, pp. 27–34.
A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single node-case, IEEE/ACMTransactions on Networking 1(3) (1993).
C. Qiao and D. Xu, Distributed partial information management (DPIM) schemes for survivable networks-Part I, in: IEEE INFOCOM, 2002.
R. Ramaswami and K. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE Transactions on Networking 3(5) (1995) 489–500.
H. Tangmunarunkit et al., Network topology generators: Degree-based vs. structural, in: ACM SIGCOMM'02, Pittsburgh, PA, USA, 2002.
B. Waxman, Routing of multipoint connections, IEEE Journal of Selected Areas in Communication 6(9) (1988) 1617–1622.
P. White, RSVP and integrated services in the Internet: A tutorial, IEEE Communications Magazine 35(5) (1997) 100–106.
X. Xiao and L.M. Ni, Internet QoS: A big picture, IEEE Network 13(2) (1999) 8–18.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Magaña, E., Morató, D. & Varaiya, P. Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic. Telecommunication Systems 24, 275–292 (2003). https://doi.org/10.1023/A:1026127232312
Issue Date:
DOI: https://doi.org/10.1023/A:1026127232312