884 Hits in 5.3 sec

statistical multiplexing [chapter]

Martin H. Weik
2000 Computer Science and Communications Dictionary  
The computational complexity associated in analyzing the multiplexing problem for such models has led to some innovative approximation techniques.  ...  Burst-level queues estimated from infinite buffer queue analysis can be used to approximate the losses that take place in a finite buffer system.  ... 
doi:10.1007/1-4020-0613-6_18211 fatcat:mjo6ctlkqjhcjgjsqfbhbjsxkm

Statistical multiplexing

1982 Microprocessors and microsystems  
The computational complexity associated in analyzing the multiplexing problem for such models has led to some innovative approximation techniques.  ...  Burst-level queues estimated from infinite buffer queue analysis can be used to approximate the losses that take place in a finite buffer system.  ... 
doi:10.1016/0141-9331(82)90703-7 fatcat:m2wv235qmrcolofj5rfaqlyfc4

Traffic smoothing effects of bit dropping in a packet voice multiplexer

K. Sriram, D.M. Lucantoni
1989 IEEE Transactions on Communications  
In a packet voice multiplexer without bit dropping, these correlations tend to cause significantly larger queueing delays and packet losses than would be predicted for a Poisson input stream.  ...  This phenomenon renders it possible to approximate the superposition process by a Poisson process for analyzing a packet voice multiplexer with,.. bit dropping.  ...  The third value in this set is not a threshold for dropping bits, rather it is the finite buffer capacity for storing voice packets in the queue.  ... 
doi:10.1109/26.31162 fatcat:6hsuo45tgfgsdjnjefgnxjz2i4

Admission control for statistical QoS: theory and practice

E.W. Knightly, N.B. Shroff
1999 IEEE Network  
Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain.  ...  Our goals in this paper are threefold. First, we describe and classify a broad set of proposed admission control algorithms.  ...  Kim for running the simulations reported in this paper, and for preparing the figures for the paper.  ... 
doi:10.1109/65.768485 fatcat:2j4fetdfmfglvg3atzfnoaf7qu

Improved loss calculations at an ATM multiplexer

N.B. Shroff, M. Schwartz
1998 IEEE/ACM Transactions on Networking  
Our hybrid analytical technique combines results from large buffer theories and quasi-stationary approaches to analyze the loss probability of a finite-buffer queue being fed by Markov-modulated sources  ...  In this paper we develop a simple and accurate analytical technique to determine the loss probability at an access node to an asynchronous transfer mode (ATM) network.  ...  the loss probability in a finite-buffer system.  ... 
doi:10.1109/90.720874 fatcat:q2wknfkkavdo7cvpbp47wkqvhe

Efficient resource allocation for China's 3G/4G wireless networks

Yu Cheng, Hai Jiang, Weihua Zhuang, Zhisheng Niu, Chuang Lin
2005 IEEE Communications Magazine  
More specifically, we propose a novel buffer sharing scheme to provide assured service for real-time layercoded multimedia traffic, which can guarantee the specific packet loss requirement of each layer  ...  The all-IP DiffServ model is expected to be the most promising architecture for QoS provisioning in China's next-generation wireless networks, due to its scalability, convenience for mobility support,  ...  configurations and simulated packet loss probabilities: large buffer approximation vs. finite buffer analysis.  ... 
doi:10.1109/mcom.2005.1381878 fatcat:sstt3sldxnhvxbtoqhz7be7xxm

Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning

Yu Cheng, Weihua Zhuang
2003 IEEE Transactions on Communications  
The quality of service (QoS) is described by the packet loss probability for each class. The buffer is partitioned with 1 thresholds to provide the loss priorities.  ...  We investigate the statistical multiplexing and admission control for a partitioned buffer, where the traffic is generated by multiclass Markov-modulated fluid sources.  ...  In configuration 2, type-3 and type-4 sources are multiplexed in a larger buffer of size 250 packets for better statistical multiplexing. A type-4 flow is burstier than a type-3 flow.  ... 
doi:10.1109/tcomm.2003.816972 fatcat:tjbcqw665rcibbfjsppdr4bfqm

Towards an FBM Model Based Network Calculus Framework with Service Differentiation

Yu Cheng, Weihua Zhuang, Xinhua Ling
2007 Journal on spesial topics in mobile networks and applications  
Moreover, we present both theoretical and simulation studies to demonstrate that the output from the multiplexing, splitting, and buffering calculuses can still be modeled or well approximated by a properly  ...  Specifically, we develop a generic FBM based analysis for multiclass single-hop analysis where both inter-buffer priority and intra-buffer priority are used for service differentiation.  ...  Acknowledgements The first author would like to thank his students Xiaohua Tian and Hongkun Li for their help in generating the NS2 simulation results.  ... 
doi:10.1007/s11036-008-0040-x fatcat:m7wcs4rvuzdc7kr5yjzvsa5hai

