Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
ATM network design and optimization: a multirate loss network framework
IEEE/ACM Transactions on Networking (TON)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
QoS based routing algorithm in integrated services packet networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Load Profiling for Efficient Route Selection in Multi-Class Networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Routing guaranteed quality of service connections in integrated services packet networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Routing and rate allocation in rate-based multi-class networks
Performance Evaluation
Performance limits for channelized cellular telephone systems
IEEE Transactions on Information Theory
RSVP and integrated services in the Internet: a tutorial
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Routing and rate allocation in rate-based multi-class networks
Performance Evaluation
Hi-index | 0.00 |
In this paper, we investigate the performance of routing and rate allocation (RRA) algorithms in rate-based multi-class networks. On the arrival of a connection request, an RRA algorithm selects a route for the connection and allocates an appropriate rate on the route; failing this, it blocks the connection request. We measure the performance of an RRA algorithm in terms of its minimum weighted carried traffic. This performance criterion encompasses two widely used performance criteria, namely, weighted carried traffic and minimum carried traffic. We derive an upper bound on the minimum weighted carried traffic of any RRA algorithm. The bound can be computed by solving a linear program. Moreover, we show that the bound is achieved asymptotically, when the offered load and the link capacities are large, by a Partitioning RRA algorithm. Therefore the bound can be used as a performance benchmark for any RRA algorithm. We observe that the proposed Partitioning RRA algorithm, though asymptotically optimal, performs poorly at very low loads. We investigate the cause of this undesirable behaviour and obtain two improved asymptotically optimal RRA algorithms.