Sciweavers

10 search results - page 2 / 2
» Longest path analysis in networks of queues: Dynamic schedul...
Sort
View
FOCS
1997
IEEE
13 years 9 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
INFOCOM
2010
IEEE
13 years 3 months ago
Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
INFOCOM
2007
IEEE
13 years 11 months ago
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N ...
Yi-Ting Chen, Cheng-Shang Chang, Jay Cheng, Duan-S...
WSC
2004
13 years 6 months ago
Decision Tree Module Within Decision Support Simulation System
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
Mohamed Moussa, Janaka Y. Ruwanpura, George Jergea...
IWQOS
2001
Springer
13 years 9 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell