{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81634"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81634","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Load Balancing in Hop -by -Hop Routing With and Without Traffic Splitting","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Wang, Jun"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Nahrstedt, Klara"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:38Z","date_published":"2015-09-25T20:19:38Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3111654"],"render_values":[{"text":"(MiAaPQ)AAI3111654","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81634","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nahrstedt, Klara"]},{"key":"dc:creator","label":"Author","values":["Wang, Jun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:38Z","10000-01-01","2003"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81634","(MiAaPQ)AAI3111654"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2015-09-25T20:19:38Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3111654.pdf: 6730548 bytes, checksum: 31e3339cb4143efb4d50268b148c5218 (MD5) Previous issue date: 2003","Embargo set by: Seth Robbins for item 82915 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","122 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003."]},{"key":"dc:title","label":"Title","values":["Load Balancing in Hop -by -Hop Routing With and Without Traffic Splitting"]}]}],"canonical_facts":{"dc:contributor":["Nahrstedt, Klara"],"dc:creator":["Wang, Jun"],"dc:date":["2015-09-25T20:19:38Z","10000-01-01","2003"],"dc:description":["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.","Made available in DSpace on 2015-09-25T20:19:38Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3111654.pdf: 6730548 bytes, checksum: 31e3339cb4143efb4d50268b148c5218 (MD5) Previous issue date: 2003","Embargo set by: Seth Robbins for item 82915 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","122 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003."],"dc:identifier":["http://hdl.handle.net/2142/81634","(MiAaPQ)AAI3111654"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Load Balancing in Hop -by -Hop Routing With and Without Traffic Splitting"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}