Sciweavers

3061 search results - page 417 / 613
» Network Load Games
Sort
View
TON
2008
99views more  TON 2008»
15 years 6 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
NETWORK
2007
145views more  NETWORK 2007»
15 years 6 months ago
Analysis of Shared Memory Priority Queues with Two Discard Levels
— Two rate SLAs become increasingly popular in today’s Internet, allowing a customer to save money by paying one price for committed traffic and a much lower price for additio...
Shlomi Bergida, Yuval Shavitt
CONEXT
2010
ACM
15 years 4 months ago
Balancing throughput, robustness, and in-order delivery in P2P VoD
Peer-to-peer has emerged in recent years as a promising approach to providing Video-on-Demand streaming. The design space, however, is vast and still not well understood--yet choo...
Bin Fan, David G. Andersen, Michael Kaminsky, Kons...
ICUMT
2009
15 years 4 months ago
Hierarchical p2p overlays for DVE: An Additively Weighted Voronoi based approach
This paper presents a support for the development of Distributed Virtual Environments (DVEs) on P2P architectures. A hierarchical overlay is defined by pairing each peer with a wei...
Michele Albano, Laura Ricci, Luca Genovali
ICNP
2005
IEEE
16 years 3 days ago
Incentives to Promote Availability in Peer-to-Peer Anonymity Systems
Peer-to-peer (P2P) anonymous communication systems are vulnerable to free-riders, peers that use the system while providing little or no service to others and whose presence limit...
Daniel R. Figueiredo, Jonathan K. Shapiro, Donald ...