Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering

Xu, Dahai; Chiang, Mung; Rexford, Jennifer

doi:10.1109/infocom.2007.94

Cited by 36 publications

(62 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typically, flows are equally split and forwarded among several shortest paths if they exist [11]. Also, the flow-splitting fractions can be online configurable via gently modified routing protocols [15]. In this paper, we assume that the CN routers are configured to support the adaptive flow-splitting.…”

Section: B Cn: Destination-based Routing and Traffic Aggregationmentioning

confidence: 99%

See 1 more Smart Citation

Achieving near-optimal traffic engineering in hybrid Software Defined Networks

Song

2015

2015 IFIP Networking Conference (IFIP Networking)

View full text Add to dashboard Cite

Software Defined Networking (SDN) is an emerging networking paradigm which intends to merge networks into the age of the cloud, providing fine-grained control, simplified configurations, unprecedented flexibility and seamless scalability. However, due to the large set of unresolved challenges as well as the deployment cost, network evolution to fully SDN systems will take a long time. In fact, SDN elements are incrementally deployed in enterprise networks, producing a transitional network form of hybrid SDN (H-SDN). An H-SDN system consists of traditional networking elements and SDN elements, accommodating both conventional traffic and SDN traffic. In this paper, we investigate traffic engineering (TE) in H-SDN, where the SDN controller strategically routes SDN traffic so as to optimize the TE performance over all network links shared with uncontrollable conventional traffic. Two hybrid modes are studied: (1) the barrier mode, where the two forms of traffic are routed in separated capacity spaces; and (2) the hybrid mode, where each link can be fully occupied by either form of traffic. We propose fast algorithms for the TE problems in both scenarios with provable approximation guarantees. Theoretical analysis and computer simulations validate the efficacy of our algorithms.

show abstract

Section: B Cn: Destination-based Routing and Traffic Aggregationmentioning

confidence: 99%

“…Here we note that it is a slight change to existing routing table, which can be easily implemented in existing routers [15], [17]. In fact, the idea of flow splitting for TE purpose has been considered in practice, e.g., in [19] and [20].…”

Section: A Transitional Routing Protocol For H-sdnmentioning

confidence: 99%

Achieving near-optimal traffic engineering in hybrid Software Defined Networks

Song

2015

2015 IFIP Networking Conference (IFIP Networking)

View full text Add to dashboard Cite

show abstract

“…This principle has been used in solving some interesting networking problems [4], [13], [14]. In this paper, we apply MEP to address the inverse shortest path problem of CEM.…”

Section: Related Workmentioning

confidence: 99%

“…This work is inspired by the first work connecting the principle of maximum entropy with Internet Protocol (IP) routing called Network Entropy Maximization (NEM) [4]. A proof sketch to show that the CEM problem is NP-hard is given.…”

Section: Introductionmentioning

confidence: 99%

An entropy maximization problem in shortest path routing networks

Chellappan

Sivalingam

Krithivasan

2014

2014 IEEE 20th International Workshop on Local &Amp; Metropolitan Area Networks (LANMAN)

View full text Add to dashboard Cite

In the context of an IP network, we investigate an interesting case of the inverse shortest path problem using the concept of network centrality. For a given network, the centrality distribution associated with the links of a network can be determined based on the number of shortest paths passing through each link. An entropy measure for this distribution is defined, and we then forumulate the inverse shortest problem in terms of maximizing this entropy. We then obtain a centrality distribution that is as broadly distributed as possible subject to the topology constraints. An appropriate change in the weight of a link alters the number of shortest paths that pass through it, thereby modifying the centrality distribution. The idea is to obtain a centrality distribution that maximizes the entropy. This problem is shown to be NP-hard, and a heuristic approach is proposed. An application to handling link failure scenarios in Open Shortest Path First routing is discussed.

show abstract

“…In their proposal, the routers may direct traffic on non-shortest paths with an exponential penalty on longer paths as a heuristic for solving the problem. In addition, Xu et al (2008) proposed Penalizing Exponential Flow-Splitting (PEFT) as an enhanced version of DEFT that achieves optimal traffic engineering while retaining the simplicity of hop-by-hop forwarding. Specifically, they reported a gain of 15% in capacity utilization over OSPF using the Abilene topology and realistic traffic traces.…”

Section: Related Workmentioning

confidence: 99%

Bandwidth-Sensitive Routing: From Individualism to Collectivism

Bazzaz

Zarifzadeh

Lucas

2012

Cybernetics and Systems

View full text Add to dashboard Cite

The routing metric is the measure by which a routing protocol chooses paths between pairs of source and destination nodes in the network. Routing metric has a significant impact on the network resource utilization. The most well-known intradomain routing disciplines in today's Internet are the minimum hop count routing (e.g., Routing Information Protocol (RIP)) and the shortest path routing (e.g., Open Shortest Path First (OSPF) and intermediate system to system (IS-IS)). In the former case, the routing metric is the number of hops over the path and in the latter one, the metric is evaluated with respect to an additive link weight function. In this article, we study the impact of these two types of metrics on routing of bandwidth-sensitive traffic in the network. We first argue that the main characteristics of a bandwidth-sensitive routing problem can be captured elegantly through transforming the problem from the networking domain into the sociology area. This model reveals that the minimum hop count is indeed a dominant Individualist view of resource management in the Internet, whereas the shortest-path metric has a collectivist trend. We then propose a novel hybrid metric, which combines the benefit of both sociological systems. Through extensive simulations, we show that our proposed scheme yields much better results, with respect to the number of admitted requests and delay of paths, compared with other well-known counterparts.

show abstract

Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering

Cited by 36 publications

References 13 publications

Achieving near-optimal traffic engineering in hybrid Software Defined Networks

Achieving near-optimal traffic engineering in hybrid Software Defined Networks

An entropy maximization problem in shortest path routing networks

Bandwidth-Sensitive Routing: From Individualism to Collectivism

Contact Info

Product

Resources

About