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
 · 
42 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Summary. In this paper we introduce and analyze two new cost measures related to the communication overhead and the space requirements associated with virtual path layouts in ATM networks, that is the edge congestion and the node congestion. Informally, the edge congestion of a given edge e at an incident node u is defined as the number of VPs terminating at or starting from u and using e, while the node congestion of a node v is defined as the number of VPs having v as an endpoint. We investigate the problem of constructing virtual path layouts allowing to connect a specified root node to all the others in at most h hops and with maximum edge or node congestion c, for two given integers h and c. We first give tight results concerning the time complexity of the construction of such layouts for both the two congestion measures, that is we exactly determine all the tractable and intractable cases. Then, we provide some combinatorial bounds for arbitrary networks, together with optimal layouts for specific topologies such as chains, rings and grids.
    Distributed Computing 03/2001; 14(2):65-73. · 0.63 Impact Factor
  • 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