Improving service differentiation in IP networks through dual topology routing

Kwong, Kin Wah; Guérin, Roch; Shaikh, Anees; Shu, Tao

doi:10.1145/1364654.1364675

Cited by 11 publications

(10 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2) Traffic matrix: The traffic matrix M = [r (s, t)] |V |×|V | is generated using a gravity model [8], [11] as follows: Traffic volume from node s to node t is defined as r (s, t) = b s e a t P i∈V \{s} e a i where b s is the total traffic originating at node s, and is given by Uniform(a, b) denotes a random variable uniformly distributed in [a, b], a t is the "mass" of node t which is proportional to the number of links it has and i∈V a i = 1. The larger a node's mass, the more traffic it attracts.…”

Section: A Evaluation Settings 1) Network Topologiesmentioning

confidence: 99%

On the Feasibility and Efficacy of Protection Routing in IP Networks

Kwong

Gao

Guérin

2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options can be activated, while waiting for an update from the centralized server after the failure of an individual component (link or node). We provide analytical insight into the feasibility of such backups as a function of network structure, and quantify their computational complexity. We also develop an efficient heuristic reconciling protectability and performance, and demonstrate its effectiveness in a broad range of scenarios. The results should facilitate deployments of centralized routing solutions. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/ese_papers/521 On the Feasibility and Efficacy of Protection Routing in IP NetworksKin-Wah Kwong * , Lixin Gao † , Roch Guérin * , and Zhi-Li Zhang ‡ * University of Pennsylvania, † University of Massachusetts, ‡ University of Minnesota kkw@seas.upenn.edu, lgao@ecs.umass.edu, guerin@ee.upenn.edu, zhzhang@cs.umn.edu Abstract-With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options can be activated, while waiting for an update from the c...

show abstract

Section: A Evaluation Settings 1) Network Topologiesmentioning

confidence: 99%

On the Feasibility and Efficacy of Protection Routing in IP Networks

Kwong

Gao

Guérin

2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…The delay-sensitive traffic matrix is generated using the random model of [11] where we assume that each SD pair generates delay-sensitive traffic. The total volume of delay-sensitive traffic is specified as a fraction 0 < f < 1 of the total network traffic volume.…”

Section: Traffic Matricesmentioning

confidence: 99%

“…We illustrate this using a 30-node, 120-link RandTopo as an example 11 . Table 6 shows the number of SLA violations under both regular and robust optimizations for different SLA bounds.…”

Section: Effect Of Sla Delay Constraintmentioning

confidence: 99%

“…Table 6 shows the number of SLA violations under both regular and robust optimizations for different SLA bounds. Robust optimization consistently yields a significantly smaller number of SLA violations than regular 11 Its maximum end-to-end propagation delay was set to 25ms. Recall that the relative insensitivity to failures of robust optimization stems primarily from its selection of paths that are slightly sub-optimal under normal conditions, but capable of preserving performance in the presence of failures.…”

Section: Effect Of Sla Delay Constraintmentioning

confidence: 99%

“…When it comes to routing, this has triggered interest in solutions that compute paths according to different criteria as exemplified in the Multi-Topology Routing (MTR) extensions [18,17]. This added flexibility can be used to improve service differentiation for multiple performance criteria, e.g., [11], or improve robustness to failures, e.g., [10,8,1]. As detailed in Section 2, each of these issues is reasonably well understood in isolation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Balancing performance, robustness and flexibility in routing systems

Kwong

Guérin

Shaikh

et al. 2010

IEEE Trans. Netw. Serv. Manage.

Self Cite

View full text Add to dashboard Cite

Modern networks face the daunting task of handling increasingly diverse traffic that is displaying a growing intolerance to disruptions. This has given rise to many initiatives, and in this paper we focus on multiple topology routing as the primary vehicle for meeting those demands. Specifically, we seek routing solutions capable of not just accommodating different performance goals, but also preserving them in the presence of disruptions. The main challenge is computational, i.e., to identify among the enormous number of possible routing solutions the one that yields the best compromise between performance and robustness. This is where our principal contribution lies, as we expand the definition of critical links -a key concept in improving the efficiency of routing computation -and develop a precise methodology to efficiently converge on those solutions. Using this new methodology, we demonstrate that one can compute routing solutions that are both flexible in accommodating different performance requirements and robust in maintaining them in the presence of failures and traffic fluctuations. ABSTRACTModern networks face the daunting task of handling increasingly diverse traffic that is displaying a growing intolerance to disruptions. This has given rise to many initiatives, and in this paper we focus on multiple topology routing as the primary vehicle for meeting those demands. Specifically, we seek routing solutions capable of not just accommodating different performance goals, but also preserving them in the presence of disruptions. The main challenge is computational, i.e., to identify among the enormous number of possible routing solutions the one that yields the best compromise between performance and robustness. This is where our principal contribution lies, as we expand the definition of critical links -a key concept in improving the efficiency of routing computation -and develop a precise methodology to efficiently converge on those solutions. Using this new methodology, we demonstrate that one can compute routing solutions that are both flexible in accommodating different performance requirements and robust in maintaining them in the presence of failures and traffic fluctuations.

show abstract

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

Fan

2019

Int J Communication

View full text Add to dashboard Cite

The exponential growth of various applications requires deploying an ever-growing number of network services. A generalized service deployment framework for Open Shortest Path First (OSPF) networks is proposed in this paper. The framework includes placing programmable routers, distributing different types of services on these routers, and leading traffic flow through them according to the predetermined sequence order requirement. However, it is not possible to direct all the traffic flows through the required service nodes along the shortest path with a single and suitable set of link weights. To address the issue, multiple topology routing (MTR) technique is incorporated to have various logical topologies with multiple sets of link weights. Correspondingly, the problem of jointly optimizing Placement of programmable routers, Distribution of different types of services among these routers, and Link Weights setting based on MTR (shortened to PD-LW-MTR) and its mixed integer linear programming formulation are presented in this paper. A novel decomposition algorithm is also proposed to address this problem efficiently. Experiment results validate the correctness and feasibility of our algorithm. It is also shown that the optimization algorithm can obtain near-optimal solution and just only a few logical topologies over multiple sets of link weights are necessary for traffic flows to guarantee service order requirements. KEYWORDS link weight setting, multiple topology routing (MTR), placement and distribution (PD), service deployment, service order requirement Int J Commun Syst. 2019;32:e3978.wileyonlinelibrary.com/journal/dac

show abstract

Improving service differentiation in IP networks through dual topology routing

Cited by 11 publications

References 25 publications

On the Feasibility and Efficacy of Protection Routing in IP Networks

On the Feasibility and Efficacy of Protection Routing in IP Networks

Balancing performance, robustness and flexibility in routing systems

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

Contact Info

Product

Resources

About