Load-Balanced Routing and Scheduling for Real-Time Traffic in Packet-Switch Networks

Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of causing bottlenecks due to their singlepath routing. We propose a real-time routing and scheduling scheme that randomly distributes the traffic load over all available paths to the destination for load balancing and transmits the packet with the most urgency ahead of the other packets at a switch in a packet-switched network with two objectives

• Type: Conference
• Year: 2000
• Where: LCN
• Authors: Sangman Bak, Albert Mo Kim Cheng, Jorge Arturo Cobb, Ernst L. Leiss
• Keywords: Computer Networks, LCN 2000, Routing, Routing Algorithm, Shortest-path Routing Protocols