Sciweavers

580 search results - page 43 / 116
» Choosing a random peer
Sort
View
INFOCOM
2000
IEEE
15 years 4 months ago
End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks
We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-re...
Srisankar S. Kunniyur, Rayadurgam Srikant
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 6 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
OPODIS
2007
15 years 1 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
IPPS
2006
IEEE
15 years 5 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
ICC
2007
IEEE
15 years 6 months ago
Supporting VCR Functions in P2P VoD Services Using Ring-Assisted Overlays
—Peer-to-Peer (P2P) networks have been shown to be a promising approach to providing large-scale Video-on-Demand (VoD) services over the Internet for their potential scalability....
Bin Cheng, Hai Jin, Xiaofei Liao