ISPA 2005: Parallel and Distributed Processing and Applications pp 1065-1076 | Cite as
FairOM: Enforcing Proportional Contributions Among Peers in Internet-Scale Distributed Systems
Abstract
The viability of overlay multicasting has been established by previous research. However, in order to apply overlay multicast to Internet-scale distributed systems, such as the Grid and Peer-to-Peer systems, the issue of effectively enforcing fairness among peers so as to optimize overall performance remains as a challenge. This paper argues that simply applying a multiple-tree scheme does not provide sufficient fairness, in terms of performance. Instead, we believe that a better way to define fairness, for performance’s sake, is to factor in peers’ proportional contributions as it provides the opportunity to support many simultaneous multicasting sessions. This paper then presents a protocol, called FairOM (Fair Overlay Multicast), to enforce proportional contributions among peers in Internet-scale distributed systems. By exploiting the notion of staged spare capacity group and deploying a two-phase multicast forest construction process, FairOM enforces proportional contributions among peers, which enables more simultaneous multicasting sessions and alleviates potential hot-spots. The simulation results of a large multicast group with 1000 members show that FairOM achieves the goal of enforcing proportional contributions among peers and does not overwhelm the peers, including the multicast source. FairOM also achieves low delay penalty for peers and high path diversity.
Keywords
Multicast Tree Multicast Group Contribution Ratio Path Diversity Neighbor ListPreview
Unable to display preview. Download preview PDF.
References
- 1.Planet-Lab, http://www.planet-lab.org
- 2.Bharambe, R., Rao, S.G., Padmanabhan, V.N., Seshan, S., Zhang, H.: The impact of heterogeneous bandwidth constraints on DHT-based multicast protocols. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 115–126. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 3.Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in cooperative environment. In: Proc. of the SOSP, Bolton Landing, New York, USA (October 2003)Google Scholar
- 4.Chu, Y.-H., Rao, S.G., Seshan, S., Zhang, H.: A case for end system multicast. IEEE Journal on Selected Areas in Communication (JSAC), Special Issue on Networking Support for Multicast 20(8) (2002)Google Scholar
- 5.Jannotti, J., Gifford, D., Johnson, K., Kaashoek, M.: Overcast: Reliable multicasting with an overlay network. In: Proc. OSDI, San Diego, CA (2000)Google Scholar
- 6.Kostic, D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: Hight band-width data dissemination using an overlay mesh. In: Proc. of the ACM Symposium on Operating System Principles (SOSP) (October 2003)Google Scholar
- 7.Padmanabhan, V.N., Wang, H.J., Chou, P.A.: Supporting heterogeneity and congestion control in peer-to-peer multicast streaming. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 54–63. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 8.Ngan, T.-W.J., Wallach, D.S., Druschel, P.: Enforcing fair sharing of peer-to-peer resources. In: Proc. of IPTPS (2003)Google Scholar
- 9.Padmanabhan, V.N., Wang, H.J., Chou, P.A., Sripanidkulchai, K.: Distributing streaming media content using cooperative networking. In: NOSSDAV 2002, Miami, Florida, USA (May 2002)Google Scholar
- 10.Zegura, E., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: INFOCOMM, San Francisco, California (1996)Google Scholar
- 11.Zhuang, S., Zhao, B., Joseph, A., Katz, R., Kubiatowicz, J.: Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: NOSSDAV 2001 (June 2001)Google Scholar