Sciweavers

995 search results - page 77 / 199
» Minimizing Congestion in General Networks
Sort
View
INFOCOM
2000
IEEE
13 years 11 months ago
Traffic Engineering Using Multiple Multipoint-to-Point LSPs
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
Hiroyuki Saito, Yasuhiro Miyao, Makiko Yoshida
DAC
2002
ACM
14 years 9 months ago
Towards global routing with RLC crosstalk constraints
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
James D. Z. Ma, Lei He
NETWORK
2010
122views more  NETWORK 2010»
13 years 2 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
DAC
2007
ACM
14 years 9 months ago
IPR: An Integrated Placement and Routing Algorithm
Abstract-- In nanometer-scale VLSI technologies, several interconnect issues like routing congestion and interconnect delay have become the main concerns in placement. However, all...
Min Pan, Chris C. N. Chu
INFOCOM
2007
IEEE
14 years 2 months ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang