Sciweavers

PE
2006
Springer
95views Optimization» more  PE 2006»
13 years 8 months ago
Deterministic end-to-end delay guarantees with rate controlled EDF scheduling
Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (ED...
Vijay Sivaraman, Fabio M. Chiussi, Mario Gerla
PE
2006
Springer
103views Optimization» more  PE 2006»
13 years 8 months ago
The LCD interconnection of LRU caches and its analysis
In a multi-level cache such as those used for web caching, a hit at level l leads to the caching of the requested object in all intermediate caches on the reverse path (levels l -...
Nikolaos Laoutaris, Hao Che, Ioannis Stavrakakis
PE
2006
Springer
130views Optimization» more  PE 2006»
13 years 8 months ago
Analysis of manufacturing blocking systems with Network Calculus
In this paper, the manufacturing blocking system (MBS) is studied from the Network Calculus (NetCal) perspective. By dominating an MBS by a window flow controller (WFC), we obtain...
Amit Bose, Xiaoyue Jiang, Bin Liu, Gang Li
PE
2006
Springer
109views Optimization» more  PE 2006»
13 years 8 months ago
A discrete-time queueing model with periodically scheduled arrival and departure slots
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted an...
Johan van Leeuwaarden, Dee Denteneer, Jacques Resi...
PE
2006
Springer
111views Optimization» more  PE 2006»
13 years 8 months ago
How many servers are best in a dual-priority M/PH/k system?
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
Adam Wierman, Takayuki Osogami, Mor Harchol-Balter...
PE
2006
Springer
125views Optimization» more  PE 2006»
13 years 8 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot
PE
2006
Springer
85views Optimization» more  PE 2006»
13 years 8 months ago
Loss probability in a finite queue with service interruptions and queue length distribution in the corresponding infinite queue
In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptio...
Fumio Ishizaki
PE
2006
Springer
114views Optimization» more  PE 2006»
13 years 8 months ago
On the performance of Internet worm scanning strategies
In recent years, fast spreading worms, such as Code Red, Slammer, Blaster and Sasser, have become one of the major threats to the security of the Internet. In order to defend agai...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong
PE
2006
Springer
80views Optimization» more  PE 2006»
13 years 8 months ago
Sojourn time approximations in queueing networks with feedback
Bart M. M. Gijsen, Robert D. van der Mei, P. Engel...
PE
2006
Springer
124views Optimization» more  PE 2006»
13 years 8 months ago
On priority queues with priority jumps
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing syste...
Tom Maertens, Joris Walraevens, Herwig Bruneel