NDLI: Computing approximate blocking probabilities for large loss networks with state-dependent routing

Content Provider	IEEE Xplore Digital Library
Author	Shun-Ping Chung Kashper, A. Ross, K.W.
Copyright Year	1993
Abstract	A reduced load approximation (also referred to as an Erlang fixed point approximation) for estimating point-to-point blocking probabilities in loss networks (e.g., circuit switched networks) with state-dependent routing is considered. In this approximation scheme, the idle capacity distribution for each link in the network is approximated, assuming that these distributions are independent from link to link. This leads to a set of nonlinear fixed-point equations which can be solved by repeated substitutions. The accuracy and the computational requirements of the approximation procedure for a particular routing scheme, namely least loaded routing, is examined. Numerical results for six-node and 36-node asymmetric networks are given. A novel reduced load approximation for multirate networks with state-dependent routing is also presented.<>
Sponsorship	IEEE Computer Society IEEE Communications Society Association for Computing Machinery (ACM)
Starting Page	105
Ending Page	115
Page Count	11
File Size	1077967
File Format	PDF
ISSN	10636692
Volume Number	1
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1993-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer networks Routing Nonlinear equations State estimation Markov processes Poisson equations Switching circuits Telecommunication traffic Capacity planning Telecommunication control
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Electrical and Electronic Engineering Computer Science Applications Software

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

An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates

About loss probabilities for general routing policies in circuit-switched networks

Blocking Probabilities for Trunk Reservation Policy

A Basic Dynamic Routing Problem and Diffusion

Bounding the Blocking Probabilities in Multirate CDMA Networks Supporting Elastic Services

Reciprocity of blocking probabilities in multiservice loss systems

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

Call blocking probabilities in a two-link multirate loss system for Poisson traffic

Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan

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

Similar Documents

An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates

About loss probabilities for general routing policies in circuit-switched networks

Blocking Probabilities for Trunk Reservation Policy

A Basic Dynamic Routing Problem and Diffusion

Bounding the Blocking Probabilities in Multirate CDMA Networks Supporting Elastic Services

Reciprocity of blocking probabilities in multiservice loss systems

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

Call blocking probabilities in a two-link multirate loss system for Poisson traffic

Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan

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