Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030824
R. Robinson, A. Rakotonirainy
Online personalisation is of great interest to companies. Event notification systems are becoming more and more popular as a natural candidate to provide personalised services. Although event notification protocols do not immediately spring to mind as the most sensible transport of realtime streams, our approach does utilise a content-based event notification protocol. In this paper we present an architecture able to correlate and filter real-time multimedia streams using an event notification protocol (Elvin) and the Real-Time Transport Protocol (RTP). We demonstrate, through simple examples, how a MPEG-2 stream can be customised to the user in real-time based on his or her subscription. Such an architecture can serve as enabling technology to integrate, correlate and abstract different sources of information such as discrete and continuous events.
{"title":"Multimedia customisation using an event notification protocol","authors":"R. Robinson, A. Rakotonirainy","doi":"10.1109/ICDCSW.2002.1030824","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030824","url":null,"abstract":"Online personalisation is of great interest to companies. Event notification systems are becoming more and more popular as a natural candidate to provide personalised services. Although event notification protocols do not immediately spring to mind as the most sensible transport of realtime streams, our approach does utilise a content-based event notification protocol. In this paper we present an architecture able to correlate and filter real-time multimedia streams using an event notification protocol (Elvin) and the Real-Time Transport Protocol (RTP). We demonstrate, through simple examples, how a MPEG-2 stream can be customised to the user in real-time based on his or her subscription. Such an architecture can serve as enabling technology to integrate, correlate and abstract different sources of information such as discrete and continuous events.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"46 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":"128383411","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.1030851
Wang-kee Poon, Jiannong Cao
As the peer-to-peer (P2P) computing paradigm receives more and more attention, it is now necessary to provide computing platforms to offer an environment to build P2P applications. In this paper, we describe Rheeve, a computing platform that provides support for the development of HTTP-enabled, efficient and fault-tolerant P2P applications. Rheeve has a highly modular system architecture and scalable mechanisms for efficient peer connections and service discovery and delivery. Its work distribution and execution facility enables sharing of computation resources in a language and protocol independent manner. Rheeve also provides a visual programming interface, which, together with the underlying JavaBeans technology, supports a plug-n-play style of application design.
{"title":"Rheeve: a plug-n-play peer-to-peer computing platform","authors":"Wang-kee Poon, Jiannong Cao","doi":"10.1109/ICDCSW.2002.1030851","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030851","url":null,"abstract":"As the peer-to-peer (P2P) computing paradigm receives more and more attention, it is now necessary to provide computing platforms to offer an environment to build P2P applications. In this paper, we describe Rheeve, a computing platform that provides support for the development of HTTP-enabled, efficient and fault-tolerant P2P applications. Rheeve has a highly modular system architecture and scalable mechanisms for efficient peer connections and service discovery and delivery. Its work distribution and execution facility enables sharing of computation resources in a language and protocol independent manner. Rheeve also provides a visual programming interface, which, together with the underlying JavaBeans technology, supports a plug-n-play style of application design.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"29 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":"122924168","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.1030769
Wonjun Lee, J. Srivastava
This paper presents the design and implementation of a continuous media file system, which has been implemented in the context of a distributed multimedia application development environment that has been prototyped. To make a performance analysis of file systems and distributed object services for continuous media provisioning, we validate the performance analysis of the file system on media-on-demand (MOD) systems against that of a conventional file system through an experimental evaluation.
{"title":"Experiences with evaluating system QoS and channel performance on media-on-demand systems","authors":"Wonjun Lee, J. Srivastava","doi":"10.1109/ICDCSW.2002.1030769","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030769","url":null,"abstract":"This paper presents the design and implementation of a continuous media file system, which has been implemented in the context of a distributed multimedia application development environment that has been prototyped. To make a performance analysis of file systems and distributed object services for continuous media provisioning, we validate the performance analysis of the file system on media-on-demand (MOD) systems against that of a conventional file system through an experimental evaluation.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"45 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":"123939360","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.1030809
L. Andrade, J. Fiadeiro
We propose a layered architecture based on the separation of two concerns - computation and coordination - as a means of achieving higher levels of auto-adaptability. This separation makes it possible for adaptation to be enforced through the reconfiguration of the system in terms of the mechanisms that coordinate interactions, superposing connectors among components of the system without intruding on the way the computations that they perform locally are implemented.
{"title":"An architectural approach to auto-adaptive systems","authors":"L. Andrade, J. Fiadeiro","doi":"10.1109/ICDCSW.2002.1030809","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030809","url":null,"abstract":"We propose a layered architecture based on the separation of two concerns - computation and coordination - as a means of achieving higher levels of auto-adaptability. This separation makes it possible for adaptation to be enforced through the reconfiguration of the system in terms of the mechanisms that coordinate interactions, superposing connectors among components of the system without intruding on the way the computations that they perform locally are implemented.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"17 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":"124072918","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.1030766
Chuan-Feng Chiu, T. Shih, Pei-Ying Wu, Sheng-Hua Shiau
Because of the growth of Internet commerce, individual online transactions will grow rapidly. So in this paper we propose an interactive negotiation agent system on the Internet to help buyers make decisions. We use multi-attribute utility theory as the basic decision making strategy and the theorem is useful for the multicriteria decision. We stated the user goal that can be divided into several independent goals and the sub goals can be negotiated with sellers in parallel. On the other hand the user cannot handle the complex process individually; we take advantage of the agent technology as the major system developed.
{"title":"The design of interactive negotiation agent on the Web","authors":"Chuan-Feng Chiu, T. Shih, Pei-Ying Wu, Sheng-Hua Shiau","doi":"10.1109/ICDCSW.2002.1030766","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030766","url":null,"abstract":"Because of the growth of Internet commerce, individual online transactions will grow rapidly. So in this paper we propose an interactive negotiation agent system on the Internet to help buyers make decisions. We use multi-attribute utility theory as the basic decision making strategy and the theorem is useful for the multicriteria decision. We stated the user goal that can be divided into several independent goals and the sub goals can be negotiated with sellers in parallel. On the other hand the user cannot handle the complex process individually; we take advantage of the agent technology as the major system developed.","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":"128489579","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.1030742
Li Shu, D. Poppe
In addition to depending on wireless links-which are less reliable than wired ones-mobile ad hoc networks (MANET) introduce a unique set of operational characteristics that affect message delivery assurance. One such characteristic is that the mobility of nodes in a MANET causes the topology of the entire network to alter dynamically. In particular, as a change in a single link can alter the entire delivery path, we note that the persistence of a message delivery route diminishes with the growth of network size. We propose to adapt a method that was proposed by Asmuth and Blakley (1982) for data communication to take advantage of this lack of path persistence to enhance message delivery assurance in MANET. Specifically, we show that this adaptation can be used to improve the level of successful first delivery attempts, and reduce the variations in network latency for delivering successive data packets. Additionally, we show that this adaptation admits dynamic adjustments to accommodate the time varying characteristics of message delivery paths in a MANET. Finally, we show that this adaptation can also be used to provide message security protection en route.
{"title":"Assuring message delivery in mobile ad hoc networks with packet erasure recovery","authors":"Li Shu, D. Poppe","doi":"10.1109/ICDCSW.2002.1030742","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030742","url":null,"abstract":"In addition to depending on wireless links-which are less reliable than wired ones-mobile ad hoc networks (MANET) introduce a unique set of operational characteristics that affect message delivery assurance. One such characteristic is that the mobility of nodes in a MANET causes the topology of the entire network to alter dynamically. In particular, as a change in a single link can alter the entire delivery path, we note that the persistence of a message delivery route diminishes with the growth of network size. We propose to adapt a method that was proposed by Asmuth and Blakley (1982) for data communication to take advantage of this lack of path persistence to enhance message delivery assurance in MANET. Specifically, we show that this adaptation can be used to improve the level of successful first delivery attempts, and reduce the variations in network latency for delivering successive data packets. Additionally, we show that this adaptation admits dynamic adjustments to accommodate the time varying characteristics of message delivery paths in a MANET. Finally, we show that this adaptation can also be used to provide message security protection en route.","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":"129137529","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.1030771
Anthony G. Nguyen, Jenq-Neng Hwang
In this paper, we describe the development of our scene context dependent key frame selection method to reduce the amount of recorded video data. We propose the use of motion analysis (MA) to adapt to scene content in our key frame selection process. Based on the information generated by the motion analysis stage, frames in the video sequence which contain significant motion information are selected to retain for recording. We also show that our proposed method performs better than the traditional time-lapse recording method.
{"title":"Scene context dependent key frame selection in streaming","authors":"Anthony G. Nguyen, Jenq-Neng Hwang","doi":"10.1109/ICDCSW.2002.1030771","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030771","url":null,"abstract":"In this paper, we describe the development of our scene context dependent key frame selection method to reduce the amount of recorded video data. We propose the use of motion analysis (MA) to adapt to scene content in our key frame selection process. Based on the information generated by the motion analysis stage, frames in the video sequence which contain significant motion information are selected to retain for recording. We also show that our proposed method performs better than the traditional time-lapse recording method.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"172 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":"116003244","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.1030863
M. Bauer, B. Brügge, G. Klinker, A. MacWilliams, T. Reicher, C. Sandor, M. Wagner
In Marc Weiser's (1991) vision of ubiquitous computing, users are located in an environment with potentially thousands of computers around them. Many capabilities of these smart devices can be used only by augmenting the users' senses with a kind of "sixth electronic sense". Thus, ubiquitous computing and wearable computing complement one another. However, the architectural styles for them are quite different. The paper presents a flexible and modular network-centered approach for the design of wearable computers. In our concept, a wearable computer is composed of a network of modules. A module can be worn by the user or be stationary in the user's environment. Each is a separate unit with its own processing, memory, I/O, power, and network connection, and provides specific functionality in the network. The modules reveal their abilities and needs to each other and dynamically assemble to form a network-based wearable multi-computer. Our concept has been used in the DWARF framework to build a first prototype system for indoor and outdoor navigation.
{"title":"An architecture concept for ubiquitous computing aware wearable computers","authors":"M. Bauer, B. Brügge, G. Klinker, A. MacWilliams, T. Reicher, C. Sandor, M. Wagner","doi":"10.1109/ICDCSW.2002.1030863","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030863","url":null,"abstract":"In Marc Weiser's (1991) vision of ubiquitous computing, users are located in an environment with potentially thousands of computers around them. Many capabilities of these smart devices can be used only by augmenting the users' senses with a kind of \"sixth electronic sense\". Thus, ubiquitous computing and wearable computing complement one another. However, the architectural styles for them are quite different. The paper presents a flexible and modular network-centered approach for the design of wearable computers. In our concept, a wearable computer is composed of a network of modules. A module can be worn by the user or be stationary in the user's environment. Each is a separate unit with its own processing, memory, I/O, power, and network connection, and provides specific functionality in the network. The modules reveal their abilities and needs to each other and dynamically assemble to form a network-based wearable multi-computer. Our concept has been used in the DWARF framework to build a first prototype system for indoor and outdoor navigation.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"43 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":"117015198","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.1030845
S. Graupner, V. Kotov, Holger Trinks
The expectation of a global presence of services leads to the need for large numbers of service instances allocated in a multitude of regional data centers in order to provide sufficient service capacity close to where the demand occurs. Scale of service instances is anticipated growing /spl Gt/10/sup 4/ raising new challenges for control and management. Pragmatically, it must become much easier to deploy service instances in data center, allocating resources, sharing them, installing and configuring data and software needed for service instances and integrating them into a singular service that appears to a consumer. Adjusting numbers and locations of service instances is seen as a basic control mechanism in order to follow regional or temporal fluctuations in demands. The paper proposes a new concept of virtualizing whole data center environments and quickly deploying massive amounts of service instances. A virtualization layer takes care of resource allocation from different data center locations and all specifics when service instances are allocated in a particular data center. Virtualized data centers provide a consistent operating environment spanning multiple physical data center locations for the whole family of service instances. And vice versa, physical data centers host several execution environments for different services. After a brief discussion of challenges coming with the scale of service instances we anticipate, the paper overviews virtual data centers and discusses one aspect in more detail how massive amounts of service instances can be deployed using a recursive approach.
{"title":"Resource-sharing and service deployment in virtual data centers","authors":"S. Graupner, V. Kotov, Holger Trinks","doi":"10.1109/ICDCSW.2002.1030845","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030845","url":null,"abstract":"The expectation of a global presence of services leads to the need for large numbers of service instances allocated in a multitude of regional data centers in order to provide sufficient service capacity close to where the demand occurs. Scale of service instances is anticipated growing /spl Gt/10/sup 4/ raising new challenges for control and management. Pragmatically, it must become much easier to deploy service instances in data center, allocating resources, sharing them, installing and configuring data and software needed for service instances and integrating them into a singular service that appears to a consumer. Adjusting numbers and locations of service instances is seen as a basic control mechanism in order to follow regional or temporal fluctuations in demands. The paper proposes a new concept of virtualizing whole data center environments and quickly deploying massive amounts of service instances. A virtualization layer takes care of resource allocation from different data center locations and all specifics when service instances are allocated in a particular data center. Virtualized data centers provide a consistent operating environment spanning multiple physical data center locations for the whole family of service instances. And vice versa, physical data centers host several execution environments for different services. After a brief discussion of challenges coming with the scale of service instances we anticipate, the paper overviews virtual data centers and discusses one aspect in more detail how massive amounts of service instances can be deployed using a recursive approach.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"35 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":"115232634","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.1030815
P. Kellomaki
Research on aspect oriented programming and specification has highlighted the need to deal with cross-cutting concerns that involve more than one implementation level component. Distributed systems are an important application area where cross-cutting concerns frequently emerge. We present a novel way of composing distributed behavior from reusable superposition steps. The steps are given in a joint action notation, which allows the introducing of logically related data and operations in several implementation level components simultaneously. A superposition step contains a description of the context in which it is applicable, and the additional structure to add to a specification. Aspects of collective behavior may overlap at the implementation level. To make it possible to separate aspects cleanly at the specification level, our specification method allows entities to be merged in composition to allow an implementation level entity to play multiple specification level roles.
{"title":"Composing distributed systems from reusable aspects of behavior","authors":"P. Kellomaki","doi":"10.1109/ICDCSW.2002.1030815","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030815","url":null,"abstract":"Research on aspect oriented programming and specification has highlighted the need to deal with cross-cutting concerns that involve more than one implementation level component. Distributed systems are an important application area where cross-cutting concerns frequently emerge. We present a novel way of composing distributed behavior from reusable superposition steps. The steps are given in a joint action notation, which allows the introducing of logically related data and operations in several implementation level components simultaneously. A superposition step contains a description of the context in which it is applicable, and the additional structure to add to a specification. Aspects of collective behavior may overlap at the implementation level. To make it possible to separate aspects cleanly at the specification level, our specification method allows entities to be merged in composition to allow an implementation level entity to play multiple specification level roles.","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":"122697319","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
扫码关注我们
求助内容：
应助结果提醒方式：