scispace - formally typeset
Search or ask a question
Author

Demetrios Stamatelakis

Bio: Demetrios Stamatelakis is an academic researcher from University of Alberta. The author has contributed to research in topics: Mesh networking & Network topology. The author has an hindex of 8, co-authored 8 publications receiving 1137 citations.

Papers
More filters
Proceedings ArticleDOI
07 Jun 1998
TL;DR: It is shown that through a strategy of pre-failure cross-connection between the spare links of a mesh network, it is possible to achieve 100% restoration with little, if any, additional spare capacity than in aMesh network.
Abstract: Cycle-oriented preconfiguration of spare capacity is a new idea for the design and operation of mesh-restorable networks. It offers a sought-after goal: to retain the capacity-efficiency of a mesh-restorable network, while approaching the speed of line-switched self-healing rings. We show that through a strategy of pre-failure cross-connection between the spare links of a mesh network, it is possible to achieve 100% restoration with little, if any, additional spare capacity than in a mesh network. In addition, we find that this strategy requires the operation of only two cross-connections per restoration path. Although spares are connected into cycles, the method is different than self-healing rings because each preconfigured cycle contributes to the restoration of more failure scenarios than can a ring. Additionally, two restoration paths may be obtained from each pre-formed cycle, whereas a ring only yields one restoration path for each failure it addresses. We give an optimal design formulation and results for preconfiguration of spare capacity and describe a distributed self-organizing protocol through which a network can continually approximate the optimal preconfiguration state.

594 citations

Journal ArticleDOI
TL;DR: The aim of the paper is to explain the basic p-cycle concept and its adaptation to both link and node restoration in the IP transport layer, and to outline certain initial results on the problem of optimized design of p- cycle based IP networks.
Abstract: We describe a novel restoration strategy called virtual protection cycles (p-cycles, patents pending) for extremely fast restoration in IP networks. Originally conceived for use in WDM and Sonet transport networks, we outline the adaption of the p-cycle concept to an IP environment. In an IP router-based network, p-cycles are implemented with virtual circuits techniques (such as an MPLS label switched path, or other means) to form closed logical loops that protect a number of IP links, or a node. In the event of failure, packets which would normally have been lost are encapsulated with a p-cycle IP address and reenter the routing table, which diverts them onto a protection cycle. They travel by normal forwarding or label switching along the p-cycle until they reach a node where the continuing route cost to the original destination is lower than that at the p-cycle entry node. Diverted packets are deencapsulated (dropped from the p-cycle) at that node and follow a normal (existing) route from there to their destination. Conventional routing protocols such as OSPF remain in place and operate as they do today, to develop a longer term global update to routing tables. Diversionary flows on the p-cycle inherently cease when the global routing update takes effect in response to the failed link or node. The p-cycle thus provides an immediate real-time detour, preventing packet loss, until conventional global routing reconvergence occurs. The aim of the paper is to explain the basic p-cycle concept and its adaptation to both link and node restoration in the IP transport layer, and to outline certain initial results on the problem of optimized design of p-cycle based IP networks.

178 citations

Journal ArticleDOI
TL;DR: It is shown in a bounding-type of argument that the proposed protection cycles ("p-cycles") have as high a restoration efficiency as it is possible to expect for any type of preconfigured pattern, and are categorically superior to pre configured linear segments or trees.
Abstract: Previous work on restorable networks has shown experimentally that one can support 100% restoration with an optimized set of closed cycles of spare capacity while requiring little or no increase in spare capacity relative to a span-restorable mesh network. This is important and unexpected because it implies that future restoration schemes could be as capacity efficient as a mesh network, while being as fast as ring-based networks because there is no real-time work at any nodes other than the two failure nodes. This paper complements the prior work by giving a greater theoretical basis and insight to support the prior results. We are able to show in a bounding-type of argument that the proposed protection cycles ("p-cycles") have as high a restoration efficiency as it is possible to expect for any type of preconfigured pattern, and are categorically superior to preconfigured linear segments or trees. We are also able to show that the capacity efficiency of a fully preconfigured p-cycle network has the same well-known lower bound as that of a span restorable mesh network which is cross-connected on-demand. These results provide a theoretical underpinning for the efficiency of p-cycles and confirmation of the experimental observations.

148 citations

Journal ArticleDOI
TL;DR: New ideas in capacity design and ring-to-mesh evolution are given, as well as a systematic comparison of the capacity requirements of several mesh-based schemes showing how they perform over a range of network graph connectivity.
Abstract: This article is devoted to a selection of recent topics in survivable networking. New ideas in capacity design and ring-to-mesh evolution are given, as well as a systematic comparison of the capacity requirements of several mesh-based schemes showing how they perform over a range of network graph connectivity. The work provides new options and insights to address the following questions. How does one evolve from an existing ring-based network to a future mesh network? If the facilities graph is very sparse, how can mesh efficiency be much better than rings? How do the options for mesh protection or restoration rank in capacity requirements? How much is efficiency increased if we enrich our network connectivity? We also outline p-cycles, showing this new concept can realize ring-like speed with meshlike efficiency. The scope is limited to conveying basic ideas with an understanding that they could be further adapted for use in IP or DWDM layers with GMPLS-type protocols or a centralized control plane.

