Sciweavers

231 search results - page 20 / 47
» End-to-end Fairness Analysis of Fair Queuing Networks
Sort
View

Publication
767views
15 years 7 months ago
Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...
D. Chiu and R. Jain
SIGCOMM
1994
ACM
14 years 21 days ago
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
Scott Shenker
TON
2010
189views more  TON 2010»
13 years 3 months ago
Analysis, Simulation, and Implementation of VCP: A Wireless Profiling
Abstract--Every congestion control protocol operating in wireless networks is potentially faced with two major challenges of performance degradation. These sources are (a) the coup...
Xiaolong Li, Homayoun Yousefi'zadeh
WINET
2010
144views more  WINET 2010»
13 years 7 months ago
Cross-layer quality-driven adaptation for scheduling heterogeneous multimedia over 3G satellite networks
Wireless networks are experiencing a paradigm shift from focusing on the traditional data transfer to accommodating the rapidly increasing multimedia traffic. Hence, their schedul...
Hongfei Du, Xiaozheng Huang, Jie Liang, Jiangchuan...
INFOCOM
2002
IEEE
14 years 1 months ago
Scheduling Processing Resources in Programmable Routers
—To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typi...
Prashanth Pappu, Tilman Wolf