Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030790
Masahiro Tamori, S. Ishihara, Takashi Watanabe, T. Mizuno
One of the features of wireless ad hoc network technology is that networks can be constructed without a fixed network infrastructure. Communication in a disaster is one application of a mobile ad hoc network. Data on the disaster can be collected by mobile hosts. The mobile hosts can then exchange data to decide rescue priority, etc. However connectivity in a wireless ad hoc network is not guaranteed because hosts encounter obstacles. Thus, the accessibility of the data objects held in a particular host is very important. To ensure accessibility, we propose a method for distributing replicas of regional data on mobile ad-hoc networks.
{"title":"A replica distribution method with consideration of the positions of mobile hosts on wireless ad-hoc networks","authors":"Masahiro Tamori, S. Ishihara, Takashi Watanabe, T. Mizuno","doi":"10.1109/ICDCSW.2002.1030790","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030790","url":null,"abstract":"One of the features of wireless ad hoc network technology is that networks can be constructed without a fixed network infrastructure. Communication in a disaster is one application of a mobile ad hoc network. Data on the disaster can be collected by mobile hosts. The mobile hosts can then exchange data to decide rescue priority, etc. However connectivity in a wireless ad hoc network is not guaranteed because hosts encounter obstacles. Thus, the accessibility of the data objects held in a particular host is very important. To ensure accessibility, we propose a method for distributing replicas of regional data on mobile ad-hoc networks.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"42 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":"134349587","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.1030792
Misako Urakami, Tetsuya Shigeyasu, H. Matsuno
The performance of a mobile agent in obtaining data is evaluated by computer simulation in terms of the number of mobile agents. As a preparation for the simulation, two parameters "target existing rate" and "living time" of the mobile agent are identified through experiment on the Internet. This paper suggests that these parameters are essential factors for distinguishing a suitable situation for using mobile agents to obtain the desired data.
{"title":"Performance evaluation of mobile agent on its living time and target existing rates in servers","authors":"Misako Urakami, Tetsuya Shigeyasu, H. Matsuno","doi":"10.1109/ICDCSW.2002.1030792","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030792","url":null,"abstract":"The performance of a mobile agent in obtaining data is evaluated by computer simulation in terms of the number of mobile agents. As a preparation for the simulation, two parameters \"target existing rate\" and \"living time\" of the mobile agent are identified through experiment on the Internet. This paper suggests that these parameters are essential factors for distinguishing a suitable situation for using mobile agents to obtain the desired data.","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":"133026822","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.1030866
K. Psounis
Web-caching performance is hard to increase further due to the growing number of non-cachable dynamic Web-documents. Delta-encoding is a promising technique that exploits temporal correlation among different snapshots of a dynamic document, and renders dynamic traffic cachable. However, it has not yet been deployed due to the significant scalability concerns related to the storage requirements for base-files on the server-side. We introduce class-based delta-encoding, a scalable scheme to perform delta-encoding on dynamic Web-traffic. The idea is to group documents into classes, and store one document per class on the server-side. Thus, the proposed scheme exploits both temporal correlation in a dynamically evolving document, and spatial correlation among different documents. Finally, we present an architecture to deploy the scheme, that is transparent to clients, proxy-caches, and Web-servers. Experimental results report that class-based delta-encoding combined with compression reduces the bandwidth consumption by a factor of 30, and the latency perceived by most users by a factor of 10 on average, without suffering from enormous storage requirements on the server-side.
{"title":"Class-based delta-encoding: a scalable scheme for caching dynamic Web content","authors":"K. Psounis","doi":"10.1109/ICDCSW.2002.1030866","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030866","url":null,"abstract":"Web-caching performance is hard to increase further due to the growing number of non-cachable dynamic Web-documents. Delta-encoding is a promising technique that exploits temporal correlation among different snapshots of a dynamic document, and renders dynamic traffic cachable. However, it has not yet been deployed due to the significant scalability concerns related to the storage requirements for base-files on the server-side. We introduce class-based delta-encoding, a scalable scheme to perform delta-encoding on dynamic Web-traffic. The idea is to group documents into classes, and store one document per class on the server-side. Thus, the proposed scheme exploits both temporal correlation in a dynamically evolving document, and spatial correlation among different documents. Finally, we present an architecture to deploy the scheme, that is transparent to clients, proxy-caches, and Web-servers. Experimental results report that class-based delta-encoding combined with compression reduces the bandwidth consumption by a factor of 30, and the latency perceived by most users by a factor of 10 on average, without suffering from enormous storage requirements on the server-side.","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":"125380358","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.1030755
K. Kera, K. Bekki, K. Mori
Recently the system needs of growing systems including heterogeneous functions and operations have increased. An assurance system that achieves high reliability and high availability is very important for such systems. In order to realize a high assurance system, we researched the step-by-step construction technique with assurance technology. In this paper we mainly discuss the evaluated measure for step-by-step construction. Functional reliability and online functional availability are the best measures for deciding the order of step-by-step system construction. According to the measure, functional group construction is the best solution.
{"title":"Step-by-step system construction technique with assurance technology-evaluation measure for step-by-step system constructioni","authors":"K. Kera, K. Bekki, K. Mori","doi":"10.1109/ICDCSW.2002.1030755","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030755","url":null,"abstract":"Recently the system needs of growing systems including heterogeneous functions and operations have increased. An assurance system that achieves high reliability and high availability is very important for such systems. In order to realize a high assurance system, we researched the step-by-step construction technique with assurance technology. In this paper we mainly discuss the evaluated measure for step-by-step construction. Functional reliability and online functional availability are the best measures for deciding the order of step-by-step system construction. According to the measure, functional group construction is the best solution.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"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":"130072675","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.1030789
C. Mourlas
Continuous media applications have an implied temporal dimension, i.e. they are presented at a particular rate for a particular length of time and if the required rate of presentation is not met the integrity of these media is destroyed. We present a set of language constructs suitable for the definition of the required QoS and the real-time dimension of the media that participate in a multimedia application. We propose a new modeling scheme where we can represent every different presentation by a periodic task and then we describe a method that provides low-level support to these language constructs. The emphasis of the proposed strategy is on deterministic guarantees and can be considered as a next step for the design and the implementation of predictable continuous media applications over a network.
{"title":"Specification and verification of quality requirements in distributed multimedia presentations","authors":"C. Mourlas","doi":"10.1109/ICDCSW.2002.1030789","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030789","url":null,"abstract":"Continuous media applications have an implied temporal dimension, i.e. they are presented at a particular rate for a particular length of time and if the required rate of presentation is not met the integrity of these media is destroyed. We present a set of language constructs suitable for the definition of the required QoS and the real-time dimension of the media that participate in a multimedia application. We propose a new modeling scheme where we can represent every different presentation by a periodic task and then we describe a method that provides low-level support to these language constructs. The emphasis of the proposed strategy is on deterministic guarantees and can be considered as a next step for the design and the implementation of predictable continuous media applications over a network.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"23 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":"129492808","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.1030868
S. Srbljic, D. Vrsalovic, I. Skuliber
We introduce analytical models for predicting the performance of World Wide Web (WWW) proxy caches that are distributed over multiple proxy machines under various management protocol assumptions. The purpose of these models is to determine which distributed cache management (DCM) protocols are to be used for large-scale distributed caches. The accuracy and usefulness of our models is assessed by comparing the performance predicted by the models with measurements from real system in operation. We run tests with different values of various parameters that define behavior of distributed cache, communication protocol, DCM protocol, and application.
{"title":"Analytical performance prediction of WWW distributed cache management (DCM) protocols","authors":"S. Srbljic, D. Vrsalovic, I. Skuliber","doi":"10.1109/ICDCSW.2002.1030868","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030868","url":null,"abstract":"We introduce analytical models for predicting the performance of World Wide Web (WWW) proxy caches that are distributed over multiple proxy machines under various management protocol assumptions. The purpose of these models is to determine which distributed cache management (DCM) protocols are to be used for large-scale distributed caches. The accuracy and usefulness of our models is assessed by comparing the performance predicted by the models with measurements from real system in operation. We run tests with different values of various parameters that define behavior of distributed cache, communication protocol, DCM protocol, and application.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"36 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":"125059206","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.1030747
Jie Wu, Zhen Jiang
In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2D) meshes with faulty nodes contained in a set of disjoint faulty blocks. It is based on Wu's (1998, 2000) minimal routing in 2D meshes. Fault information is coded in a 4-tuple called extended safety level associated with each node to determine the feasibility of minimal routing. Specifically, we study the existence of a minimal route at a given source node based on the associated extended safety level, limited distribution of faulty block information, and minimal routing. An analytical model for the number of rows and columns that receive faulty block information is also given. Extensions to Wang's (1999) minimal-connected-components (MCCs) fault model are also considered. Simulation results show substantial improvement in terms of a higher percentage of minimal routing in 2D meshes under both fault models.
{"title":"Extended minimal routing in 2D meshes with faulty blocks","authors":"Jie Wu, Zhen Jiang","doi":"10.1109/ICDCSW.2002.1030747","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030747","url":null,"abstract":"In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2D) meshes with faulty nodes contained in a set of disjoint faulty blocks. It is based on Wu's (1998, 2000) minimal routing in 2D meshes. Fault information is coded in a 4-tuple called extended safety level associated with each node to determine the feasibility of minimal routing. Specifically, we study the existence of a minimal route at a given source node based on the associated extended safety level, limited distribution of faulty block information, and minimal routing. An analytical model for the number of rows and columns that receive faulty block information is also given. Extensions to Wang's (1999) minimal-connected-components (MCCs) fault model are also considered. Simulation results show substantial improvement in terms of a higher percentage of minimal routing in 2D meshes under both fault models.","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":"131379568","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.1030784
Robert R. Roxas, N. Mirenkov
Despite the advances in software technology, there are still problems that need to be solved. They are related to understanding components, modifying them and their interfaces, etc., as well as to the practical use of component-based development for large-scale applications. Our approach is based on developing multiple view components of multimedia types. These multiple views can be divided into a few groups to represent different features of a component: (1) computational schemes of a corresponding component algorithm, (2) variables and formulas used in the algorithm, and (3) input/output (I/O) operations of the component. Such approach simplifies the understanding and manipulation of components. This paper discusses examples of visualizing I/O specifications which include the definition of data source and the corresponding target, scanning schemes applied to structures, conditions imposed upon different operations, etc. In other words, a visual language to define external inter-component interfaces is presented.
{"title":"Visualizing external inter-component interfaces","authors":"Robert R. Roxas, N. Mirenkov","doi":"10.1109/ICDCSW.2002.1030784","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030784","url":null,"abstract":"Despite the advances in software technology, there are still problems that need to be solved. They are related to understanding components, modifying them and their interfaces, etc., as well as to the practical use of component-based development for large-scale applications. Our approach is based on developing multiple view components of multimedia types. These multiple views can be divided into a few groups to represent different features of a component: (1) computational schemes of a corresponding component algorithm, (2) variables and formulas used in the algorithm, and (3) input/output (I/O) operations of the component. Such approach simplifies the understanding and manipulation of components. This paper discusses examples of visualizing I/O specifications which include the definition of data source and the corresponding target, scanning schemes applied to structures, conditions imposed upon different operations, etc. In other words, a visual language to define external inter-component interfaces is presented.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"204 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":"116505822","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.1030785
A. Guercio, T. Arndt, Shi-Kuo Chang
Multimedia applications are becoming increasingly important in areas such as education (digital libraries, training, presentation, distance learning), health care (telemedicine, health information management, medical image systems), entertainment (video-on-demand, music databases, interactive TV), information dissemination (news-on-demand, advertising, TV broadcasting), and manufacturing (distributed manufacturing, distributed collaborative authoring). In this paper we introduce a visual software engineering tool which is part of a suite of tools called MICE used for the rapid prototyping of distributed multimedia applications.
{"title":"A visual editor for multimedia application development","authors":"A. Guercio, T. Arndt, Shi-Kuo Chang","doi":"10.1109/ICDCSW.2002.1030785","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030785","url":null,"abstract":"Multimedia applications are becoming increasingly important in areas such as education (digital libraries, training, presentation, distance learning), health care (telemedicine, health information management, medical image systems), entertainment (video-on-demand, music databases, interactive TV), information dissemination (news-on-demand, advertising, TV broadcasting), and manufacturing (distributed manufacturing, distributed collaborative authoring). In this paper we introduce a visual software engineering tool which is part of a suite of tools called MICE used for the rapid prototyping of distributed multimedia applications.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"54 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":"116335650","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.1030861
He Zheng, Jin Kwak, Kyungho Son, Wansuk Lee, Seungjoo Kim, Dongho Won
The proliferation of smart gadgets, appliances, mobile devices, PDAs and sensors has enabled the construction of ubiquitous computing environments, transforming regular physical spaces into "Active Information Spaces" augmented with intelligence and enhanced with services. This new exciting computing paradigm promises to revolutionize the way we interact with computers, services, and the surrounding physical spaces, yielding higher productivity and more seamless interaction between users and computing services. However, the deployment of this computing paradigm in real-life is hindered by poor security, particularly, the lack of proper authentication and access control techniques and privacy preserving protocols. We propose an authentication framework that addresses this problem through the use of different wearable and embedded devices. These devices authenticate entities with varied levels of confidence, in a transparent, convenient, and private manner, allowing the framework to blend nicely into ubiquitous computing environments.
{"title":"A flexible, privacy-preserving authentication framework for ubiquitous computing environments","authors":"He Zheng, Jin Kwak, Kyungho Son, Wansuk Lee, Seungjoo Kim, Dongho Won","doi":"10.1109/ICDCSW.2002.1030861","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030861","url":null,"abstract":"The proliferation of smart gadgets, appliances, mobile devices, PDAs and sensors has enabled the construction of ubiquitous computing environments, transforming regular physical spaces into \"Active Information Spaces\" augmented with intelligence and enhanced with services. This new exciting computing paradigm promises to revolutionize the way we interact with computers, services, and the surrounding physical spaces, yielding higher productivity and more seamless interaction between users and computing services. However, the deployment of this computing paradigm in real-life is hindered by poor security, particularly, the lack of proper authentication and access control techniques and privacy preserving protocols. We propose an authentication framework that addresses this problem through the use of different wearable and embedded devices. These devices authenticate entities with varied levels of confidence, in a transparent, convenient, and private manner, allowing the framework to blend nicely into ubiquitous computing environments.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"7 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":"122234106","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
扫码关注我们
求助内容：
应助结果提醒方式：