Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,504
Queuing processes in GPS and PGPS with LRD traffic inputs
- IEEE/ACM Trans. Networking
, 2005
"... Abstract — Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session’s queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline are then contributed. It is shown th ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Abstract — Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session’s queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline are then contributed. It is shown
The iSLIP Scheduling Algorithm for Input-Queued Switches
, 1999
"... An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, these systems use input queues to hold packets waiting to traverse the switching fabric. It is well known th ..."
Abstract
-
Cited by 425 (8 self)
- Add to MetaCart
of iSLIP under benign and bursty traffic conditions. Prototype and commercial implementations of iSLIP exist in systems with aggregate bandwidths ranging from 50 to 500 Gb/s. When the traffic is nonuniform, iSLIP quickly adapts to a fair scheduling policy that is guaranteed never to starve an input
Data Streams: Algorithms and Applications
, 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract
-
Cited by 533 (22 self)
- Add to MetaCart
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has
Generalized processor sharing with long-range dependent traffic input
- In Proc. IEEE MASCOTS
, 2001
"... In this paper, we develop an upper bound on the individual session queue length of long range dependent (LRD) traffic under the generalized processor sharing (GPS) scheduling discipline. This work is based on the analysis of the arrival process of LRD traffic, which is demonstrated to be Weibull Bou ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
of an individual session queue, such as the index, the asymptotic constant and the decay rate can be affected by other flows existing in the GPS system. Under certain conditions, by carefully choosing the weight parameters, an individual session with LRD traffic input can be well isolated from other flows in a GPS
Performance Evaluation of Optical Burst Switching with Assembled Burst Traffic Input
, 2002
"... This paper studies loss performance of optical burst switching (OBS) with assembled burst trafc input by exploring the characteristics of assembled burst traffic. We analyze the smoothing effect of assembly algorithms, which changes the statistical properties of packet flows, and find that assembly ..."
Abstract
-
Cited by 17 (1 self)
- Add to MetaCart
This paper studies loss performance of optical burst switching (OBS) with assembled burst trafc input by exploring the characteristics of assembled burst traffic. We analyze the smoothing effect of assembly algorithms, which changes the statistical properties of packet flows, and find that assembly
Capacity Provisioning in DiffServ/MPLS Networks based on Correlated Traffic Inputs
- Proceedings of 23rd IEEE International Performance, Computing and Communications Conference (IPCCC
, 2004
"... In this paper, we propose a dimensioning model that takes account of the new technologies that can provide QoS (i.e., DiffServ/MPLS) and allows for multiple de-lay constraints so that guaranteed performance can be achieved for each of the traffic classes. The proposed model incorporates procedures t ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper, we propose a dimensioning model that takes account of the new technologies that can provide QoS (i.e., DiffServ/MPLS) and allows for multiple de-lay constraints so that guaranteed performance can be achieved for each of the traffic classes. The proposed model incorporates procedures
1 Queuing Processes in GPS and PGPS with LRD Traffic Inputs
"... Abstract—Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session’s queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline are then contributed. It is shown that ..."
Abstract
- Add to MetaCart
Abstract—Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session’s queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline are then contributed. It is shown
Individual Queuing Process in GPS and PGPS with LRD Traffic Inputs
"... Abstract — Two upper bounds on the individual (session) queue length of long range dependent (LRD) traffic under the generalized processor sharing (GPS) scheduling discipline are contributed. These bounds provide insight to the LRD isolation properties of the GPS server. More specifically, it is sho ..."
Abstract
- Add to MetaCart
Abstract — Two upper bounds on the individual (session) queue length of long range dependent (LRD) traffic under the generalized processor sharing (GPS) scheduling discipline are contributed. These bounds provide insight to the LRD isolation properties of the GPS server. More specifically
Discrete-time Analysis of a Finite Buffer with VBR MPEG Video Traffic Input
, 1996
"... Currently, a lot of interest is paid to multimedia traffic in general and to video traffic in particular. Most of the studies deal with appropriate models for this complex type of traffic and use trace-driven simulations to assess the performance of high-speed networks carrying this type of traffic. ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
. In contrast, we develop two models of different correlation complexity and apply them in a discrete-time analysis of a buffer with variable bit rate (VBR) MPEG video traffic input. The algorithms are easy to implement and provide good cell loss estimates over a wide range of buffer sizes.
Results 1 - 10
of
2,504
