The Community for Technology Leaders
RSS Icon
Issue No.08 - August (2009 vol.20)
pp: 1112-1125
Ibrahim Al-Oqily , Hashemite University, Jordan
Ahmed Karmouch , University of Ottawa, Canada
This paper proposes a new fault-resilient service overlay for MediaPort resource discovery that allows services to be efficiently and accurately located. MediaPorts are network-side functions used in the path between the source (media server) and the sink (media client). MediaPorts enable the adaptation of media content by providing value-added services such as caching, synchronization, and special routing functions. Our new approach addresses the problems of inefficiency and large message overhead, both typical of traditional approaches to resource discovery. The approach is based on a widely studied family of chordal rings, called the optimal chordal ring. Our solution is based on the types of services offered and also on the geographical locations of nodes. Extensive simulation results are presented to validate the effectiveness of the new approach, when compared to several other service-discovery solutions.
Resource management, semantic, overlay services, distributed systems, rings, optimal chordal ring.
Ibrahim Al-Oqily, Ahmed Karmouch, "SORD: A Fault-Resilient Service Overlay for MediaPort Resource Discovery", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 8, pp. 1112-1125, August 2009, doi:10.1109/TPDS.2008.171
[1] S. Schmid, F. Hartung, M. Kampmann, S. Herborn, and J. Rey, “SMART: Intelligent Multimedia Routing and Adaptation Based on Service Specific Overlay Networks,” Proc. Eurescom Summit '05, pp. 69-77, 2005.
[2] N. Niebert, A. Schieder, H. Abramowicz, G. Malmgren, J. Sachs, U. Horn, C. Prehofer, and H. Karl, “Ambient Networks—An Architecture for Communication Networks Beyond 3G,” IEEE Wireless Comm., special issue on 4G mobile comm.—toward open wireless architecture, 2004.
[3] W.T. Ooi and R. van Renesse, “The Design and Implementation of Programmable Media Gateways,” Proc. 16th Int'l Workshop Network and Operating System Support for Digital Audio and Video (NOSSDAV '00), June 2000.
[4] V. Dimakopoulos and E. Pitoura, “Performance Analysis of Distributed Search in Open Agent Systems,” Proc. 17th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2003.
[5] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A Review of Routing Protocols for Mobile Ad Hoc Networks,” Ad Hoc Networks, vol. 2, no. 1, pp. 1-22, Jan. 2004.
[6] Gnutella, RFC, http:/, 2003.
[7] V. Dimakopoulos and E. Pitoura, “On the Performance of Flooding-Based Resource Discovery,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 11, Nov. 2006.
[8] S. Herborn, Y. Lopez, and A. Seneviratne, “A Distributed Scheme for Autonomous Service Composition,” Proc. First ACM Int'l Workshop Multimedia Service Composition (MSC '05), Nov. 2005.
[9] M. Ripeanu, M. Bowman, J.S. Chase, I. Foster, and M. Milenkovic, “Globus and PlanetLab Resource Management Solutions Compared,” Proc. 13th IEEE Int'l Symp. High Performance Distributed Computing (HPDC '04), pp. 246-255, June 2004.
[10] R.V. Renesse, “Scalable and Secure Resource Location,” Proc.33rd Ann. Hawaii Int'l Conf. System Sciences (HICSS '00), Jan. 2000.
[11] E. Simonton, K.C. Byung, and S. Seidel, “Using Gossip for Dynamic Resource Discovery,” Proc. Int'l Conf. Parallel Processing (ICPP '06), pp. 319-328, Aug. 2006.
[12] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, Feb. 2003.
[13] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM '01, Sept. 2001.
[14] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329-350, 2001.
[15] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report UCB/CSD-01-1141, Univ. of California, Berkeley, 2001.
[16] P. Maymounkov and D. Mazieres, “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
[17] P. Trunfio, D. Talia, P. Fragopoulou, C. Papadakis, M. Mordacchini, M. Pennanen, K. Popov, V. Vlassov, and S. Haridi, “Peer-to-Peer Models for Resource Discovery on Grids,” CoreGRID Technical Report TR-0028, http:/, Mar. 2006.
[18] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, “Handling Churn in a DHT,” Proc. Usenix Ann. Technical Conf., June 2004.
[19] P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” Proc. ACM/IFIP/Usenix Int'l Middleware Conf. (Middleware '03), pp. 16-20, 2003.
[20] M. Balazinska, H. Balakrishnan, and D. Karger, “INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery,” Proc. First Int'l Conf. Pervasive Computing (Pervasive '02), pp. 26-28, 2002.
[21] S.G. Doudane and N. Agoulmine, “Enhanced DHT-Based P2P Architecture for Effective Resource Discovery and Management,” J. Network and Systems Management, vol. 15, no. 3, pp. 335-354, Sept. 2007.
[22] Y. Joung, L. Yang, and C. Fang, “Keyword Search in DHT-Based Peer-to-Peer Networks,” IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 46-61, Jan. 2007.
[23] P. Ganesan, K. Gummadi, and H. Garcia-Molina, “Canon in G Major: Designing DHTs with Hierarchical Structure,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS), 2004.
[24] A. Mislove and P. Druschel, “Providing Administrative Control and Autonomy in Structured Peer-to-Peer Overlays,” Proc. Third Int'l Workshop Peer-to-Peer Systems (IPTPS '04), Feb. 2004.
[25] Z. Xu, R. Min, and Y. Hu, “HIERAS: A DHT Based Hierarchical P2P Routing Algorithm,” Proc. Int'l Conf. Parallel Processing (ICPP), 2003.
[26] M.S. Artigas, P.G. Lopez, J.P. Ahullo, and A.F.G. Skarmeta, “Cyclone: A Novel Design Schema for Hierarchical DHTs,” Proc. Fifth IEEE Int'l Conf. Peer-to-Peer Computing (P2P), 2005.
[27] Z. Haiyang and M. Huadong, “An Efficient Hierarchical DHT-Based Complex Query For Multimedia Information,” Proc. IEEE Int'l Conf. Multimedia and Expo (ICME '07), pp. 568-571, July 2007.
[28] A. Crespo and H. Garcia-Molina, “Semantic Overlay Networks for P2P Systems,” technical report, Stanford Univ., 2002.
[29] K. Aberer and P. Cude-Mauroux, “Semantic Overlay Networks,” VLDB Tutorial, p. 1367, Aug. 2005.
[30] C. Andersen, D. Balakrishnan, H. Kaashoek, and F. Morris, “Resilient Overlay Networks,” Proc. 18th ACM Symp. Operating System Principles (SOSP '01), Oct. 2001.
[31] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom '00, pp. 243-254, 2000.
[32] M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” IEEE Network Magazine, vol. 15, pp. 30-39, Nov./Dec. 2001.
[33] I. Al-Oqily and A. Karmouch, “A Lightweight Semantic Overlay Resource Discovery,” Proc. 14th IEEE Int'l Conf. Telecommunications (ICT-MICC '07), May 2007.
[34] E. Christensen, F. Curbera, G. Meredith, and S. Weerawarana, Web Services Description Language (WSDL) 1.1, TRwsdl, Mar. 2001.
[35] S. Herborn, Y. Loez, and A. Seneviratne, “A Distributed Scheme for Autonomous Service Composition,” Proc. First ACM Int'l Workshop Multimedia Service Composition (MSC '05), pp. 21-30, Nov. 2005.
[36] X. Gu, K. Nahrstedt, W. Yuan, D. Wichadukal, and D. Xu, “An XMLbased Quality of Service Enabling Language for the Web,” Technical Report UIUCDCS-R-2001-2212, Univ. of Illinois, Urbana-Champaign, 2001.
[37] L. Narayanan, J. Opatrny, and D. Sotteau, “All to All Optical Routing in Chordal Rings of Degree Four,” Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA), 1999.
[38] B. Parhami, “Chordal Rings Based on Symmetric Odd-Radix Number Systems,” Proc. Int'l Conf. Comm. in Computing (CIC '05), pp. 196-199, June 2005.
[39] R. Beivide, C. Martinez, C. Izu, J. Gutierrez, J. Gregorio, and J. Miguel-Alonso, “Chordal Topologies for Interconnection Networks,” Lecture Notes on Computer Science, Oct. 2003.
[40] A. Lakhina, J.W. Byers, M. Crovella, and I. Matta, “On the Geographic Location of Internet Resources,” IEEE J. Selected Areas in Comm., vol. 21, no. 6, pp. 934-948, Aug. 2003.
[41] T. Melodia, D. Pompili, and I.F. Akyildiz, “On the Interdependence of Distributed Topology Control and Geographical Routing in Ad Hoc and Sensor Networks,” IEEE J. Selected Areas in Comm., vol. 23, no. 3, pp. 520-532, Mar. 2005.
[42] Y. Wang, D. DeWitt, and J. Cai, “X-Diff: An Effective Change Detection Tool for XML Documents,” Proc. 19th Int'l Conf. Data Engineering (ICDE), 2003.
[43] A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: Universal Topology Generation from a User's Perspective,” Technical Report BUCS-TR-2001-003, Boston Univ., Apr. 2001.
[44] H.Y. Tyan and C.J. Hou, JavaSim On-Line Manuals and Tutorials, http:/, 2008.
[45] D. Xu, K. Nahrstedt, and D. Wichadakul, “MeGaDiP: A Wide-Area Media Gateway Discovery Protocol,” Proc. IEEE Int'l Conf. Performance, Computing, and Comm. (IPCCC '00), pp. 257-263, Feb. 2000.
[46] E. Asmare, S. Schmid, and M. Brunner, “Setup and Maintenance of Overlay Networks for Multimedia Services in Mobile Environments,” Proc. Eighth Int'l Conf. Management of Multimedia Networks and Services (MMNS '05), Oct. 2005.
[47] S. Ratnasamy, “A Scalable Content-Addressable Network,” PhD dissertation, Univ. of California, Berkeley, Oct. 2002.
[48] S. Tabbane, “An Alternative Strategy for Location Tracking,” IEEE J. Selected Areas in Comm., vol. 13, no. 5, pp. 880-892, June 1995.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool