Ofer Hadar

Senior Academic

Crankback Prediction in Hierarchical ATM Networks

Eyal Felstaine, Reuven Cohen, Ofer Hadar

When an ATM node discovers that it cannot continue the setup of a virtual channel under the requested Quality of Service (QoS), it initiates a backtracking procedure called "crankback." We propose a novel scheme, referred to as crankback prediction, that decreases the crankback overhead. Under the proposed scheme, nodes check during the connection admission control procedure whether the establishment of a virtual channel has a good chance to be admitted over the entire designated route. If this is not the case, crankback is initiated even before a particular QoS parameter is violated. The main idea behind the proposed scheme is to allocate a "quota" to the Peer Groups (PGs) along the message path, and then to suballocate this quota to the child PGs of these PGs. This process continues recursively until reaching the 1-level PG, which contains only physical nodes. The main advantage of the proposed scheme is that it lowers the setup delay and the processing and communication load imposed by signaling messages that establish unused portions of Virtual Channels (VCs).

Publication language English
Pages 327-355
Journal Journal of Network and Systems Management
Volume 10
Issue number 3
Publication status Published - 01.09.2002

Keywords

ATM
Crankback
Hierarchical networks
MPLS
NiMRoD
QoS routing

ASJC Scopus subject areas

Information Systems
Hardware and Architecture
Computer Networks and Communications
Strategy and Management
Access to Document
10.1023/A:1019862510606
Other files and links
Link to publication in Scopus