Sciweavers

93 search results - page 17 / 19
» Credit based fair scheduling for packet switched networks
Sort
View
MOBIHOC
2005
ACM
15 years 9 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
ICNP
1998
IEEE
15 years 1 months ago
A Class of End-to-End Congestion Control Algorithms for the Internet
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
S. Jamaloddin Golestani, S. Bhattacharyya
INFOCOM
2003
IEEE
15 years 2 months ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
76
Voted
SIGCOMM
2003
ACM
15 years 2 months ago
Scaling internet routers using optics
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to ma...
Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, Da...
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 2 months ago
Congestion-Aware Multicast Routing for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...