Sciweavers

4616 search results - page 830 / 924
» The Communication Complexity of Correlation
Sort
View
SIGCOMM
2004
ACM
16 years 11 days ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
SIGCOMM
2004
ACM
16 years 11 days ago
Network sensitivity to hot-potato disruptions
Hot-potato routing is a mechanism employed when there are multiple (equally good) interdomain routes available for a given destination. In this scenario, the Border Gateway Protoc...
Renata Teixeira, Aman Shaikh, Timothy Griffin, Geo...
GI
2004
Springer
16 years 10 days ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
16 years 9 days ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
INFOCOM
2003
IEEE
16 years 7 days ago
IP-Subnet Aware Routing in WDM Mesh Networks
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anur...