Sciweavers

22 search results - page 4 / 5
» A new approach for shortest path routing problem by random k...
Sort
View
BROADNETS
2005
IEEE
13 years 11 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
WSNA
2003
ACM
13 years 11 months ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
BROADNETS
2007
IEEE
14 years 10 days 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
EUROMICRO
2007
IEEE
14 years 10 days ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 4 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase