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

Telecommunication Systems

Volumn 24, Issue 2-4, 2003, Pages 275-292

  Magaña, Eduardo ^a   Morató, Daniel ^a   Varaiya, Pravin ^b  

^a PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Network performance; Traffic control; Traffic engineering

Indexed keywords

INTERNET; NETWORK PROTOCOLS; QUALITY OF SERVICE; ROUTERS; SCHEDULING; TOPOLOGY;

TRAFFIC ENGINEERING;

TELECOMMUNICATION TRAFFIC;

EID: 0347720919     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026127232312     Document Type: Article

References (19)

1. S. Chen and K. Nahrstedt, An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions, Special Issue on Transmission and Distribution of Digital Video of IEEE Network (1998).
2. V. Chvatal, Linear Programming (Freeman, New York, 1983).
3. 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.
4. 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).
5. S. Floyd and V. Jacobson, Link-sharing and resource management models for packet networks, IEEE/ACM Transactions on Networking 3(4) (1995) 365-386.
6. A.V. Goldberg, Scaling algorithms for the shortest paths problem, in: ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 222-231.
7. J. Liebeherr and N. Christin, Rate allocation and buffer management for differentiated services, Special Issue on the New Internet Architecture of Computer Networks (2002).
8. 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.
9. J. Mackie-Mason and H.R. Varian, Some FAQs about usage-based pricing, Computer Networks and ISDN Systems 28(1/2) (1995) 257-265.
10. 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.
11. A. Medina et al., BRITE: Boston University Representative Internet Topology Generator, http://www.cs.bu.edu/brite (2001).
12. A. Orda, Routing with end to end QoS guarantees in broadband networks, in: IEEE INFOCOM, 1998, pp. 27-34.
13. A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single node-case, IEEE/ACM Transactions on Networking 1(3) (1993).
14. C. Qiao and D. Xu, Distributed partial information management (DPIM) schemes for survivable networks - Part I, in: IEEE INFOCOM, 2002.
15. R. Ramaswami and K. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE Transactions on Networking 3(5) (1995) 489-500.
16. H. Tangmunarunkit et al., Network topology generators: Degree-based vs. structural, in: ACM SIGCOMM'02, Pittsburgh, PA, USA, 2002.
17. B. Waxman, Routing of multipoint connections, IEEE Journal of Selected Areas in Communication 6(9) (1988) 1617-1622.
18. P. White, RSVP and integrated services in the Internet: A tutorial, IEEE Communications Magazine 35(5) (1997) 100-106.
19. X. Xiao and L.M. Ni, Internet QoS: A big picture, IEEE Network 13(2) (1999) 8-18.