|Title:||Crankback Prediction in Hierarchical ATM Networks
|Authors:||Eyal Felstaine and Reuven Cohen and Ofer Hadar
|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, refered 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, that 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.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1998/LCCN/LCCN9807), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the LCCN technical reports of 1998
To the main CS technical reports page
Computer science department, Technion