FBM model based network-wide performance analysis with service differentiation

Yu Cheng, Weihua Zhuang, Xinhua Ling
2007 The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops - QSHINE '07  
While accurate FBM based queueing analysis for an infinite/finite first-in-first-out (FIFO) buffer is available in the existing literature, we develop a generic FBM based analysis for multiclass single-hop  ...  analysis where both inter-buffer priority and intra-buffer priority are used for service differentiation.  ...  With the results in (4) -(6), the packet loss probability for a finite buffer with an FBM input can be explicitly calculated.  ... 
doi:10.1145/1577222.1577237 dblp:conf/qshine/ChengZL07 fatcat:lilwrq3mpvgebdcky76hfyhiy4

Markov modulated periodic arrival process offered to an ATM multiplexer

Nail Akar, Erdal Arikan
1995 Performance evaluation (Print)  
A numerical example for a packetized voice multiplexer is finally given to demonstrate our results.  ...  The technique proposed here has close similarities with the fluid flow approximation and is amenable to extension for more complicated queueing systems with such correlated arrival processes.  ...  The model and technique proposed in [7] is generalized for the finite buffer case in [8] to solve for the cell loss rate, a critical value in ATM networks.  ... 
doi:10.1016/0166-5316(93)e0058-d fatcat:or4qfndkzbcalncpdaeo5ykbse

A universal building block for the approximate analysis of a shared buffer ATM switch architecture

Demetres D. Kouvatsos, Spiros G. Denazis
1994 Annals of Operations Research  
A universal analytic approximation is proposed for the performance analysis of a general queueing model of a shared buffer ATM switch architecture with bursty arrivals.  ...  Moreover, performance bounds for the mean queue length and cell-loss probability at each output port are experimentally defined over those generated by Interrupted Poisson Processes (IPPs) having the same  ...  An incoming cell is stored in a shared buffer of finite capacity while its address is kept in the address buffer.  ... 
doi:10.1007/bf02031600 fatcat:wmcvc624d5aqjobnusscdmc5y4

Performance analysis of an ATM multiplexer loaded with VBR traffic generated by multimode speech coders

F. Beritelli, A. Lombardo, S. Palazzo, G. Schembra
1999 IEEE Journal on Selected Areas in Communications  
Finally, the proposed paradigm has been assessed in a case study where we demonstrate that, for a given output ATM link capacity and for a number of telecommunication services involving voice transmission  ...  The model is then used to analytically derive the loss probability and the jitter probability density function of an ATM multiplexer loaded by a number of VR-CELP sources.  ...  Acknowledgments The authors wish to thank the anonymous reviewers for the helpful comments and suggestions that greatly improved the presentation of the paper.  ... 
doi:10.1109/49.743697 fatcat:cejovfttbnd6pj47djv4jdpz4a

A Simulation-Based Comparison of Multimedia Traffic Prioritization Schemes for High-Performance Input-Queued Packet Switches

Salman A. AlQahtani
2006 Journal of Computer Science  
buffer for each of the service classes.  ...  in terms of delay and loss requirements.  ...  ACKNOWLEDGMENT The author acknowledges King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia for support.  ... 
doi:10.3844/jcssp.2006.347.354 fatcat:7j2j7fbcabcv3gtdp2dvgmcc24

Statistical multiplexing and QoS provisioning for real-time traffic on wireless downlinks

H.M. Chaskar, U. Madhow
2001 IEEE Journal on Selected Areas in Communications  
For example, for 13 kb/s voice sources over a 1-Mb/s link, we obtain a two-fold capacity gain over static (peak-rate) bandwidth allocation. .  ...  In addition to considering static (peak-rate) bandwidth sharing as in conventional wireless downlinks, we propose mechanisms for statistical multiplexing of traffic, which lead to substantial capacity  ...  In Jakes' simulator, is approximated by the superposition of a finite number of spatially distributed multipath components.  ... 
doi:10.1109/49.914512 fatcat:kg7qbuwk6neq5gfainsgtjikhe

Transient solutions for the buffer behavior in statistical multiplexing

Qiang Ren, Hisashi Kobayashi
1995 Performance evaluation (Print)  
The transient solutions will be of critical value in understanding dynamic behavior of the multiplexer, and loss probabilities at the cell (or packet) level.  ...  In this paper we present time-dependent (or transient) solutions for a mathematical model of statistical multiplexing.  ...  John Paz for carrying out the numerical computations of our examples that are presented in Figs. 5 and '6.  ... 
doi:10.1016/0166-5316(93)e0064-c fatcat:qbaenwawyvdhppm7ule7acmyiu
« Previous Showing results 1 — 15 out of 884 results