Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks

Thulasiraman, K.; Javed, Muhammad; Xue, Guoliang

doi:10.1109/infcom.2009.5062014

Cited by 34 publications

(23 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The question then arises whether there exists a dual methodology based on cuts. The work in [21] answered this question in the affirmative and provided a unified algorithmic framework for the SLTM problem. The work also provided much insight into the structure of solutions for the SLTM problem.…”

Section: Circuits/cutsets Duality and A Unified Algorithmic Frammentioning

confidence: 94%

“…Using the above concepts several algorithms were proposed in [21] but only four algorithms CIRCUIT-SMART (Fig. 4), CUTSET-SMART (Fig.…”

Section: B) Branches Not In the Sequencementioning

confidence: 99%

“…In section V we develop an algorithm to get a generalized cutset (circuit) cover sequence from any given cutset (circuit) cover sequence. We then present in section VI GEN-CUTSET-SMART and GEN-CUTSET-SMART-SIMPLIFIED algorithms that remove some of the shortcomings of the CUTSET-SMART algorithm of [21]. In section VII we prove that there is a one to one correspondence between the set of generalized circuit cover sequences and the set of cutset cover sequences.…”

Section: Introductionmentioning

confidence: 97%

“…In a recent work [21] we presented a dual framework involving cutsets and showed that both these frameworks possess the same algorithmic structure. Algorithms CIRCUIT-SMART, CUTSET-SMART, CUTSET-SMART-SIMPLIFIED and INCIDENCE-SMART were also presented in [21]. Effectiveness of both these frameworks as well as their robustness in providing survivability against multiple failures depends on the lengths of the cutset cover and circuit cover sequences on which they are based.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Primal meets dual: A generalized theory of logical topology survivability in IP-over-WDM optical networks

Thulasiraman

Javed

Xue

2010

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)

Self Cite

View full text Add to dashboard Cite

Abstract-The survivable logical topology mapping (SLTM) problem in an IP-over-WDM optical network is to map each link (u, v) in the logical topology (at the IP layer) into a lightpath between the nodes u and v in the physical topology (at the optical layer) such that failure of a physical link does not cause the logical topology to become disconnected. It is assumed that both the physical and logical topologies are 2-edge connected. For this problem Kurant and Thiran [12] presented an algorithmic framework called SMART that involves successively contracting circuits in the logical topology and mapping the logical links in the circuits into edge disjoint lightpaths in the physical topology. In a recent work [21] we presented a dual framework involving cutsets and showed that both these frameworks possess the same algorithmic structure. Algorithms CIRCUIT-SMART, CUTSET-SMART, CUTSET-SMART-SIMPLIFIED and INCIDENCE-SMART were also presented in [21]. Effectiveness of both these frameworks as well as their robustness in providing survivability against multiple failures depends on the lengths of the cutset cover and circuit cover sequences on which they are based. To improve their effectiveness and robustness, in this paper we first introduce the concept of generalized cutset cover and generalized circuit cover sequences. We present an algorithm to get a generalized cutset (circuit) cover sequence from any given cutset (circuit) cover sequence. We then present GEN-CUTSET-SMART and GEN-CUTSET-SMART-SIMPLIFIED algorithms that remove some of the shortcomings of the dual framework of [21]. We prove that there is a one-to-one correspondence between the set of generalized circuit cover sequences and the set of generalized cutset cover sequences. We then show that for each execution of GEN-CIRCUIT-SMART there exists an execution of GEN-CUTSET-SMART-SIMPLIFIED such that the groups of edges that they map into edge disjoint lightpaths are exactly the same. In other words, the distinction between the primal and dual methods disappears when they use generalized sequences. Preliminary simulation results confirm our expectation that GEN-CUTSET-SMART-SIMPLIFIED will perform better than CIRCUIT-SMART and CUTSET-SMART-SIMPLIFIED (when started with a circuit or a cutset sequence) in terms of number of additional protection edges to be added.

show abstract

Section: Circuits/cutsets Duality and A Unified Algorithmic Frammentioning

confidence: 94%

“…Using the above concepts several algorithms were proposed in [21] but only four algorithms CIRCUIT-SMART (Fig. 4), CUTSET-SMART (Fig.…”

Section: B) Branches Not In the Sequencementioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

mentioning

confidence: 99%

See 2 more Smart Citations

Primal meets dual: A generalized theory of logical topology survivability in IP-over-WDM optical networks

Thulasiraman

Javed

Xue

2010

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Javed et al [25][26] obtained improved heuristics based on SMART. Using duality theory in graphs, a generalized theory of logical topology survivability was given in [27][28] [29]. A new structural approach based on logical protecting spanning tree set concept was introduced in [30].…”

Section: Related Workmentioning

confidence: 99%

Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics

Zhou¹,

Lin

Thulasiraman

et al. 2015

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Abstract-Given a cross-layer network with logical and physical topologies, the survivable logical topology routing problem is to route each link in the logical layer with a path in the physical topology between the end nodes of a logical link such that the logical topology remains connected after a physical link fails. The Mixed-Integer Linear Programming (MILP) formulation to determine such a routing has been considered in a recent paper [1]. Using this formulation as a basic building block, in this paper we present unified MILP formulations to determine a survivable logical topology routing that also satisfies one of four cross-layer metrics: (1) minimizing the number of logical links to be added to guarantee the existence of survivable logical topology routing; (2) maximizing the capacity of the logical topology; (3) maximizing the connectivity of the logical topology after a physical link failure; and (4) maximizing the minimum crosslayer cut. We also provide heuristics for these problems and compare the performance of these heuristics and MILPs using extensive simulations.

show abstract

Survivable Virtual Network Embedding

Rahman

Aib

Boutaba

2010

Lecture Notes in Computer Science

120

View full text Add to dashboard Cite

International audienceNetwork virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heuristic algorithms for the VN embedding problem assuming that the InP network remains operational at all times. In this paper, we remove that assumption by formulating the survivable virtual network embedding (SVNE) problem and developing a hybrid policy heuristic to solve it. The policy is based on a fast re-routing strategy and utilizes a pre-reserved quota for backup on each physical link. Evaluation results show that our proposed heuristic for SVNE outperforms baseline heuristics in terms of long term business profit for the InP, acceptance ratio, bandwidth efficiency, and response time

show abstract

Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks

Cited by 34 publications

References 13 publications

Primal meets dual: A generalized theory of logical topology survivability in IP-over-WDM optical networks

Primal meets dual: A generalized theory of logical topology survivability in IP-over-WDM optical networks

Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics

Survivable Virtual Network Embedding

Contact Info

Product

Resources

About