NDLI: Fixed point approximation for multirate multihop loss networks with state-dependent routing

Content Provider	ACM Digital Library
Author	Baras, John S. Liu, Mingyan
Abstract	In this paper we consider a class of loss networks that have arbitrary topologies and routes of arbitrary length. Multiple traffic classes are present, each with different bandwidth requirement, and each routed according to a state-dependent routing scheme. In particular, we consider the least loaded routing method generalized to routes of arbitrary number of hops. The connection level performance metric of interest is the end-to-end blocking probability. We are interested in developing fast evaluation methods to provide reasonably accurate estimates of the blocking probability, especially under heavy traffic load. Our algorithms are based on the fixed-point method framework, also known as the reduced load approximation. In addition to what commonly examined by previous work, two more factors contribute to the complexity of the computation in the scenario under consideration in this paper. One is the state-dependent nature of the routing mechanism, the other is the possible overlapping between routes due to the general multihop topology of the network. We present two fast approximation algorithms to evaluate the blocking probability with state-dependent routing by simplifying the route overlapping computation. We discuss the computational complexity of our algorithms as well as sources of approximation error. We then compare the numerical results with that of simulation and show that our algorithms provide fairly accurate blocking probability estimates especially under heavy traffic load.
Starting Page	361
Ending Page	374
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2004.826248
Volume Number	12
Issue Number	2
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-04-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Blocking probability Fixed point approximation Least loaded routing Loss network Multihop Multirate Performance modeling State-dependent routing
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fixed point approximation for multirate multihop loss networks with state-dependent routing

Fixed Point Approximation for Multirate Multihop Loss Networks with State-Dependent Routing (2004)

Computing approximate blocking probabilities for large loss networks with state-dependent routing (1993)

An Analytic Approach to Efficiently Computing Call Blocking Probabilities for Multiclass WDM Networks

An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks

Polynomial-time algorithms for multirate anypath routing in wireless multihop networks

Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing

Fixed point approximation for multirate multihop loss networks with adaptive routing (1999).

Performance analysis for hierarchical multirate loss networks

Fixed point approximation for multirate multihop loss networks with state-dependent routing

Similar Documents

Fixed point approximation for multirate multihop loss networks with state-dependent routing

Fixed Point Approximation for Multirate Multihop Loss Networks with State-Dependent Routing (2004)

Computing approximate blocking probabilities for large loss networks with state-dependent routing (1993)

An Analytic Approach to Efficiently Computing Call Blocking Probabilities for Multiclass WDM Networks

An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks

Polynomial-time algorithms for multirate anypath routing in wireless multihop networks

Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing

Fixed point approximation for multirate multihop loss networks with adaptive routing (1999).

Performance analysis for hierarchical multirate loss networks

Fixed point approximation for multirate multihop loss networks with state-dependent routing