Sciweavers

540 search results - page 100 / 108
» Competitive Routing over Time
Sort
View
BROADNETS
2006
IEEE
14 years 1 months ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...
FOCS
1995
IEEE
14 years 1 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
WIOPT
2010
IEEE
13 years 8 months ago
Flunet: Automated tracking of contacts during flu season
— By analyzing people’s contact patterns over time, it is possible to build efficient delay tolerant networking (DTN) algorithms and derive important data for parameterizing an...
Mohammad S. Hashemian, Kevin G. Stanley, Nathaniel...
JNCA
2011
137views more  JNCA 2011»
13 years 5 months ago
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
Shanshan Jiang, Yuan Xue
CCS
2009
ACM
14 years 4 months ago
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
Prateek Mittal, Nikita Borisov