NDLI: Analysis of networks of queues via projection techniques

Content Provider	IEEE Xplore Digital Library
Author	Mooi Choo Chuah
Copyright Year	1963
Abstract	In this research, the author deviates from the conventional traffic models and approaches. The author uses a traffic model proposed by Cruz (1990). In Cruz's model, the rate functions of traffic sources are assumed to satisfy some linear "burstiness constraints". Such traffic models can be used to describe a class of rate-based flow-controlled sources. A state vector is defined to describe the queueing system. The author divides the operation of the studied queueing system into multiple phases. For each phase, the author writes a system equation to describe completely the behavior of this studied queueing system. The author then proposes the iterative feasible set method to identify the feasible region of the state vector using some linear programming techniques and other existing theorems regarding the projection of convex sets into a space with a lower dimension. Using the above technique, the author studied the performance of three routing schemes in a simple dynamic routing problem, namely the route to shortest rule, the fixed routing rule and the bounded linear rule. The author first identified the feasible regions of a defined state vector for each routing scheme using the proposed method. From the identified feasible regions, the author then analyzed the extremal performance of these routing schemes and compared their performances.<>
Sponsorship	IEEE Control Systems Society
Starting Page	1588
Ending Page	1599
Page Count	12
File Size	1169050
File Format	PDF
ISSN	00189286
Volume Number	39
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-08-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	Queueing analysis Routing Traffic control Telecommunication traffic Cost function Vectors Performance analysis Optimal control Equations Iterative methods
Content Type	Text
Resource Type	Article
Subject	Control and Systems Engineering Electrical and Electronic Engineering 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

Time complexity of a path formulated optimal routing algorithm

Time complexity of a path formulated optimal routing algorithm (second printing)

Distributed Iterative Optimal Resource Allocation With Concurrent Updates of Routing and Flow Control Variables

Moment analysis for traffic associated with Markovian queueing systems

Dependence in packet queues

Optimal control of a queueing system with two interacting service stations and three classes of impatient tasks

Optimal control of admission to a queueing system

Queueing analysis of ATM tandem queues with correlated arrivals

Optimal dynamic routing in communication networks with continuous traffic

Analysis of networks of queues via projection techniques

Similar Documents

Time complexity of a path formulated optimal routing algorithm

Time complexity of a path formulated optimal routing algorithm (second printing)

Distributed Iterative Optimal Resource Allocation With Concurrent Updates of Routing and Flow Control Variables

Moment analysis for traffic associated with Markovian queueing systems

Dependence in packet queues

Optimal control of a queueing system with two interacting service stations and three classes of impatient tasks

Optimal control of admission to a queueing system

Queueing analysis of ATM tandem queues with correlated arrivals

Optimal dynamic routing in communication networks with continuous traffic

Analysis of networks of queues via projection techniques