Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
Routing in communications networks
Routing in communications networks
Concurrent ATM connection setup reducing need for VP provisioning
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Route optimization in mobile ATM networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Route optimization in mobile ATM networks
Mobile Networks and Applications - Special issue on protocols and software paradigms of mobile networks
| Hi-index | 0.00 |
In earlier papers, we proposed the PCC (Parallel Connection Control) algorithm for the setup and release of on-demand ATM (Asynchronous Transfer Mode) connections. This paper describes an implementation and analysis of PCC. The PCC algorithm is implemented on a testbed of three types of ATM switches from which service time measurements (software execution times) are obtained. These measured service times are used as input data for an analytical queueing network model to characterize the PCC end-to-end setup delay and maximum throughputs. Assuming all connections pass through ten switches, for this measured data, PCC has a theoretical maximum throughput of 343 calls/sec/switch, and at about 90% of this maximum limit (i.e., at 310 calls/sec/switch), the mean end-to-end connection setup delay is only 43ms. We also compare PCC performance against an equivalent sequential connection setup/release approach. We observe that PCC end-to-end setup delay is much smaller than the sequential setup delay (34% at low load and even smaller at higher load). Also, the per-switch maximum throughput of the PCC approach is 80% more compared to the sequential approach.