995 search results - page 26 / 199 » Minimizing Congestion in General Networks |
ISPD
1997
ACM
14 years 11 days ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
TIT
2011
13 years 3 months ago
2011
— In this paper, we extend the notion of generalized Hamming weight for classical linear block code to linear network codes by introducing the network generalized Hamming weight ...
WMI
2001
13 years 9 months ago
2001
The General Packet Radio Service extends the existing GSM mobile communications technology by providing packet switching and higher data rates in order to efficiently access IPbas...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...