NDLI: Convexity in queues with general inputs

Content Provider	IEEE Xplore Digital Library
Author	Neely, M.J. Modiano, E.
Copyright Year	1963
Abstract	In this correspondence, we develop fundamental convexity properties of unfinished work and packet waiting time in a queue serving general stochastic traffic. The queue input consists of an uncontrollable background process and a rate-controllable input stream. We show that any moment of unfinished work is a convex function of the controllable input rate. The convexity properties are then extended to address the problem of optimally routing arbitrary input streams over a collection of K queues in parallel with different (possibly time-varying) server rates (/spl mu//sub 1/(t),...,/spl mu//sub K/(t)). Our convexity results hold for stream-based routing (where individual packet streams must be routed to the same queue) as well as for packet-based routing where each packet is routed to a queue by probabilistic splitting. Our analysis uses a novel technique that combines sample path observations with stochastic equivalence relationships.
Sponsorship	IEEE Information Theory Society
Starting Page	706
Ending Page	714
Page Count	9
File Size	352728
File Format	PDF
ISSN	00189448
Volume Number	51
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-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	Multiaccess communication Stochastic processes Routing Neural networks Glass Interference cancellation Probability Error correction Information theory stochastic coupling G/G/1 queue
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems 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

On the usefulness of outer-loop power control with successive interference cancellation

Analysis of the BMAP/G/1 queue with gated service and adaptive vacations duration

Interference Functionals in Poisson Networks

Wideband CDMA system for personal radio communications

Spreading Set With Error Correction for Multiple-Access Adder Channel

Approximately optimal scheduling of an M/G/1 queue with heavy tails

On the Maximum Stable Throughput of Tree Algorithms With Free Access

On queues with service and interarrival times depending on waiting times

Hit statistics in FH-CDMA unslotted packet networks

Convexity in queues with general inputs

Similar Documents

On the usefulness of outer-loop power control with successive interference cancellation

Analysis of the BMAP/G/1 queue with gated service and adaptive vacations duration

Interference Functionals in Poisson Networks

Wideband CDMA system for personal radio communications

Spreading Set With Error Correction for Multiple-Access Adder Channel

Approximately optimal scheduling of an M/G/1 queue with heavy tails

On the Maximum Stable Throughput of Tree Algorithms With Free Access

On queues with service and interarrival times depending on waiting times

Hit statistics in FH-CDMA unslotted packet networks

Convexity in queues with general inputs