Load-balanced routing
S Bak - 2000 - search.proquest.com
This dissertation presents a new approach to routing in computer networks such as the
Internet. Future computer networks are expected to carry bursty traffic. Shortest-path routing …
Internet. Future computer networks are expected to carry bursty traffic. Shortest-path routing …
[PDF][PDF] Randomized distance-vector routing protocol
S Bak, JA Cobb - Proceedings of the 1999 ACM symposium on Applied …, 1999 - dl.acm.org
The purpose of routing protocols in a computer network is to maximize throughput. Shortest-path
routing protocols have the disadvantage of causing bottlenecks due to their single-path …
routing protocols have the disadvantage of causing bottlenecks due to their single-path …
A hierarchical routing method for load-balancing
S Bak - International Conference on High-Performance …, 2003 - Springer
The purpose of routing protocols in a computer network is to maximize network throughput.
Shortest-path routing protocols have the disadvantage of causing bottlenecks due to their …
Shortest-path routing protocols have the disadvantage of causing bottlenecks due to their …
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 …
requirements. Popular shortest-path routing protocols have the disadvantage of causing …
[PDF][PDF] Load-Balanced Routing and Scheduling for Traffic with Deadlines in Packet-Switched Networks1
Future computer networks are expected to carry bursty data traffic with stringent time-delay
requirements. Popular shortest-path routing protocols have the disadvantage of causing …
requirements. Popular shortest-path routing protocols have the disadvantage of causing …
[PDF][PDF] Load-Balanced routing via bounded randomization
Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols
have the disadvantage of causing bottlenecks due to their single-path routing. That is, the …
have the disadvantage of causing bottlenecks due to their single-path routing. That is, the …
Hierarchical load-balanced routing via bounded randomization
The purpose of routing protocols in a computer network is to maximize network throughput.
Popular shortest-path routing protocols have the disadvantage of causing bottlenecks due to …
Popular shortest-path routing protocols have the disadvantage of causing bottlenecks due to …
Performance Evaluation of Load-Balanced Routing via Bounded Randomization
Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols
such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inherent …
such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inherent …
Performance Analysis of Tunneling Protocols used in a Mobile Network with Mobile Router
S Oh, BC Kim, S Bak, HS Lee - Proceedings. 2006 31st IEEE …, 2006 - ieeexplore.ieee.org
A mobile router, which is in an ad-hoc network is not only a general ad-hoc network entity,
but also an anchor node, which takes role of an access point to make a flat network …
but also an anchor node, which takes role of an access point to make a flat network …
Hierarchical Load-balanced Routing Via Bounded Randomization based on Destination Node.
S Bak, SY Kang - Applied Informatics, 2003 - actapress.com
… Sangman Bak and Sang-Yong Kang … Bak and JA Cobb, Randomized Distance-Vector …
Bak, Load-Balanced Routing via Bounded …
Bak, Load-Balanced Routing via Bounded …