CSP, Cooperative Service Provisioning Using Peer-to-Peer Principles

In this paper we describe a self-organising and self-managing system for a Cooperative Service Provisioning (CSP) of media transport and processing services. The term cooperative is used since we assume that CSP providers as well as users offer resources to be utilised for media delivery and processing based on an Overlay Network principle. The core building block of the proposed system is a Distributed Hash Table extended with a CSP specific indexing principle and recursive search algorithm. The task of QoS constraint verification for a requested service is distributed between participating nodes. In this paper we describe CSP based on a Content Addressable Network (CAN) [1] DHT. The resulting system is evaluated based on a theoretical analysis as well as simulations.

[1]  Jörg Liebeherr,et al.  Application-layer multicasting with Delaunay triangulation overlays , 2002, IEEE J. Sel. Areas Commun..

[2]  Klara Nahrstedt,et al.  Service composition for advanced multimedia applications , 2005, IS&T/SPIE Electronic Imaging.

[3]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[4]  Keiichi Yasumoto,et al.  Resource-aware service composition for video multicast to heterogeneous mobile users , 2005, MSC '05.

[5]  Jadwiga Indulska,et al.  Experiences in Using CC/PP in Context-Aware Systems , 2003, Mobile Data Management.

[6]  Joseph D. Touch,et al.  Dynamic Internet overlay deployment and management using the X-Bone , 2000, Proceedings 2000 International Conference on Network Protocols.

[7]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[8]  Irene Mavrommati,et al.  eComP: an architecture that supports P2P networking among ubiquitous computing devices , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[9]  Eng Keong Lua,et al.  Internet Routing Policies and Round-Trip-Times , 2005, PAM.

[10]  Philipp Hoschka,et al.  MIME Type Registration of RTP Payload Formats , 2003, RFC.

[11]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[12]  Helen J. Wang,et al.  An evaluation of scalable application-level multicast built using peer-to-peer overlays , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[15]  Mark Handley,et al.  SDP: Session Description Protocol , 1998, RFC.

[16]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[17]  Anupam Gupta,et al.  An elementary proof of the Johnson-Lindenstrauss Lemma , 1999 .

[18]  Piet Van Mieghem,et al.  Performance evaluation of constraint-based path selection algorithms , 2004, IEEE Network.

[19]  Sujata Banerjee,et al.  Netvigator: Scalable Network Proximity Estimation , 2005 .

[20]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[21]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[22]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  Lawrence K. Saul,et al.  Modeling distances in large-scale networks by matrix factorization , 2004, IMC '04.

[24]  Dominic A. Schupke,et al.  Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics , 2007, IEEE/ACM Transactions on Networking.

[25]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[26]  Klara Nahrstedt,et al.  SpiderNet: an integrated peer-to-peer service composition framework , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[27]  Randy H. Katz,et al.  The SAHARA Model for Service Composition across Multiple Providers , 2002, Pervasive.

[28]  Michael Kleis,et al.  A P2P Approach for the Selection of Media Processing Modules for Service Specific Overlay Networks , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[29]  Mark Handley,et al.  Reliable Multicast Transport Building Blocks for One-to-Many Bulk-Data Transfer , 2001, RFC.

[30]  Klara Nahrstedt,et al.  Dynamic QoS-aware multimedia service configuration in ubiquitous computing environments , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[31]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[32]  Hyuk Lim,et al.  Constructing Internet coordinate system based on delay measurement , 2003, IEEE/ACM Transactions on Networking.

[33]  Klara Nahrstedt,et al.  Self-Configuring Information Management for Large-Scale Service Overlays , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[34]  Randy H. Katz,et al.  Load balancing and stability issues in algorithms for service composition , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[35]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[36]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[37]  Randy H. Katz,et al.  OverQoS: An Overlay Based Architecture for Enhancing Internet QoS , 2004, NSDI.

[38]  Francisco Curbera,et al.  Web services description language (wsdl) version 1. 2 , 2001 .

[39]  Klara Nahrstedt,et al.  QoS-assured service composition in managed service overlay networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[40]  Ralph Keller.  Self configuring services for extensible networks: a routing integrated approach , 2004 .

[41]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[42]  Schahram Dustdar,et al.  OMNIX: A Topology-Independent P2P Middleware , 2003, CAiSE Workshops.

[43]  Ozalp Babaoglu,et al.  Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004] , 2005, Self-star Properties in Complex Information Systems.

[44]  S. Seetharaman,et al.  Overlay-Friendly Native Network : A Contradiction in Terms ? , 2005 .

[45]  H. Samet.  Contractive Embedding Methods for Similarity Searching in Metric Spaces , 2000 .

[46]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[47]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[48]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[49]  Yuval Shavitt,et al.  Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.

[50]  Klara Nahrstedt,et al.  Finding service paths in a media service proxy network , 2001, IS&T/SPIE Electronic Imaging.

[51]  Jon Crowcroft,et al.  On the accuracy of embeddings for internet coordinate systems , 2005, IMC '05.

[52]  Zongpeng Li,et al.  sFlow: towards resource-efficient and agile service federation in service overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[53]  Adrian Popescu,et al.  NetForecast: A Delay Prediction Scheme for Provider Controlled Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[54]  Shankar Ponnekanti,et al.  SWORD: A Developer Toolkit for Web Service Composition , 2008 .

[55]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, IEEE/ACM Transactions on Networking.

[56]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[57]  Klara Nahrstedt,et al.  Distributed multimedia service composition with statistical QoS assurances , 2006, IEEE Transactions on Multimedia.

[58]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[59]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[60]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

[61]  Yuval Shavitt,et al.  Optimal partition of QoS requirements with discrete cost functions , 2000, IEEE Journal on Selected Areas in Communications.

[62]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[63]  Elaine Shi,et al.  OverDoSe: A Generic DDoS Protection Service Using an Overlay Network , 2006 .

[64]  Jerome H. Saltzer,et al.  End-to-end arguments in system design , 1984, TOCS.

[65]  Flemming Andreasen,et al.  Session Description Protocol (SDP) Simple Capability Declaration , 2002, RFC.

[66]  David Watson,et al.  Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[67]  Klara Nahrstedt,et al.  A scalable QoS-aware service aggregation model for peer-to-peer computing grids , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[68]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[69]  Ben Y. Zhao,et al.  The Ninja architecture for robust Internet-scale systems and services , 2001, Comput. Networks.

[70]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[71]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[72]  Wolf-Tilo Balke,et al.  Towards building large scale multimedia systems and applications: challenges and status , 2005, MSC '05.

[73]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[74]  Michael Kleis,et al.  A placement scheme for peer-to-peer networks based on principles from geometry , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[75]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[76]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[77]  P. Marti,et al.  Peer-to-peer communication for virtual industrial devices , 2002, 4th IEEE International Workshop on Factory Communication Systems.

[78]  Klara Nahrstedt,et al.  Source-based QoS service routing in distributed service networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).