IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
The output of a switch, or, effective bandwidths for networks
Queueing Systems: Theory and Applications
Large Deviations for Small Buffers: An Insensitivity Result
Queueing Systems: Theory and Applications
A measurement-analytic approach for QoS estimation in a network based on the dominant time scale
IEEE/ACM Transactions on Networking (TON)
Many Sources Asymptotics for Networks with Small Buffers
Queueing Systems: Theory and Applications
Analyzing a Two-Stage Queueing System with Many Point Process Arrivals at Upstream Queue
Queueing Systems: Theory and Applications
Decomposition properties in fluid queues
Performance Evaluation
IEEE/ACM Transactions on Networking (TON)
FISTE: A black box approach for end-to-end QoS management
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficiency of FEC coding in IP networks
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
End-to-end quality of service-based admission control using the fictitious network analysis
Computer Communications
An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network
International Journal of Sensor Networks
| Hi-index | 0.00 |
We show that significant simplicities can be obtained for the analysis of a network when link capacities are large enough to carry many flows. We develop a network decomposition approach in which network analysis can be greatly simplified. We prove that the queue length at the downstream queue converges to that of a single queue obtained by removing the upstream queue, as the capacity and the number of flows at the upstream queue increase. The precise modes of convergence vary depending on the type of input traffic, i.e., from regulated traffic arrivals to point process inputs. Our results thus help simplify network analysis by decomposing the original network into a simplified network in which all the nodes with large capacity have been eliminated. By means of extensive numerical investigation under various network scenarios, we demonstrate different aspects and implications of our network decomposition approach. Some of our findings are that our techniques perform well especially for the cases when: i) many flows are multiplexed as they enter the queue and/or ii) departing flows are routed to different downstream nodes, i.e., no single flow dominates at any node.