An integrated tool for development of overlay services
Authors: 
Yuki Sakai, Akihito Hiromori, Hirozumi Yamaguchi, Khaled El-Fakih, Teruo HigashinoAuthors Info & Claims
Article No.: 61, Pages 1 - 10
Abstract
We propose an integrated environment for supporting the development of overlay services. Given a service description written in a centralized and network-independent way using a high-level Petri net, our tool automatically derives its distributed version taking into consideration the targeted overlay network specification and network/computing resources. Furthermore, our tool interprets the distributed version and allows the overlay nodes to execute the service as specified in the description. During that time, the tool monitors the utilization of overlay links and occupation of processors so that related information can be provided to the developers. Consequently, the developers only give the service description and our toolset supports the subsequent design and development tasks. An experimental study on using the toolset and a realistic application example are provided to show the effectiveness of our methodology.
References
[1]
D. Benza, M. Cosnard, L. Liquori, and M. Vesin. Arigatoni: A simple programmable overlay network. In JVA '06: Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, pages 82--91. IEEE Computer Society, 2006.
[2]
L. A. Cherkasova, V. E. Kotov, and T. Rokicki. On net modeling of industrial size concurrent systems. In Proc. of 14th Int. Conf. on Application and Theory of Petri Nets 1993 (LNCS 691), pages 552--561. Springer-Verlag, 1993.
[3]
J. de Figueiredo and L. Kristensen. Using coloured Petri nets to investigate behavioural and performance issues of TCP protocols. In Proc. of 2nd Workshop on Practical Use of Coloured Petri Nets and Design/CPN, pages 21--40, 1999.
[4]
H. J. Genrich and K. Lautenbach. The analysis of distributed systems by means of Predicate/transition-nets. In Proc. of Int. Symp. on Semantics of Concurrent Computation (LNCS 70), pages 123--147, 1979.
[5]
H. J. Genrich and K. Lautenbach. System modeling with high-level Petri nets. Theoretical Computer Science, 13(1):109--136, 1981.
[6]
X. Gu, K. Nahrstedt, and B. Yu. Spidernet: An integrated peer-to-peer service composition framework. In Proc. of IEEE Int. Symposium on High-Performance Distributed Computing (HPDC-13), 2004.
[7]
P. Huber and V. Pinci. A formal executable specification of the ISDN basic rate interface. In Proc. of 12th Int. Conf. on Application and Theory of Petri Nets, pages 1--21, 1991.
[8]
K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use Volume 1: Basic Concepts. Monographs in Theoretical Computer Science. An EATCS Series. Springer-Verlag, 1997.
[9]
E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Leboisky. Seti@home-massively distributed computing for seti. Computing in Science & Engineering, 3(1):78--83, 2001.
[10]
S. M. Larson, C. D. Snow, M. R. Shirts, and V. S. Pande. Folding@home and genome@home: Using distributed computing to tackle previously intractable problems in computational biology. Computational Genomics, 2002.
[11]
B. Li, J. Guo, and M. Wang. iOverlay: A lightweight middleware infrastructure for overlay application implementations. In Proceedings of the Fifth ACM/IFIP/USENIX International Middleware Conference (Middleware 2004), also Lecture Notes in Computer Science, pages 135--154, 2004.
[12]
B. T. Loo, T. Condie, J. M. Hellerstein, P. Maniatis, T. Roscoe, and I. Stoica. Implementing declarative overlays. SIGOPS Oper. Syst. Rev., 39(5):75--90, December 2005.
[13]
J. L. Rasmussen and M. Singh. Designing a security system by means of coloured Petri nets. In Proc. of 17th Int. Conf. on Application and Theory of Petri Nets (LNCS 1091), pages 400--419, 1996.
[14]
A. Ratzer, L. Wells, H. Lassen, M. Laursen, J. Qvortrup, M. Stissing, M. Westergaard, S. Christensen, and K. Jensen. CPN Tools for editing, simulating, and analyzing coloured Petri nets. In Proc. of 24th Int. Conf. on Application and Theory of Petri Nets, 2003.
[15]
A. Rodriguez, C. Killian, S. Bhat, D. Kostic, and A. Vahdat. MACEDON: Methodology for automatically creating, evaluating, and designing overlay networks. In Proceedings of the USENIX/ACM Symposium on Networked Systems Design and Implementation (NSDI2004, pages 267--280, 2004.
[16]
K. Shudo, Y. Tanaka, and S. Sekiguchi. Overlay weaver: An overlay construction toolkit. Computer Communications, 31(2):402--412, February 2008.
[17]
M. Wang, B. Li, and Z. Li. sFlow: Towards resource-efficient and agile service federation in service overlay networks. In Proc. of 24th Int. Conf. on Distributed Computing Systems (ICDCS2004), 2004.
[18]
D. Xu and K. Nahrstedt. Finding service paths in an overlay media service proxy network. In Proc. of Int. Conf. on Multimedia Computing and Networking 2002 (MMCN2002), 2002.
[19]
H. Yamaguchi, K. El-Fakih, A. Hiromori, and T. Higashino. A formal approach to design optimized multimedia service overlay. In Proc. of 15th ACM Int. Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2005), pages 57--62, 2005.
[20]
H. Yamaguchi, K. El-Fakih, G. v. Bochmann, and T. Higashino. Deriving protocol specifications from service specifications written as predicate/transition-nets. Computer Networks Journal, 51(1):2581--284, Jan. 2007.
Index Terms
- An integrated tool for development of overlay services
Recommendations
EPDKS: an efficient proximity-based distributed K-ary structured overlay network
PDCS '07: Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and SystemsStructured peer-to-peer overlay networks provide a means for interconnecting a large set of computing nodes called peers in a distributed, scalable and self-organizing manner. Typically in such systems, each peer maintains contact information about a ...
An effective single-hop distributed hash table with high lookup performance and low traffic overhead
Distributed hash tables DHTs have been used in several applications, but most DHTs have opted to solve lookups with multiple hops, to minimize bandwidth costs while sacrificing lookup latency. This paper presents D1HT, an original DHT that has a peer-to-...
C2: a new overlay network based on CAN and Chord
In this paper, we present C2, a new overlay network based on CAN and Chord. It is primarily designed for a dynamic environment in which peers join and depart the network frequently. For an n-peers C2 system, each peer maintains only about O(log n) of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
March 2009
720 pages
ISBN:9789639799455
- General Chairs:
- Olivier Dalle,
- Gabriel Wainer,
- Program Chairs:
- L. Felipe Perrone,
- Giovanni Stea
Sponsors
- Create-Net
- ICST
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 02 March 2009
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 58Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)5
Reflects downloads up to 24 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in