Efficient Stream Delivery over Unstructured Overlay Network by Reverse-Query Propagation

  • Yoshikatsu Fujita
  • Yasufumi Saruwatari
  • Jun Yoshida
  • Kazuhiko Tsuda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4252)


We propose reverse-query mechanism to deliver broadband contents over unstructured overlay network. Due to the nature of scale-free network, newly defined reverse-query message will cover more than 80% of all the clients, with relaying reverse-query message under probability as low as 10%, being effective to reduce the total traffic generated by query propagation. This platform is built on percolation theory to propagate the message and contents, which each agent on P2P client relays reverse-query to randomly selected peers. This can be applied for quasi-broadcast platform on P2P network, and for business application, to flyer delivery over the Internet targeting common attributes such as residential area.


Overlay Network Preferential Attachment Percolation Theory Content Delivery Query Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Karger, D., Lehman, E., Leighton, T., Pnigrahy, R., Levine, M., Lewin, D.: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In: Proceedings of the 29th annual ACM Symposium on Theory of Computing, pp. 654–663. ACM Press, New York (1997)Google Scholar
  2. 2.
    Abrams, M., Standridge, C.R., Abdulla, G., Williams, S., Fox, E.A.: Caching Proxies: Limita-tions and Potentials. In: Proceedings of 4th International World Wide Web Conference, pp. 119–133 (1995)Google Scholar
  3. 3.
    Chen, Y., Katz, R.H., Kubiatowicz, J.D.: Dynamic Replica Placement for Scalable Content Delivery. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 306–318. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Li, Y., Liu, M.T.: Optimization of Performance Gain in Content Distribution Networks with Server Replicas. In: SAINT2003 Proceedings, pp. 182–189 (2003)Google Scholar
  5. 5.
    Albert, R., Barabasi, A.L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74, 47–97 (2002)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. ACM SIGCOMM, 251–262 (1999)Google Scholar
  7. 7.
    Stauffer, D., Aharony, A.: Introduction to Percolation Theory. Taylor and Froncis, London (1994)Google Scholar
  8. 8.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-addressable Network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architec-tures, and Protocols for Computer Communications, pp. 161–172. ACM Press, New York (2001)CrossRefGoogle Scholar
  9. 9.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM, pp. 149–160. ACM Press, New York (2001)Google Scholar
  10. 10.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed Object Location in a Dynamic Network. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, pp. 41–52 (2002)Google Scholar
  12. 12.
    Sunaga, H., Hoshiai, T., Kamei, S., Kimura, S.: Technical Trends in P2P-Based Communications. IEICE TRANS. COMMUN E87-B(10), 2831–2846 (2004)Google Scholar
  13. 13.
    Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Physical Review E 64(046135) (2001)Google Scholar
  14. 14.
    Fujita, Y., Yoshida, J., Tsuda, K.: Reverse-Query Mechanism for Contents Delivery Management in Distributed Agent Network. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3684, pp. 758–764. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Masuda, N., Konno, N.: Science of Complex Network, Sangyo Tosho (2005) (In Japanese)Google Scholar
  16. 16.
  17. 17.
    Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners Don’t Take All: Characterizing the Competition for Links on the Web. In: Proceedings of the National Academy of Sciences, vol. 99(8), pp. 5207–5211 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yoshikatsu Fujita
    • 1
    • 2
  • Yasufumi Saruwatari
    • 2
  • Jun Yoshida
    • 1
  • Kazuhiko Tsuda
    • 2
  1. 1.Corporate eNet Business DivisionMatsushita Electric Industrial Co., Ltd.TokyoJapan
  2. 2.Graduate School of Business ScinecesUniversity of Tsukuba, TokyoTokyoJapan

Personalised recommendations