Results 211 to 220 of about 2,468 (253)
Bandwidth optimization for Internet traffic in generalized processor sharing servers
IEEE Transactions on Parallel and Distributed Systems, 2005 Bandwidth optimization is considered when several classes of Internet traffic are served in generalized processor sharing (GPS) servers. Internet traffic shows self-similar patterns that make it difficult to obtain analytical performance in GPS. Thus, for performance estimation of different classes of traffic, we use fluid simulation techniques that ...
Ju Yong Lee +3 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
Computers and Operations Research, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Souvik Ghosh, A D Banik
exaly +3 more sources
AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
Stochastic Models, 2005 In this paper, we study a BAMP/M/1 generalized processor-sharing queue. We propose an RG-factorization approach, which can be applied to a wider class of Markovian block-structured processor-sharing queues.
Quan-Lin Li +2 more
exaly +2 more sources
Beyond processor sharing [PDF]
Performance Evaluation Review, 2007 While the (Egalitarian) Processor-Sharing (PS) discipline offers crucial insights in the performance of fair resource allocation mechanisms, it is inherently limited in analyzing and designing differentiated scheduling algorithms such as Weighted Fair ...
Samuli Aalto, Urtzi Ayesta, Sem Borst
exaly +2 more sources
Sample-path large deviations for generalized processor sharing queues with Gaussian inputs
Performance Evaluation, 2005 In this paper we consider the generalized processor sharing (GPS) mechanism serving two traffic classes. These classes consist of a large number of independent identically distributed Gaussian flows with stationary increments.
Michel Mandjes
exaly +2 more sources
Fluid simulation for self-similar traffic in generalized processor sharing servers
IEEE Communications Letters, 2003 We propose a fluid simulation algorithm for generalized processor sharing (GPS) servers. We analyze the complexity of the proposed algorithm and show the advantage of fluid simulation, compared to packet-level simulation.
Ju Yong Lee, Sunggon Kim, Dan Keun Sung
exaly +2 more sources
Generalized processor sharing with heterogeneous traffic classes
ACM SIGMETRICS Performance Evaluation Review, 2001We consider a system with two heterogeneous traffic classes, one having light-tailed characteristics, the other one exhibiting heavy-tailed properties. The two traffic classes are served in accordance with the Generalized Processor Sharing (GPS) discipline.
Borst, S.C. +2 more
openaire +1 more source
On generalized processor sharing with regulated multimedia traffic
IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005Multimedia traffic is becoming an increasing portion of today's Internet traffic due to the flourish of multimedia applications such as music/video streaming, video teleconferencing, IP telephony, and distance learning. In this paper, we study the problem of supporting multimedia traffic using a generalized processor sharing (GPS) server.
Chaiwat Oottamakorn +2 more
openaire +1 more source
Generalized processor sharing queues with heterogeneous traffic classes
Advances in Applied Probability, 2003We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks.
Borst, Sem +2 more
openaire +3 more sources
An approach for traffic characterization in generalized processor sharing networks
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2002This work is motivated by the increasing need of end-to-end performance bound provisioning in multi-service networks. Providing performance bounds in a networking environment is a difficult problem as traffic is bursty and its dynamics is far more complex than in a single server environment.
Peter Barta +3 more
openaire +1 more source