Sciweavers

473 search results - page 88 / 95
» Computing shortest paths with uncertainty
Sort
View
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
14 years 12 days ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang
BROADNETS
2007
IEEE
15 years 4 months ago
Resource dimensioning in WDM networks under state-based routing schemes
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
NETGAMES
2006
ACM
15 years 3 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
NETWORKING
2004
14 years 11 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
83
Voted
GI
2009
Springer
14 years 7 months ago
Spontaneous and Privacy-friendly Mobile Indoor Routing and Navigation
Abstract: Mobile indoor navigation systems guide users through buildings and premises by taking into account the current position of the user and a destination such as a room, offi...
Peter Ruppel, Florian Gschwandtner