NDLI: Traffic multiplexing networks: queueing analysis

Please wait, while we are loading the content...

1999 Information Theory and Networking Workshop (Cat. No.99EX371)

1999 Information Theory and Networking Workshop (Cat. No.99EX371)

Conflict between state information and intended information

Weak variable-length source coding theorems

Capacity of CDMA fading channels

Linear codes for network information flow

Advances in algebraic geometry codes

Multidimensional turbo codes

Factor graphs and iterative algorithms

On the packet error rate of convolutional codes

Constrained codes and systems

High-resolution rate-distortion theory

Asymptotically optimal threshold based low complexity sequential lossless coding for piecewise stationary memoryless sources

Variable-to-fixed length source codes: a geometrical approach to low complexity codes

Assessing MDL in wavelet denoising and compression

The jamming game for timing channels

An information theoretic approach to secure multicast key management

Noncooperative network games for multi-class QoS provision

Pricing and provisioning of quality-differentiated services

Security against memory-bounded adversaries

Cryptography in the quantum world

Elliptic curve cryptography

The entropies of queue arrivals and queue departures

On random message arrivals in multiaccess communications

Extremal behaviour and bounds for a network buffer fed by deterministically shaped random processes

A two-bit scheme for routing lookup

On the design of space-time codes

On the modified Niederreiter cryptosystem

Performance of the turbo hybrid automatic repeat request system type II

Constructing low-density parity-check codes with circulant matrices

Representing group codes as permutation codes

Strong converse theorems in the quantum information theory

Variable-to-fixed length codes and plurally parsable dictionaries

Traffic multiplexing networks: queueing analysis

Overflow and underflow probabilities of fixed-to-variable codeword lengths for the general source

Interleaver design for turbo codes based on divisibility

Basic properties of fix-free codes

Noise prediction for channels with side information at the transmitter: error exponents

A combinatorial approach to information inequalities

On BEP of a generalised concatenated coding

An information-spectrum approach to degraded broadcast channels

Asymptotic properties on codeword length distribution of FV codes for general sources

Near-optimal voice-data integration over third generation wireless TDMA channels

Algorithms for finding good column permutations of codes

Stack algorithms for random multiple access in the presence of asymmetric channel feedback erasures

Zigzag codes and concatenated zigzag codes

The behavior of stochastic processes arising in window protocols

Efficient hierarchical broadcasting using multilevel codes

A separation principle for communication networks

The kth order nonhomomorphicity of S-boxes

Traffic multiplexing networks: queueing analysis

Content Provider	IEEE Xplore Digital Library
Author	Shalmon, M.
Copyright Year	1999
Description	Author affiliation: INRS Telecommun., Ile des Soeurs, Que., Canada (Shalmon, M.)
Abstract	Summary form only given. The multiplexer of independent inputs, each being regenerative ON-OFF, i.e. memoryless OFF and generally distributed ON has been recently resurrected in the limit M/G//spl infin/ and subexponentially tailed ON for the purpose of understanding the long range dependence and the self-similarity of the aggregation of heterogeneous high speed traffic. We remark that for the purpose of computing the tail distribution, the M/G//spl infin/ subexponentially tailed ON reduces to one subexponentially tailed ON multiplexed with compound Poisson input and that furthermore, it is possible to obtain a complete analysis for a multiplexing network. A unidirectional bus is a special case (tandem concentrating network). A single multiplexer is a further specialized case (concentrating station). We assume that the service rate is nondecreasing in the direction of the traffic flow (in particular all the stations may have the same service rate). We point out that for input/output purposes the network is equivalent to a single multiplexer and that under these assumptions the network becomes a distributed multiplexer for which the multidimensional queueing process sampled at particular epochs along a tandem path decomposes in stationarity into independent one dimensional processes. We discuss the network queueing analysis for several service disciplines (FCFS, priority), searching for the distribution of the buffer content at each station and for the joint queueing distribution encountered by each source at all the stations along its tandem path.
File Size	93903
File Format	PDF
ISBN	0780359542
DOI	10.1109/ITNW.1999.814363
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-06-27
Publisher Place	Greece
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Packet switching Stochastic processes Telecommunication traffic Tail Traffic control Computer networks Data communication Queueing analysis Asynchronous transfer mode
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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