Journal of the ACM (JACM)
Fundamentals of Data Structures in C++
Fundamentals of Data Structures in C++
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Optimal Resource Allocation in Overlay Multicast
IEEE Transactions on Parallel and Distributed Systems
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Nettimer: a tool for measuring bottleneck link, bandwidth
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Dynamic Multicast in Overlay Networks with Linear Capacity Constraints
IEEE Transactions on Parallel and Distributed Systems
OMNI: An efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Market-based self-optimization for autonomic service overlay networks
IEEE Journal on Selected Areas in Communications
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
A significant issue in overlay multicasting is designing self-organizing mechanisms that can be able to utilize the natural selfishness of users in such a way that leads to maximization of the total utility of the system. We present a competitive economical system including dynamic algorithms for joining and leaving in which a number of services are provided to the users by a number of origin servers. Each offered service can be considered as a commodity and the servers and the users who relay the services to their downstream nodes can thus be considered as producers of the economy. Also, the users can be viewed as consumers in the economy. On joining to the network, each user is provided with a budget and tries to get hold of the services. We use Walrasian equilibrium to show existence of market-clearing prices. The system is proved to be scalable and experimental results confirm that our proposed mechanism works near-optimal.