114 citations

Patent
23 Jan 2007
TL;DR: In this article, a method for finding and constructing closed paths is described in which statelets are broadcast through the network, in a preferred method of implementation, the statelet broadcast occurs not in response to a network failure, but across the entire network before any particular span failure and may be carried out during normal network operations as a continual re-configuration of the network.
Abstract: A method for restoring traffic in a network. The network includes plural distinct nodes interconnected by plural distinct spans, each span having working links and spare links. Each node has a digital cross-connect switch for making and breaking connections between adjacent spans forming span pairs at a node. Cross-connections between spare links in adjacent spans are made such that sets of successive nodes through which the adjacent spans form span paths form closed paths. A method of finding and construction closed paths is described in which statelets are broadcast through the network. In a preferred method of implementation of the method, the statelet broadcast occurs not in response to a network failure, but across the entire network before any particular span failure and may be carried out during normal network operations as a continual re-configuration of the network.

74 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: An architectural framework for resilience and survivability in communication networks is provided and a survey of the disciplines that resilience encompasses is provided, along with significant past failures of the network infrastructure.

698 citations

Proceedings ArticleDOI
07 Jun 1998
TL;DR: It is shown that through a strategy of pre-failure cross-connection between the spare links of a mesh network, it is possible to achieve 100% restoration with little, if any, additional spare capacity than in aMesh network.
Abstract: Cycle-oriented preconfiguration of spare capacity is a new idea for the design and operation of mesh-restorable networks. It offers a sought-after goal: to retain the capacity-efficiency of a mesh-restorable network, while approaching the speed of line-switched self-healing rings. We show that through a strategy of pre-failure cross-connection between the spare links of a mesh network, it is possible to achieve 100% restoration with little, if any, additional spare capacity than in a mesh network. In addition, we find that this strategy requires the operation of only two cross-connections per restoration path. Although spares are connected into cycles, the method is different than self-healing rings because each preconfigured cycle contributes to the restoration of more failure scenarios than can a ring. Additionally, two restoration paths may be obtained from each pre-formed cycle, whereas a ring only yields one restoration path for each failure it addresses. We give an optimal design formulation and results for preconfiguration of spare capacity and describe a distributed self-organizing protocol through which a network can continually approximate the optimal preconfiguration state.

594 citations

Journal ArticleDOI
TL;DR: An overview of the traffic grooming problem is given and some representative work in this area is surveyed, showing that grooming traffic in general mesh networks is an important emerging problem.
Abstract: The emergence of wavelength-division multiplexing technology has led to a tremendous increase In the available transmission capacity in wide area networks. Consequently, these networks may no longer be limited by the transmission bandwidth, but rather by the processing capability of electronic switches, routers, and multiplexers in the network. This realization has led to a new wave of research aimed at overcoming the electronic bottleneck by providing optical bypass at the WDM layer. Traffic grooming can be used as a bypass mechanism by which low-rate circuits are assigned to wavelengths in order to minimize the amount of electronic multiplexing equipment. This topic has received a significant amount of attention in both the research and commercial arenas. We give an overview of the traffic grooming problem and survey some representative work in this area. While most work has focused on grooming in SONET rings, grooming traffic in general mesh networks is an important emerging problem.

357 citations

Journal ArticleDOI
TL;DR: A comprehensive methodology to evaluate network resilience using a combination of topology generation, analytical, simulation, and experimental emulation techniques with the goal of improving the resilience and survivability of the Future Internet.
Abstract: As the Internet becomes increasingly important to all aspects of society, the consequences of disruption become increasingly severe. Thus it is critical to increase the resilience and survivability of future networks. We define resilience as the ability of the network to provide desired service even when challenged by attacks, large-scale disasters, and other failures. This paper describes a comprehensive methodology to evaluate network resilience using a combination of topology generation, analytical, simulation, and experimental emulation techniques with the goal of improving the resilience and survivability of the Future Internet.

216 citations

Patent
Sunil P. Shah1
07 Feb 2005
TL;DR: In this article, a method and apparatus is provided for automatic protection switching in a ring network by creating a protection domain having a control vlan and protected data vlans and designating a master node and transit nodes connected by a primary port and a secondary port.
Abstract: A method and apparatus is provided for automatic protection switching in a ring network by creating a protection domain having a control vlan and protected data vlans and designating a master node and transit nodes connected by a primary port and a secondary port. The master node blocks the secondary port for data vlan traffic until it detects a fault either by notice from a transit node or by polling. When a fault is detected, the master node unblocks the secondary port for data vlan traffic. When the fault is restored, the transit node temporarily blocks the restored port to data vlan traffic thereby preventing a loop. Each time the secondary port is blocked and unblocked, the forwarding databases on all the nodes are flushed.

211 citations