An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates
IEEE/ACM Transactions on Networking (TON)
Routing in multihop packet switching networks: Gb/s challenge
IEEE Network: The Magazine of Global Internetworking
A distributed overload control algorithm for delay-bounded call setup
IEEE/ACM Transactions on Networking (TON)
Implementation and Analysis of PCC (Parallel Connection Control)
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed control of wireless ATM networks using CORBA
Computer Communications
| Hi-index | 0.00 |
A common approach used for decreasing end-to-end connection setup delay in ATM networks is to provision partial segments a priori using virtual path connections (VPCs). In this paper, we present an analysis to study the effect of such provisioning. The analysis demonstrates that significant savings in bandwidth, and hence network costs, are achieved if the number of provisioned VPCs are minimized, especially if there is uncertainty in the traffic pattern characterization. For a given example, we show that to achieve a 0.1 % blocking probability requirement, if link capacities are shared (i.e., not partitioned a priori to provisioned VPCs), resource savings of 14.4%, 47.9% or 80% are possible under exact, approximate and poor traffic characterizations, respectively. If the above bandwidth savings are to be achieved in networks that use traditional node-by-node connection setup approaches, end-to-end connection setup delay will increase. In this paper, we propose a new connection setup algorithm that allows the savings in bandwidth obtained through sharing while at the same time controlling the connection setup delay.