A decentralised service composition approach for peer-to-peer video delivery

Recent platforms for Peer-to-Peer (P2P) based video distribution such as Zattoo and Joost are based on End-Host or Application Layer Multicast techniques. An on demand adaptation of audio/video data to end user terminals or to the transport and error characteristics of the client access technology is not supported. To address such issues in the scale of P2P Networks, we describe a cooperative service provisioning principle (CSP) based on the assumption that selected peers offer processing services to the community. In contrast to recent approaches our main focus in this paper is on the applicability of QoS estimation techniques to decrease time and measurement complexity of CSP. We provide a state of the art in landmark-based delay estimation and introduce a novel technique for landmark-based bottleneck bandwidth prediction showing favourable results for networks with widest path routing.

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

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

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

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

[5]  M. Frans Kaashoek,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.

[6]  Dominic A. Schupke,et al.  Routing optimization in IP networks utilizing additive and concave link metrics , 2007, TNET.

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

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

[9]  Sujata Banerjee,et al.  S3: a scalable sensing service for monitoring large networked systems , 2006, INM '06.

[10]  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.

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

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

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

[14]  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).

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

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

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

[18]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2003, Comput. Networks.

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

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

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

[22]  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..

[23]  M. Kleis,et al.  A placement scheme for peer-to-peer networks based on principles from geometry , 2004 .

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

[25]  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).

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

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

[28]  Mikaël Salaün,et al.  CSP, Cooperative Service Provisioning Using Peer-to-Peer Principles , 2007, IWSOS.

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

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

[31]  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..