On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Loss probability calculations and asymptotic analysis for finite buffer multiplexers
IEEE/ACM Transactions on Networking (TON)
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
Broadband Network Traffic: Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action Cost 242
Coordinated multihop scheduling: a framework for end-to-end services
IEEE/ACM Transactions on Networking (TON)
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Decoupling Packet Loss from Blocking in Proactive Reservation-Based Switching
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Designing packet buffers with statistical guarantees
HOTI '04 Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium
Tail probabilities for a multiplexer with self-similar traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Control architecture in optical burst-switched WDM networks
IEEE Journal on Selected Areas in Communications
Optical burst switching: a new area in optical networking research
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In a network of bufferless packet multiplexers, the user-perceived capacity of an ingress-egress tunnel (connection) may degrade quickly with increasing path length. This is due to the compounding of transmission blocking probabilities along the path of the connection, even when the links are not overloaded. In such an environment, providing users (e.g., client ISPs) with tunnels of statistically guaranteed bandwidth may limit the network's connection-carrying capacity.In this paper, we introduce and analyze a transmission-scheduling algorithm that employs randomization and traffic regulation at the ingress, and batch scheduling at the links. The algorithm ensures that a fraction of transmissions from each connection is consistently subject to small blocking probability at every link, so that these transmissions are likely to survive long paths. For this algorithm, we obtain tight bounds on the expectation and tail probability of the blocking rate of any ingress-egress connection. We compare the bounds to those obtained using the FCFS link-scheduling rule. We find that the proposed scheduling algorithm significantly improves the network's connection-carrying capacity.In deriving the desired bounds, we develop an analytic framework for stochastically comparing network-wide routing and bandwidth allocation scenarios with respect to blocking in a packet multiplexer. The framework enables us to formally characterize the routing and bandwidth allocation scenarios that maximize the expected blocking rate along the path of a tagged connection.