Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic

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.

[1]  Ariel Orda,et al.  Routing with end to end QoS guarantees in broadband networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[3]  Jeffrey K. MacKie-Mason,et al.  Some FAQs about Usage-Based Pricing , 1995, Comput. Networks ISDN Syst..

[4]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[5]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM 1996.

[6]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[7]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[8]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[10]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[11]  Nicolas Christin,et al.  Rate allocation and buffer management for differentiated services , 2002, Comput. Networks.

[12]  B. Burmahl.  The big picture. , 2000, Health facilities management.

[13]  P. Varaiya,et al.  Providing Internet access: what we learn from INDEX , 1999, IEEE Netw..

[14]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[15]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[16]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[18]  P. P. White,et al.  RSVP and integrated services in the Internet: a tutorial , 1997, IEEE Commun. Mag..

[19]  Andrew V. Goldberg,et al.  Scaling algorithms for the shortest paths problem , 1995, SODA '93.