Files in this item



application/pdf3111654.pdf (7MB)Restricted to U of Illinois
(no description provided)PDF


Title:Load Balancing in Hop -by -Hop Routing With and Without Traffic Splitting
Author(s):Wang, Jun
Doctoral Committee Chair(s):Nahrstedt, Klara
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
Abstract:Traffic engineering (TE) is crucial in hop-by-hop OSPF networks. We present a novel, edge-based traffic engineering method to approximate the optimal traffic allocation. The new method uses bandwidth-sensitive hop-by-hop routing algorithms as its core. It has three significant advantages. First, it keeps the network core simple and therefore scalable. Second, traffic can be partitioned following flow boundaries at the network edges. Because there is no further splitting in the core, traffic from the same TCP flow is able to travel along the same path, eliminating the out-of-order delivery problem from which other TE approaches may suffer. Finally, since uneven traffic splitting can be implemented at the edges, the new method performs well to approximate the optimal traffic load balancing.
Issue Date:2003
Description:122 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.
Other Identifier(s):(MiAaPQ)AAI3111654
Date Available in IDEALS:2015-09-25
Date Deposited:2003

This item appears in the following Collection(s)

Item Statistics