Conference Paper

Connection management and rerouting in ATM networks

Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa
DOI: 10.1109/INFCOM.1994.337618 Conference: INFOCOM '94. Networking for Global Communications., 13th Proceedings IEEE
Source: IEEE Xplore

ABSTRACT In ATM networks, two levels of connections are defined: virtual
path connections and virtual channel connections. Virtual paths are the
building blocks of the virtual channels. This hierarchy, known as
“the virtual path concept”, provides considerable advantages
in the design of high-speed networks. In the paper the authors show that
this concept has the advantage of providing a means of improving the
survivability of virtual channels. To this end, they present a simple
rerouting protocol, which can be invoked upon the failure of an
intermediate link or node of a virtual path. This protocol reroutes all
the affected virtual channels to an alternative virtual path. Due to the
simplicity of the protocol, it can be completed rapidly, thus fulfilling
an essential requirement of any rerouting scheme

0 Bookmarks
 · 
38 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a new model that combines quality of service and mobility aspects in wireless ATM networks. Namely, besides the hop count and load parameters of the basic ATM layouts, we introduce a new notion of distance that estimates the time needed to reconstruct the virtual channel of a wireless user when he moves through the network. Quality of service guarantee dictates that the rerouting phase must be imperceptible, that is, the maximum distance between two virtual channels must be maintained as low as possible. Therefore, a natural combinatorial problem arises in which suitable trade-offs must be determined between the different performance measures. We first show that establishing the existence of a layout with maximum hop count h, load l and distance d is NP-complete, even in the very restricted case h=2, l=1 and d=1. We then provide optimal layout constructions for basic interconnection networks, such as chains and rings.
    Discrete Applied Mathematics. 01/2009; 157:98-111.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we consider the problem of constructing ATM layouts for wireless networks in which mobile users can move along a chain of base stations. We first show that deciding the existence of a layout with maximum hop count h, load l and channel distance d is NP-complete for every fixed value of d greater or equal to 1. We then provide optimal layout constructions for the case d ≤ 2. Finally, optimal layout constructions are obtained also for any d within the class of the so-called canonic layouts, that so far have always been shown to be the optimal ones.
    17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings; 01/2003
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we revise some of the most relevant aspects concerning the quality of service in wireless networks, providing, along the research issues we are currently pursuing, both the state-of-the-art and our recent achievements. More specifically, first of all we focus on network survivability, that is the ability of the network of maintaining functionality as a consequence of a component failure. Then, we turn our attention on data access and network services in a distributed environment. Finally, we analyze a basic network optimization task, that is routing design in wireless ATM networks.
    17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings; 01/2003