Pub Date : 2001-04-16DOI: 10.1109/CDCS.2001.918703
V. Kahmann, L. Wolf
Multimedia applications are attractive, especially in home networks where consumer electronics products are more and more integrated into computer networks. As portable devices in combination with wireless local area networks (WLAN) form a reasonable extension to in-home computer networks, multimedia content should be delivered to these devices also. We propose a concept of collaborative media streaming without depending on any special network functionality. In particular, wireless devices can benefit from such application extensions. As we found it important to leave the ability to control streaming at each user, we introduce the concept of association. This concept enables users to share common objects as well as to get an own copy of the stream where applicable.
{"title":"Collaborative media streaming in an in-home network","authors":"V. Kahmann, L. Wolf","doi":"10.1109/CDCS.2001.918703","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918703","url":null,"abstract":"Multimedia applications are attractive, especially in home networks where consumer electronics products are more and more integrated into computer networks. As portable devices in combination with wireless local area networks (WLAN) form a reasonable extension to in-home computer networks, multimedia content should be delivered to these devices also. We propose a concept of collaborative media streaming without depending on any special network functionality. In particular, wireless devices can benefit from such application extensions. As we found it important to leave the ability to control streaming at each user, we introduce the concept of association. This concept enables users to share common objects as well as to get an own copy of the stream where applicable.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122732577","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918711
Arnaud Troël, M. Banâtre, P. Couderc, F. Weis
Development and projections of wireless PDAs enable to envisage the design of new application classes that exploit short range and direct communications (e.g. one-hop communications). In the near future we may imagine mobile users dynamically and spontaneously exchanging information as soon as they are close enough. In such a context, a connection between two nodes may be broken at any time because of the unconstrained mobility of the nodes and the short communication range. Therefore transmitting data in the most efficient and reliable way becomes a real challenge. To give a first solution to this problem, we propose a mobility-aware software architecture that estimates the duration of a communication link before processing information exchanges.
{"title":"Predictive scheme for proximate interactions","authors":"Arnaud Troël, M. Banâtre, P. Couderc, F. Weis","doi":"10.1109/CDCS.2001.918711","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918711","url":null,"abstract":"Development and projections of wireless PDAs enable to envisage the design of new application classes that exploit short range and direct communications (e.g. one-hop communications). In the near future we may imagine mobile users dynamically and spontaneously exchanging information as soon as they are close enough. In such a context, a connection between two nodes may be broken at any time because of the unconstrained mobility of the nodes and the short communication range. Therefore transmitting data in the most efficient and reliable way becomes a real challenge. To give a first solution to this problem, we propose a mobility-aware software architecture that estimates the duration of a communication link before processing information exchanges.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"54 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120809265","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918684
Xiaoming Liu, R. V. Renesse, M. Bickford, C. Kreitz, R. Constable
As we see a growing variety of network and application behaviors, it becomes more important that protocols adapt to their surroundings. Building adaptive protocols is complicated, and therefore we have considered building hybrid protocols that switch between specialized protocols. We show for which communication properties this is a correct solution, and classify these using a new concept called meta-properties. We also show how well these switches perform.
{"title":"Protocol switching: exploiting meta-properties","authors":"Xiaoming Liu, R. V. Renesse, M. Bickford, C. Kreitz, R. Constable","doi":"10.1109/CDCS.2001.918684","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918684","url":null,"abstract":"As we see a growing variety of network and application behaviors, it becomes more important that protocols adapt to their surroundings. Building adaptive protocols is complicated, and therefore we have considered building hybrid protocols that switch between specialized protocols. We show for which communication properties this is a correct solution, and classify these using a new concept called meta-properties. We also show how well these switches perform.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123580006","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918707
M.-L. Moschgath, J. Hähner, R. Reinema
The paper presents our ongoing research on the potentials of ubiquitous technologies for future workspaces. The Sm@rtLibrary serves as a test and demonstration environment for ubiquitous technologies and their application. In this area we are currently concentrating on localization and location management technologies, context-dependent services, platform and device independent access to the services and information provided in such environments. In Sm@rtLibrary, an employee or visitor enters the library. This is automatically sensed by the room. The library user takes one of the freely available Sm@rtAssistants, which is a flexible Webpad with an integrated radio based identification device (so-called RFID-reader) and has wireless access to the local network (by using wireless LAN or Bluetooth). By approaching the Sm@rtAssistant with his/her digital office ID card, the Webpad's user interface is personalized automatically to the needs and preferences of the user and his possibilities based on his current location. Within the Sm@rtLibrary, the user might want the library to meet one of various requirements which are outlined.
{"title":"Sm@rtLibrary - an infrastructure for ubiquitous technologies and applications","authors":"M.-L. Moschgath, J. Hähner, R. Reinema","doi":"10.1109/CDCS.2001.918707","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918707","url":null,"abstract":"The paper presents our ongoing research on the potentials of ubiquitous technologies for future workspaces. The Sm@rtLibrary serves as a test and demonstration environment for ubiquitous technologies and their application. In this area we are currently concentrating on localization and location management technologies, context-dependent services, platform and device independent access to the services and information provided in such environments. In Sm@rtLibrary, an employee or visitor enters the library. This is automatically sensed by the room. The library user takes one of the freely available Sm@rtAssistants, which is a flexible Webpad with an integrated radio based identification device (so-called RFID-reader) and has wireless access to the local network (by using wireless LAN or Bluetooth). By approaching the Sm@rtAssistant with his/her digital office ID card, the Webpad's user interface is personalized automatically to the needs and preferences of the user and his possibilities based on his current location. Within the Sm@rtLibrary, the user might want the library to meet one of various requirements which are outlined.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838098","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918736
Ying-Hong Wang
The spatial relation model is an important technique for image indexing and retrieval in image or multimedia databases. 2D strings and its variants are proposed to support the representation of spatial relationships. A novel spatial knowledge representation model named "Two Dimension Begin-End boundary string" (2D B/spl epsi/-string) is proposed. The 2D B/spl epsi/-string represents an icon by its MBR boundaries. By applying a number of "dummy objects", the 2D B/spl epsi/-string can intuitively and naturally represent the pictorial spatial information without any spatial operator. In addition, an image similarity evaluation method based on the modified "Longest Common Subsequence" (LCS) algorithm is presented. By using the proposed evaluation method, not only can those images for which all the icons and their spatial relationships fully agree with the query image be sifted out, but also those images whose partial icons and/or spatial relationships are similar to the query image. It resolves the problems of query targets and/or spatial relationships not being certain. Our representation model and similarity evaluation also simplify the retrieval progress of linear transformations, including image rotation and reflection.
{"title":"Image indexing and similarity retrieval based on a new spatial relation model","authors":"Ying-Hong Wang","doi":"10.1109/CDCS.2001.918736","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918736","url":null,"abstract":"The spatial relation model is an important technique for image indexing and retrieval in image or multimedia databases. 2D strings and its variants are proposed to support the representation of spatial relationships. A novel spatial knowledge representation model named \"Two Dimension Begin-End boundary string\" (2D B/spl epsi/-string) is proposed. The 2D B/spl epsi/-string represents an icon by its MBR boundaries. By applying a number of \"dummy objects\", the 2D B/spl epsi/-string can intuitively and naturally represent the pictorial spatial information without any spatial operator. In addition, an image similarity evaluation method based on the modified \"Longest Common Subsequence\" (LCS) algorithm is presented. By using the proposed evaluation method, not only can those images for which all the icons and their spatial relationships fully agree with the query image be sifted out, but also those images whose partial icons and/or spatial relationships are similar to the query image. It resolves the problems of query targets and/or spatial relationships not being certain. Our representation model and similarity evaluation also simplify the retrieval progress of linear transformations, including image rotation and reflection.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336995","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918709
T. Kanter
Personal mobile communication services are no longer limited by connection-oriented network access to the services that network service nodes are able to offer. Given the ability to deliver services using end-to-end IP connectivity-notably over wireless links-will cause services to move out to the mobile end-devices. In addition, IP enables us to use multiple services over the same link. Consequently, we need ways to enable the end-devices to deal with the greater degrees of freedom, when our personal communication allows us to use any combination of services that may be running in other end-devices. With short-range radio links, our need to make use of and deal with spontaneous connectivity increases even further. In this paper, a novel eXtensible Service Protocol (XSP) is described. After examining its properties, the paper looks at how it can enable ad-hoc mobile applications, as well as enabling adapting applications to the conditions and context of the communication.
{"title":"An eXtensible Service Protocol for adaptive personal mobile communication","authors":"T. Kanter","doi":"10.1109/CDCS.2001.918709","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918709","url":null,"abstract":"Personal mobile communication services are no longer limited by connection-oriented network access to the services that network service nodes are able to offer. Given the ability to deliver services using end-to-end IP connectivity-notably over wireless links-will cause services to move out to the mobile end-devices. In addition, IP enables us to use multiple services over the same link. Consequently, we need ways to enable the end-devices to deal with the greater degrees of freedom, when our personal communication allows us to use any combination of services that may be running in other end-devices. With short-range radio links, our need to make use of and deal with spontaneous connectivity increases even further. In this paper, a novel eXtensible Service Protocol (XSP) is described. After examining its properties, the paper looks at how it can enable ad-hoc mobile applications, as well as enabling adapting applications to the conditions and context of the communication.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117338489","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918685
Kate Jenkins, A. Demers
When faced with the problem of broadcasting a message reliably, there are tradeoffs to be made in terms of scalability, the ability to provide delivery guarantees in the face of node and link failures, per-machine message overhead, and time to delivery. Common approaches include reliable multicast, gossip-based protocols, and constrained flooding on superimposed communication graphs. Recent work has presented a new parameterized family of communication graphs that provide an explicit tradeoff between strength of delivery guarantees and reduced message overhead. We present a modified family of communication graphs that still provide this tradeoff between reliability and message overhead, but which also have the added benefit of dissemination time that is logarithmic in the size of the network.
{"title":"Logarithmic Harary graphs","authors":"Kate Jenkins, A. Demers","doi":"10.1109/CDCS.2001.918685","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918685","url":null,"abstract":"When faced with the problem of broadcasting a message reliably, there are tradeoffs to be made in terms of scalability, the ability to provide delivery guarantees in the face of node and link failures, per-machine message overhead, and time to delivery. Common approaches include reliable multicast, gossip-based protocols, and constrained flooding on superimposed communication graphs. Recent work has presented a new parameterized family of communication graphs that provide an explicit tradeoff between strength of delivery guarantees and reduced message overhead. We present a modified family of communication graphs that still provide this tradeoff between reliability and message overhead, but which also have the added benefit of dissemination time that is logarithmic in the size of the network.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115276762","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918699
E. Truyen, B. Vanhaute, W. Joosen, P. Verbaeten, B. Jørgensen
Support for dynamic and client-specific customization of distributed services is required in many application areas. We present a distributed service as consisting of minimal functional core, implemented as a component based system, and an unbound set of potential extensions that can be selectively integrated within this core functionality. An extension to this core may be a new service, due to new requirements of end users. Another important category of extensions we consider are non-functional services such as authentication, which typically introduce interaction refinements at the application level. Each extension is implemented us a layer of decorator-like wrappers. The novelty of this work is that the composition logic, responsible for integrating extensions into the core system, is completely separated from the code of the core system, extensions and clients as well. Clients (end users, system integrators) can customize this composition logic dynamically on a per interaction basis by attaching extension identifiers to their interactions with the core system.
{"title":"A dynamic customization model for distributed component-based systems","authors":"E. Truyen, B. Vanhaute, W. Joosen, P. Verbaeten, B. Jørgensen","doi":"10.1109/CDCS.2001.918699","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918699","url":null,"abstract":"Support for dynamic and client-specific customization of distributed services is required in many application areas. We present a distributed service as consisting of minimal functional core, implemented as a component based system, and an unbound set of potential extensions that can be selectively integrated within this core functionality. An extension to this core may be a new service, due to new requirements of end users. Another important category of extensions we consider are non-functional services such as authentication, which typically introduce interaction refinements at the application level. Each extension is implemented us a layer of decorator-like wrappers. The novelty of this work is that the composition logic, responsible for integrating extensions into the core system, is completely separated from the code of the core system, extensions and clients as well. Clients (end users, system integrators) can customize this composition logic dynamically on a per interaction basis by attaching extension identifiers to their interactions with the core system.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130584093","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918752
Jinho Ahn, C. Hwang
We first identify some problems occurring in the case where a traditional causal message logging approach for distributed systems is used as a fault-tolerance technique for mobile nodes in Mobile IP based systems. Then, we present a new causal message logging protocol with independent checkpointing for efficiently handling several constraints of mobile nodes such as: mobility and disconnection, limited life of battery power, small amount of storage and low bandwidth on wireless link. Moreover, the protocol can considerably reduce the number of additional messages and forced checkpoints needed when garbage collecting the log information of mobile nodes compared with previous causal message logging protocols.
{"title":"Low-cost fault-tolerance for mobile nodes in mobile IP based systems","authors":"Jinho Ahn, C. Hwang","doi":"10.1109/CDCS.2001.918752","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918752","url":null,"abstract":"We first identify some problems occurring in the case where a traditional causal message logging approach for distributed systems is used as a fault-tolerance technique for mobile nodes in Mobile IP based systems. Then, we present a new causal message logging protocol with independent checkpointing for efficiently handling several constraints of mobile nodes such as: mobility and disconnection, limited life of battery power, small amount of storage and low bandwidth on wireless link. Moreover, the protocol can considerably reduce the number of additional messages and forced checkpoints needed when garbage collecting the log information of mobile nodes compared with previous causal message logging protocols.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130637135","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 : 2001-04-16DOI: 10.1109/CDCS.2001.918687
A. Fekete, I. Keidar
We present a framework for building highly available services. The framework uses group communication to coordinate a collection of servers. Our framework is configurable, in that one can adjust parameters such as the number of servers and the extent to which they are synchronized. We analyze the scenarios that can lead to the service availability being temporarily compromised, and we discuss the tradeoffs that govern the choice of parameters.
{"title":"A framework for highly available services based on group communication","authors":"A. Fekete, I. Keidar","doi":"10.1109/CDCS.2001.918687","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918687","url":null,"abstract":"We present a framework for building highly available services. The framework uses group communication to coordinate a collection of servers. Our framework is configurable, in that one can adjust parameters such as the number of servers and the extent to which they are synchronized. We analyze the scenarios that can lead to the service availability being temporarily compromised, and we discuss the tradeoffs that govern the choice of parameters.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133030550","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
扫码关注我们
求助内容：
应助结果提醒方式：