Sciweavers

2076 search results - page 182 / 416
» Universal Routing in Distributed Networks
Sort
View
130
Voted
CCS
2009
ACM
15 years 10 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
125
Voted
COCOON
2008
Springer
15 years 5 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
176
Voted
HICSS
2003
IEEE
183views Biometrics» more  HICSS 2003»
15 years 9 months ago
CRMA: A Cycle-breaking Multicast Routing Algorithm for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
153
Voted
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 9 months ago
Congestion-Aware Multicast Routing for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
152
Voted
CN
2007
154views more  CN 2007»
15 years 3 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...