Sciweavers

995 search results - page 3 / 199
» Minimizing Congestion in General Networks
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
14 years 1 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
ISPD
2000
ACM
131views Hardware» more  ISPD 2000»
14 years 1 days ago
Multi-center congestion estimation and minimization during placement
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
Maogang Wang, Xiaojian Yang, Kenneth Eguro, Majid ...
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
14 years 1 months ago
A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
Xiaoqing Zhu, Bernd Girod