Crankback Prediction in Hierarchical ATM Networks

  • Authors:

  • Eyal Felstaine;Reuven Cohen;Ofer Hadar

  • Affiliations:

  • Department of Computer Science, Technion, Haifa, Israel/ eyal@sanrad.com;Department of Computer Science, Technion, Haifa, Israel;Department of Computer Science, Technion, Haifa, Israel

  • Venue:
  • Journal of Network and Systems Management
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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)