Abstract
Broadband integrated services digital networks (B-ISDN) must handle multiclass traffic with diverse quality of service requirements. We consider a multiclass routing model in which routes are calculated in a distributed fashion by the call originating nodes. Within this general context, we address the problem of rerouting a set of previously routed calls to avoid a failed link. Under the approach we propose, a single node executes an aggregate, global rerouting of all affected calls and then converts the set of aggregate routes into an allocation of bandwidth on each link to call origination nodes for the purpose of rerouting. The bandwidth allocation is distributed to each origination node, which in turn then calculates routes for the individual calls. The problem faced by each call origination node is a variant of the socalled bandwidth packing problem. We develop and analyze an approximate algorithm for solving this problem in the specific context that arises in our setting.
Similar content being viewed by others
References
L. Gun, and R. Guerin. A unified approach to bandwidth allocation and access control in fast packet switching networks,INFOCOM'92, pp. 1–12, 1992.
L. Gun, and R. Guerin. A framework for bandwidth management and congestion control in high-speed networks, to appear inComputer Networks and ISDN.
F. Kelly, Routing in circuit switched networks: Optimization, shadow prices and decentralization,Advances in Applied Probability, Vol. 20, pp. 112–144, 1988.
M. Laguna, and F. Glover, 1993, Bandwidth packing: a tabu search approach,Management Science, Vol. 39, pp. 492–500.
Park, K., S. Kang, and S. Park, An integer programming approach to the bandwidth packing problem,manuscript, 1994.
M. Parker, and J. Ryan, A column generation algorithm for bandwidth packing,Telecommunication Systems, Vol. 2, pp. 185–195, 1994.
R. Kawamura, K. Sato, and I. Tokizawa, Self-healing ATM networks based on virtual path concept,IEEE Journal on Selected Areas in Communications, Vol. 12, No. 1, pp. 120–127, 1993.
J. Anderson, B. Doshi, S. Dravida, and P. Harshavardhana, Fast restoration of ATM networks,IEEE Journal on Selected Areas in Communications, Vol. 12, No. 1, pp. 128–138, 1993.
R. Ahuja, T. Magnanti, and J. Orlin,Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1993.
S. Martello, and P. Toth, 1990,Knapsack Problems, John Wiley & Sons, 1990.
C. Colbourn,The Combinatorics of Network Reliability, Oxford University Press, 1987.
J. Y. LeBoudec, The asynchronous transfer mode: a tutorial,Computer Networks and ISDN Systems, Vol. 24, pp. 279–309, 1992.
R. O. Onvural,Asynchronous Transfer Mode Networks: Performance Issues, Artech House, Inc., 1994.
Author information
Authors and Affiliations
Additional information
The research was supported by IBM Corporation and by NSF Grant No. CDR-8803012.
On personal leave from IBM RTP.
Rights and permissions
About this article
Cite this article
Ball, M.O., Vakhutinsky, A., Chimento, P. et al. Distributed call rerouting in multiclass broadband networks. J Netw Syst Manage 3, 381–404 (1995). https://doi.org/10.1007/BF02139531
Issue Date:
DOI: https://doi.org/10.1007/BF02139531