Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks

The virtual path (VP) concept has been gaining attention in terms of effective deployment of asynchronous transfer mode (ATM) networks in recent years. In a recent paper, we outlined a framework and models for network design and management of dynamically reconfigurable ATM networks based on the virtual path concept from a network planning and management perspective. Our approach has been based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through virtual path concept depending on traffic load during the course of the day. In this paper, we discuss in detail, a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in such dynamically reconfigurable networks. This is done based on the observation that statistical multiplexing of virtual circuits for a traffic class in a virtual path, and the deterministic multiplexing of different virtual paths leads to decoupling of the network dimensioning problem into the bandwidth estimation problem and the combined virtual path routing and capacity design problem. We discuss how bandwidth estimation can be done, then how the design problem can be solved by a decomposition algorithm by looking at the dual problem and using subgradient optimization. We provide computational results for realistic network traffic data to show the effectiveness of our approach. We show for the test problems considered, our approach does between 6% to 20% better than a local shortest-path heuristic. We also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% and 14% in network design costs compared to a static network based on maximum busy hour traffic.

[1]  Steven D. Schwartz,et al.  Network Routing Evolution , 1990 .

[2]  Ken-ichi Sato,et al.  Virtual Path and Link Capacity Design for ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[3]  J. Burgin,et al.  Broadband ISDN resource management: the role of virtual paths , 1991, IEEE Communications Magazine.

[4]  Shigeo Shioda,et al.  Centralized Virtual Path Bandwidth Allocation Scheme for ATM Networks , 1992 .

[5]  Sanghyun Ahn,et al.  Virtual path layout design on ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[7]  Ken-ichi Sato,et al.  Self-healing ATM networks based on virtual path concept , 1994, IEEE J. Sel. Areas Commun..

[8]  A. Weinrib,et al.  Dynamic network configuration management , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[9]  Aaron Kershenbaum,et al.  Network management and control , 1990 .

[10]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[11]  Ken-ichi Sato,et al.  Broad-band ATM network architecture based on virtual paths , 1990, IEEE Trans. Commun..

[12]  Luigi Fratta,et al.  Statistical Multiplexing in ATM Networks , 1991, Perform. Evaluation.

[13]  D. L. Jagerman.  Methods in traffic calculations , 1984, AT&T Bell Laboratories Technical Journal.

[14]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[15]  Roger C. F. Tucker,et al.  Accurate method for analysis of a packet-speech multiplexer with limited delay , 1988, IEEE Trans. Commun..

[16]  Izhak Rubin,et al.  Teletraffic Issues in ATM Networks , 1993, Comput. Networks ISDN Syst..

[17]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[18]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .

[19]  I.W. Habib,et al.  Controlling flow and avoiding congestion in broadband networks , 1991, IEEE Communications Magazine.

[20]  Mario Gerla,et al.  Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..

[21]  Åke Arvidsson,et al.  Management of Reconfigurable Virtual Path Networks , 1994 .

[22]  Keith W. Ross,et al.  Routing in virtual path based ATM networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[23]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[24]  Bezalel Gavish,et al.  Capacity and Flow Assignments in Large Computer Networks , 1986, INFOCOM 1986.

[25]  Nguyen Duc,et al.  ISDN protocol architecture , 1985, IEEE Commun. Mag..

[26]  John Burgin.  Broadband ISDN Resource Management , 1990, Comput. Networks ISDN Syst..

[27]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[28]  Hiroshi Saito,et al.  Teletraffic Technologies in ATM Networks , 1994 .

[29]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..

[30]  Mario Gerla,et al.  Bandwidth allocation in broadband integrated services digital networks , 1990 .

[31]  M. De Prycker.  ATM switching on demand , 1992 .

[32]  Suzanne P. Evans,et al.  Optimal Bandwidth Management and Capacity Provision in a Broadband Network Using Virtual Paths , 1991, Perform. Evaluation.

[33]  Bezalel Gavish,et al.  Routing in a Network with Unreliable Components , 1988, IEEE Trans. Commun..

[34]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[35]  Ming-Jeng Lee,et al.  A design algorithm for reconfigurable ATM networks , 1993, Telecommun. Syst..

[36]  Deep Medhi,et al.  Models for Network Design, Servicing and Monitoring of ATM Networks Based on the Virtual Path Concept , 1997, Comput. Networks ISDN Syst..

[37]  Donald F. Towsley,et al.  MDP routing in ATM networks using virtual path concept , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[38]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[39]  Karl Lindberger,et al.  Dimensioning and Design Methods for Integrated ATM Networks , 1994 .

[40]  R. Siebenhaar,et al.  Optimized ATM virtual path bandwidth management under fairness constraints , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[41]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[42]  J.-F.P. Labourdette,et al.  Analysis and Design of Fully Shared Networks , 1994 .

[43]  J. Filipiak,et al.  M-architecture: a structural model of traffic management and control in broadband ISDNs , 1989, IEEE Communications Magazine.

[44]  Roy D. Yates,et al.  A Layered Broadband Switching Architecture with Physical or Virtual Path Configurations , 1991, IEEE J. Sel. Areas Commun..

[45]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .