Sciweavers

52 search results - page 2 / 11
» Network design arc set with variable upper bounds
Sort
View
WCE
2007
13 years 6 months ago
Stochastic Urban Rapid Transit Network Design
— The rapid transit network design problem considers at upper level the list of potential transit corridors and stations to design the network as a discrete space of alternatives...
Carlos Bouza, Gemayzel Bouza, Ángel Mar&iac...
CN
2011
88views more  CN 2011»
13 years 8 days ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...
INFOCOM
2010
IEEE
13 years 3 months ago
Worst-Case TCAM Rule Expansion
—Designers of TCAMs (ternary CAMs) for packet classification often have to deal with unpredictable sets of rules. These result in highly variable rule expansions, and can only r...
Ori Rottenstreich, Isaac Keslassy
MST
2011
184views Hardware» more  MST 2011»
13 years 6 days ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
INFOCOM
2010
IEEE
13 years 3 months ago
Bargaining and Price-of-Anarchy in Repeated Inter-Session Network Coding Games
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...