Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030834
Theophilos A. Limniotes, C. Mourlas, G. A. Papadopoulos
The coordination paradigm has been used extensively as a mechanism for software composition and integration. However, relatively little work has been done for the cases where the software components involved have real-time requirements. The paper presents an extension to a state-of-the-art controller event-driven coordination language with real-time capabilities. It then illustrates the expressiveness of the proposed extensions by means of modeling a distributed multimedia application. Finally, it discusses how these extensions can be supported by the underlying architecture.
{"title":"Event-driven coordination of real-time components","authors":"Theophilos A. Limniotes, C. Mourlas, G. A. Papadopoulos","doi":"10.1109/ICDCSW.2002.1030834","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030834","url":null,"abstract":"The coordination paradigm has been used extensively as a mechanism for software composition and integration. However, relatively little work has been done for the cases where the software components involved have real-time requirements. The paper presents an extension to a state-of-the-art controller event-driven coordination language with real-time capabilities. It then illustrates the expressiveness of the proposed extensions by means of modeling a distributed multimedia application. Finally, it discusses how these extensions can be supported by the underlying architecture.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"17 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123596685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030777
M. Tantaoui, K. Hua, S. Sheu
In video-on-demand (VOD) applications, it is desirable to provide the user with the video-cassette-recorder-like (VCR) capabilities such as fast-forwarding a video or jumping to a specific frame. We address this issue in the broadcast framework, where each video is broadcast repeatedly on the network. Existing techniques rely on data prefetching as the mechanism to provide this functionality. This approach provides limited usability since the prefetching rate cannot keep up with typical fast-forward speeds. We address this practical problem in this paper by repeatedly broadcasting the interactive versions of the videos. Our client software leverages these "interactive broadcasts to provide better VCR service.
{"title":"A scalable technique for VCR-like interactions in video-on-demand applications","authors":"M. Tantaoui, K. Hua, S. Sheu","doi":"10.1109/ICDCSW.2002.1030777","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030777","url":null,"abstract":"In video-on-demand (VOD) applications, it is desirable to provide the user with the video-cassette-recorder-like (VCR) capabilities such as fast-forwarding a video or jumping to a specific frame. We address this issue in the broadcast framework, where each video is broadcast repeatedly on the network. Existing techniques rely on data prefetching as the mechanism to provide this functionality. This approach provides limited usability since the prefetching rate cannot keep up with typical fast-forward speeds. We address this practical problem in this paper by repeatedly broadcasting the interactive versions of the videos. Our client software leverages these \"interactive broadcasts to provide better VCR service.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125199153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030770
Chieh-Ling Huang, Yuh-Ren Choo, P. Chung
Motion estimation plays an important role in image processing, since temporal information has been regarded as a promising feature for both image segmentation and video coding. In this paper a hybrid approach is proposed to integrate a differential (gradient-based) optical flow approach and region-based matching approach to search for accurate object motion vectors. Our method adopts the Horn-Schunck optical flow constraint, in conjunction with several proposed techniques to convert the dense optical flow field to region-based motion field, and thereby suppress noise. The region-based matching approach is a modified version of the traditional block-matching algorithm, so that it can operate in region-based mode, and thereby enhance the visual effectiveness near the edges. Therefore, the proposed hybrid method has the tendency to obtain the estimation of "true" object motion inherited by the gradient-based approach, and also the superior visual effectiveness inherited by the block-matching approach.
{"title":"Combining region-based differential and matching algorithms to obtain accurate motion vectors for moving object in a video sequence","authors":"Chieh-Ling Huang, Yuh-Ren Choo, P. Chung","doi":"10.1109/ICDCSW.2002.1030770","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030770","url":null,"abstract":"Motion estimation plays an important role in image processing, since temporal information has been regarded as a promising feature for both image segmentation and video coding. In this paper a hybrid approach is proposed to integrate a differential (gradient-based) optical flow approach and region-based matching approach to search for accurate object motion vectors. Our method adopts the Horn-Schunck optical flow constraint, in conjunction with several proposed techniques to convert the dense optical flow field to region-based motion field, and thereby suppress noise. The region-based matching approach is a modified version of the traditional block-matching algorithm, so that it can operate in region-based mode, and thereby enhance the visual effectiveness near the edges. Therefore, the proposed hybrid method has the tendency to obtain the estimation of \"true\" object motion inherited by the gradient-based approach, and also the superior visual effectiveness inherited by the block-matching approach.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"128 26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030752
Kwoun Sup Youn, C. Hong
We propose an efficient mechanism that is used to manage network with XML. It is an XML-based Dynamic network management system using Web. We describe a paradigm for the retrieval and presentation of management data using XML. It facilitates runtime agent extension and allows the MIB to be easily browsed and seamlessly integrated with online documentation. XML also allows the interchange of data between management systems. In this paper, we propose an XML-based Dynamic network management architecture using Web. The proposed architecture is implemented using Java and its push technology for the management of IP network.
{"title":"An XML-based dynamic network management system using Web technology","authors":"Kwoun Sup Youn, C. Hong","doi":"10.1109/ICDCSW.2002.1030752","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030752","url":null,"abstract":"We propose an efficient mechanism that is used to manage network with XML. It is an XML-based Dynamic network management system using Web. We describe a paradigm for the retrieval and presentation of management data using XML. It facilitates runtime agent extension and allows the MIB to be easily browsed and seamlessly integrated with online documentation. XML also allows the interchange of data between management systems. In this paper, we propose an XML-based Dynamic network management architecture using Web. The proposed architecture is implemented using Java and its push technology for the management of IP network.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122531463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030750
T. Ono, K. Ragab, N. Kaji, K. Mori
The advancement of mobile telecommunication has made mobile commerce possible. Reliable communication between the retailers and the users is required for the provision of the services. Real-time property is also required for the marketing of the users' requirements and the provision of the local majority based services. Achieving assurance for these requirements under the evolving situation is required. Time distance, which changes with the situation is introduced as the efficient measure of the distance between the users and the retailers. The time distance oriented service system has been defined to satisfy real-time property and reliable communication in the local trade area. The system architecture, and the autonomous interactive communication between the users and the retailers are presented. Here, nodes have autonomy for fading unnecessary and inconvenient information through time distance based communication among them both for the marketing and provision. The nodes also autonomously reduce the information service area for achieving further effectiveness. It is shown that this architecture and technologies realize assurance for the real-time properties and reliability and achieve effectiveness in mobile commerce.
{"title":"Service oriented communication technology for achieving assurance","authors":"T. Ono, K. Ragab, N. Kaji, K. Mori","doi":"10.1109/ICDCSW.2002.1030750","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030750","url":null,"abstract":"The advancement of mobile telecommunication has made mobile commerce possible. Reliable communication between the retailers and the users is required for the provision of the services. Real-time property is also required for the marketing of the users' requirements and the provision of the local majority based services. Achieving assurance for these requirements under the evolving situation is required. Time distance, which changes with the situation is introduced as the efficient measure of the distance between the users and the retailers. The time distance oriented service system has been defined to satisfy real-time property and reliable communication in the local trade area. The system architecture, and the autonomous interactive communication between the users and the retailers are presented. Here, nodes have autonomy for fading unnecessary and inconvenient information through time distance based communication among them both for the marketing and provision. The nodes also autonomously reduce the information service area for achieving further effectiveness. It is shown that this architecture and technologies realize assurance for the real-time properties and reliability and achieve effectiveness in mobile commerce.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030762
P. Halvorsen, T. Plagemann, V. Goebel
Data servers for multimedia applications like news-on-demand represent a severe bottleneck, because a potentially very high number of users concurrently retrieve data with high data rates. In the Intermediate Storage Node Concept (INSTANCE) project, we develop a new architecture for media-on-demand servers that maximizes the number of concurrent clients a single server can support. Traditional bottlenecks, like copy operations, multiple copies of the same data element in main memory, and checksum calculation in communication protocols are avoided by applying three orthogonal techniques: network level framing (NLF), zero-copy-one-copy memory architecture, and integrated error management. In this paper, we describe how to minimize the transport level protocol processing using NLF. In particular, we look at how NLF is implemented, and we present performance measurements indicating a large performance gain. The protocol execution is minimized to about 450 cycles per packet regardless of packet size, i.e., a reduction of about 87% compared to 1 KB packets and more using larger packets. Consequently, the total server-side processing overhead is decreased by at least 50%.
{"title":"Minimizing protocol processing in multimedia servers - implementation and evaluation of network level framing","authors":"P. Halvorsen, T. Plagemann, V. Goebel","doi":"10.1109/ICDCSW.2002.1030762","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030762","url":null,"abstract":"Data servers for multimedia applications like news-on-demand represent a severe bottleneck, because a potentially very high number of users concurrently retrieve data with high data rates. In the Intermediate Storage Node Concept (INSTANCE) project, we develop a new architecture for media-on-demand servers that maximizes the number of concurrent clients a single server can support. Traditional bottlenecks, like copy operations, multiple copies of the same data element in main memory, and checksum calculation in communication protocols are avoided by applying three orthogonal techniques: network level framing (NLF), zero-copy-one-copy memory architecture, and integrated error management. In this paper, we describe how to minimize the transport level protocol processing using NLF. In particular, we look at how NLF is implemented, and we present performance measurements indicating a large performance gain. The protocol execution is minimized to about 450 cycles per packet regardless of packet size, i.e., a reduction of about 87% compared to 1 KB packets and more using larger packets. Consequently, the total server-side processing overhead is decreased by at least 50%.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030768
Shinfeng D. Lin, B. Hsu, Xin-Lun Yang
Due to the increasing number of registered trademarks, it is more and more difficult to design and register a new trademark without a good retrieval method Thus, we propose a new region based shape description method: the distance-angle pair wise histogram, as the trademark shape feature vector to retrieve similar trademarks Experiments have been conducted on about 1000 trademark images. Some moment-based methods have also been implemented. In general the proposed method performs better than other moment-based methods.
{"title":"Content-based trademark retrieval system using a new region based shape description method: the distance-angle pair-wise histogram","authors":"Shinfeng D. Lin, B. Hsu, Xin-Lun Yang","doi":"10.1109/ICDCSW.2002.1030768","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030768","url":null,"abstract":"Due to the increasing number of registered trademarks, it is more and more difficult to design and register a new trademark without a good retrieval method Thus, we propose a new region based shape description method: the distance-angle pair wise histogram, as the trademark shape feature vector to retrieve similar trademarks Experiments have been conducted on about 1000 trademark images. Some moment-based methods have also been implemented. In general the proposed method performs better than other moment-based methods.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030823
Ghazaleh Ashayer, Hubert Ka Yau Leung, H. Jacobsen
An important class of publish/subscribe matching algorithms work in two stages. First, predicates are matched and then matching subscriptions are derived. We observe that in practice, the domain types over which predicates are defined are often of fixed enumerable cardinality. Based on this observation we propose a table-based look-up scheme for fast predicate evaluation that finds all matching predicates for each type with one table lookup. We compare this scheme to alternative general-purpose implementations. This observation may also suggests that matching in publish/subscribe systems could equally well be implemented with standard database technology. We propose two DBMS-based matching algorithms and compare the better one with a special purpose publish/subscribe matching algorithm implementation. We provide first evidence that for application scenarios that require large subscription workloads and process many events a DBMS-based solution is not a feasible alternative.
{"title":"Predicate matching and subscription matching in Publish/Subscribe systems","authors":"Ghazaleh Ashayer, Hubert Ka Yau Leung, H. Jacobsen","doi":"10.1109/ICDCSW.2002.1030823","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030823","url":null,"abstract":"An important class of publish/subscribe matching algorithms work in two stages. First, predicates are matched and then matching subscriptions are derived. We observe that in practice, the domain types over which predicates are defined are often of fixed enumerable cardinality. Based on this observation we propose a table-based look-up scheme for fast predicate evaluation that finds all matching predicates for each type with one table lookup. We compare this scheme to alternative general-purpose implementations. This observation may also suggests that matching in publish/subscribe systems could equally well be implemented with standard database technology. We propose two DBMS-based matching algorithms and compare the better one with a special purpose publish/subscribe matching algorithm implementation. We provide first evidence that for application scenarios that require large subscription workloads and process many events a DBMS-based solution is not a feasible alternative.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123856526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030814
E. Putrycz, G. Bernard
Scaling applications to large networks and an increasing number of users has been for years a technical challenge. Today, technologies are well known to scale applications to local networks but scaling to large networks with high latency is still a challenge. The DLBS (dynamic load balancing service) brings new solutions regarding large scale load balancing for middleware based applications. DLBS offers a multi-criteria and easily customizable load balancing service. It consists of a scalable monitoring infrastructure, a connection manager (integrated into the middleware) and customizable load balancing strategies. Implementation of a low level service requires in order to stay efficient to avoid the necessity for high overhead. DLBS aims to be a generic load balancing service and an easy and efficient portability with a CORBA object request broker has been possible thanks to aspect oriented programming.
{"title":"Using aspect oriented programming to build a portable load balancing service","authors":"E. Putrycz, G. Bernard","doi":"10.1109/ICDCSW.2002.1030814","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030814","url":null,"abstract":"Scaling applications to large networks and an increasing number of users has been for years a technical challenge. Today, technologies are well known to scale applications to local networks but scaling to large networks with high latency is still a challenge. The DLBS (dynamic load balancing service) brings new solutions regarding large scale load balancing for middleware based applications. DLBS offers a multi-criteria and easily customizable load balancing service. It consists of a scalable monitoring infrastructure, a connection manager (integrated into the middleware) and customizable load balancing strategies. Implementation of a low level service requires in order to stay efficient to avoid the necessity for high overhead. DLBS aims to be a generic load balancing service and an easy and efficient portability with a CORBA object request broker has been possible thanks to aspect oriented programming.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121538499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030849
Joaquín Keller, G. Simon
This paper envisions a shared virtual reality system that could handle millions of users and objects. The SOLIPSIS system does not rely on servers and is based on a network of peers that collaborate to build up a common virtual world. Real-time interactions and virtual co-presence are enabled by the means of emissive and receptive fields that determine how avatar kinestesia and multimedia streams are established. We describe here the overall architecture and the main algorithms that make Soupsis conceivable.
{"title":"Toward a peer-to-peer shared virtual reality","authors":"Joaquín Keller, G. Simon","doi":"10.1109/ICDCSW.2002.1030849","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030849","url":null,"abstract":"This paper envisions a shared virtual reality system that could handle millions of users and objects. The SOLIPSIS system does not rely on servers and is based on a network of peers that collaborate to build up a common virtual world. Real-time interactions and virtual co-presence are enabled by the means of emissive and receptive fields that determine how avatar kinestesia and multimedia streams are established. We describe here the overall architecture and the main algorithms that make Soupsis conceivable.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"367 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122061405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：