Load Balancing in Hop -by -Hop Routing With and Without Traffic Splitting
Wang, Jun
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81634
Description
Title
Load Balancing in Hop -by -Hop Routing With and Without Traffic Splitting
Author(s)
Wang, Jun
Issue Date
2003
Doctoral Committee Chair(s)
Nahrstedt, Klara
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
