Canopy: Publish/subscribe with upgraph combination

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Tarkoma, Sasu ^a   Antikainen, Markku ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS DOMAINS; CONTENT DISTRIBUTION SYSTEMS; CORE NETWORKS; MULTI-PATH; MULTICASTS; NETWORK TOPOLOGY; NEW SYSTEM; PEER-TO-PEER LINKS; PUB/SUB; PUBLISH/SUBSCRIBE;

ELECTRIC NETWORK TOPOLOGY;

EID: 77953877101     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2010.5466656     Document Type: Conference Paper

References (27)

1. J. H. Saltzer, D. P. Reed, and D. D. Clark, "End-to-End Arguments in System Design," ACM TOCS, vol. 2, no. 4, pp. 277-288, November 1984.
2. P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec, "The many faces of publish/subscribe," ACM Comput. Surv., vol. 35, no. 2, pp. 114-131, 2003.
3. P. Jokela, A. Zahemszky, S. Arianfar, P. Nikander, and C. Esteve, "LIPSIN: Line speed Publish/Subscribe Inter-Networking," in ACM SIGCOMM, Barcelona, Spain, August 2009.
4. M. Särelä, T. Rinta-aho, and S. Tarkoma, "RTFM: Publish/Subscribe Internetworking Architecture," in ICT-MobileSummit 2008 Conference Proceedings, 2008.
5. T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica, "A data-oriented (and beyond) network architecture," SIGCOMM Comput. Commun. Rev., vol. 37, no. 4, pp. 181-192, 2007.
6. J. Rajahalme, M. Särelä, P. Nikander, and S. Tarkoma, "Incentive-compatible caching and peering in data-oriented networks," in CoNEXT ReArch, 2008.
7. V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. Briggs, and R. Braynard, "Networking named content," in CoNEXT, 2009.
8. K. K. Lakshminarayanan, I. Stoica, S. Shenker, and J. Rexford, "Routing as a service," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-19, Feb 2006. [Online]. Available: http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-19.html
9. N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and J. van der Merwe, "The case for separating routing from routers," in FDNA '04: Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture. New York, NY, USA: ACM, 2004, pp. 5-12.
10. D. Zhu, M. Gritter, and D. R. Cheriton, "Feedback based routing," SIGCOMM Comput. Commun. Rev., vol. 33, no. 1, pp. 71-76, 2003.
11. X. Yang, D. Clark, and A.W. Berger, "NIRA: a new inter-domain routing architecture," IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 775-788, 2007.
12. R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker, "Characterizing and measuring path diversity of internet topologies," in SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. New York, NY, USA: ACM, 2003, pp. 304-305.
13. P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica, "Pathlet routing," in SIGCOMM '09: Proceedings of the ACM SIGCOMM 2009 conference on Data communication. New York, NY, USA: ACM, 2009, pp. 111-122.
14. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, "The end-to-end effects of internet path selection," SIGCOMM Comput. Commun. Rev., vol. 29, no. 4, pp. 289-299, 1999.
15. L. Gao, "On inferring autonomous system relationships in the internet," IEEE/ACM Trans. Netw., vol. 9, no. 6, pp. 733-745, 2001.
16. "The CAIDA AS Relationships Dataset," http://www.caida.org/ data/active/as-relationships/, Nov 2009.
17. C. Esteve, F. L. Verdi, and M. F. Magalhães, "Towards a new generation of information-oriented internetworking architectures," in CoNEXT, 2008, p. 65.
18. B. Grönvall, "Scalable multicast forwarding," SIGCOMM Comput. Commun. Rev., vol. 32, no. 1, pp. 68-68, 2002.
19. C. E. Rothenberg, C. Macapuna, and A. Wiesmaier, "In-packet bloom filters: Design and networking applications," CoRR, vol. abs/0908.3574, 2009.
20. M. Yu, A. Fabrikant, and J. Rexford, "Buffalo: Bloom filter forwarding architecture for large organizations," in Conext, 2009.
21. H. Ballani, Y. Chawathe, S. Ratnasamy, T. Roscoe, and S. Shenker, "Off by default!" in Proc. 4th ACM Workshop on Hot Topics in Networks (Hotnets-IV), College Park, MD, Nov. 2005.
22. A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," in Internet Mathematics, vol. 1, 2002, pp. 636-646. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20. 98
23. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, "SkipNet: a scalable overlay network with practical locality properties," in USITS'03: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems. Berkeley, CA, USA: USENIX Association, 2003, pp. 9-9.
24. J. Aspnes and G. Shah, "Skip graphs," ACM Trans. Algorithms, vol. 3, no. 4, p. 37, 2007.
25. P. Ganesan, K. Gummadi, and H. Garcia-Molina, "Canon in G Major: Designing DHTs with Hierarchical Structure," in ICDCS '04: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04). Washington, DC, USA: IEEE Computer Society, 2004, pp. 263-272.
26. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf, "Design and evaluation of a wide-area event notification service," ACM Transactions on Computer Systems, vol. 19, no. 3, pp. 332-383, aug 2001. [Online]. Available: http://www.cs.colorado.edu/~carzanig/papers/
27. S. Tarkoma, "Efficient content-based routing, mobility-aware topologies, and temporal subspace matching," Ph.D. dissertation, Department of Computer Science, University of Helsinki, 2006, available at ethesis. helsinki.fi.