Crankback Prediction in Hierarchical ATM Networks [Vol. 10, No. 3, 2002]

Crankback Prediction in Hierarchical ATM Networks

Eyal Felstaine
Sanrad ltd.
Email: eyal_AT_sanrad.com

Reuven Cohen
Faculty of Computer Science,
Technion,
3200, Haifa,
Israel
Email: rcohen_AT_cs.technion.ac.il

Ofer Hadar
Communication Systems Egineering Department,
Ben-Gurion University of the Negev,
84105, Be'er-Sheva, Israel.
Email: hadar_AT_bgumail.bgu.ac.il

Abstract
When an ATM node discovers that it cannot continue the setup of a virtual channel under the requested QoS, it initiates a back-tracking 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 certain QoS parameter is exceeded. The main idea behind the proposed scheme is to allocate a ``quota'' to the PGs along the message path, and then to sub-allocate this quota to the son 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 VCs.

Keywords: routing, ATM, PNNI, hierarchical, networks, crankback, NIMROD

JNSM: Vol. 10, No. 3, 2002 Crankback Prediction in Hierarchical ATM Networks [Vol. 10, No. 3, 2002]

NOTE: only abstract of paper available on-line; please contact your library or the authors for the full paper

Back to JNSM main page