MULTI-HOUR, MULTI-TRAFFIC CLASS NETWORK DESIGN FOR VIRTUAL PATH-BASEDDYNAMICALLY RECONFIGURABLE WIDE-AREA ATM NETWORKS

Authors
Citation
D. Medhi, MULTI-HOUR, MULTI-TRAFFIC CLASS NETWORK DESIGN FOR VIRTUAL PATH-BASEDDYNAMICALLY RECONFIGURABLE WIDE-AREA ATM NETWORKS, IEEE/ACM transactions on networking, 3(6), 1995, pp. 809-818
Citations number
44
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
ISSN journal
10636692
Volume
3
Issue
6
Year of publication
1995
Pages
809 - 818
Database
ISI
SICI code
1063-6692(1995)3:6<809:MMCNDF>2.0.ZU;2-3
Abstract
Virtual path (VP) concept has been gaining attention in terms of effec tive deployment of asynchronous transfer mode (ATM) networks in recent years, In a recent paper, we outlined a framework and models for netw ork design and management of dynamically reconfigurable ATM networks b ased on the virtual path concept from a network planning and managemen t perspective. Our approach has been based on statistical multiplexing of traffic within a traffic class by using a virtual path for the cla ss and deterministic multiplexing of different virtual paths, and on p roviding dynamic bandwidth and reconfigurability through virtual path concept depending on traffic load during the course of the day, In thi s paper, we discuss in detail, a multi-hour, multi-traffic class netwo rk (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 t raffic class in a virtual path, and the deterministic' multiplexing of different virtual paths leads to decoupling of the network dimensioni ng problem into the bandwidth estimation problem and the combined virt ual 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 sub gradient optimization, We provide computational results for realistic network traffic data to show the effectiveness of our approach, We sho w for the test problems considered, our approach does between 6% to 20 % better than a local shortest-path heuristic, We also show that consi dering 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 sta tic network based on maximum busy hour traffic.