Pub Date : 2005-12-19DOI: 10.1109/COLCOM.2005.1651214
D. Fahrenholtz, A. Wombacher
P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additional communication. A formal model of this additional communication is introduced and evaluated based on a hypercube-based P2P data store
{"title":"A formal communication model for lookup operations in a hypercube-based P2P data store","authors":"D. Fahrenholtz, A. Wombacher","doi":"10.1109/COLCOM.2005.1651214","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651214","url":null,"abstract":"P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additional communication. A formal model of this additional communication is introduced and evaluated based on a hypercube-based P2P data store","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292876","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651244
S. Xia, David Sun, Chengzheng Sun, David Chen
Telepointers are a real-time groupware interface feature to indicate where other users are pointing. None of existing telepointer techniques, however, is capable of tracking the reference object and preserving the relative position in the face of dynamic content and view changes in real-time collaborative document editing systems. In this paper, we report a novel object-associated telepointer (OAT) technique with the following features in the face of dynamic content and view changes: (1) relocating telepointers to track the reference object; (2) preserving the position relative to the reference object; and (3) providing feedback of the telepointer relocation to the local user with a virtual local cursor. The key technique for supporting OAT is to extend the operational transformation technique with a generic Refer operation to support adjusting the reference object position. The OAT technique has been implemented in the CoWord system based on the transparent adaptation approach so that it can provide the OAT support to a range of realtime collaborative applications
{"title":"Object-associated telepointer for real-time collaborative document editing systems","authors":"S. Xia, David Sun, Chengzheng Sun, David Chen","doi":"10.1109/COLCOM.2005.1651244","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651244","url":null,"abstract":"Telepointers are a real-time groupware interface feature to indicate where other users are pointing. None of existing telepointer techniques, however, is capable of tracking the reference object and preserving the relative position in the face of dynamic content and view changes in real-time collaborative document editing systems. In this paper, we report a novel object-associated telepointer (OAT) technique with the following features in the face of dynamic content and view changes: (1) relocating telepointers to track the reference object; (2) preserving the position relative to the reference object; and (3) providing feedback of the telepointer relocation to the local user with a virtual local cursor. The key technique for supporting OAT is to extend the operational transformation technique with a generic Refer operation to support adjusting the reference object position. The OAT technique has been implemented in the CoWord system based on the transparent adaptation approach so that it can provide the OAT support to a range of realtime collaborative applications","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123768912","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651267
Anwitaman Datta, M. Hasler, K. Aberer
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a mean value analysis (MVA), where the evolution of the mean state is studied assuming that the system always actually resides in the mean state; (ii) The second approach looks at the probability distribution function of the system states at any time instance, thus studying the evolution of the (probability mass) distribution function (EoDF)
{"title":"Stochasticity of probabilistic systems: analysis methodologies case-study","authors":"Anwitaman Datta, M. Hasler, K. Aberer","doi":"10.1109/COLCOM.2005.1651267","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651267","url":null,"abstract":"We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a mean value analysis (MVA), where the evolution of the mean state is studied assuming that the system always actually resides in the mean state; (ii) The second approach looks at the probability distribution function of the system states at any time instance, thus studying the evolution of the (probability mass) distribution function (EoDF)","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115532090","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651251
Rui Li, Du Li
Commutativity of operations is often exploited in concurrent systems to attain high levels of concurrency. A commutativity-based concurrency control method, called operational transformation (OT), has been actively researched in groupware over the past 15 years. However, much progress can still be made on more practicable approaches to developing and proving OT algorithms. Several constraints have been proposed previously but they are generally difficult to follow and verify in practice. This paper proposes an alternative approach to address this problem. A new consistency model is defined which greatly simplifies the design and proof of OT algorithms
{"title":"Commutativity-based concurrency control in groupware","authors":"Rui Li, Du Li","doi":"10.1109/COLCOM.2005.1651251","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651251","url":null,"abstract":"Commutativity of operations is often exploited in concurrent systems to attain high levels of concurrency. A commutativity-based concurrency control method, called operational transformation (OT), has been actively researched in groupware over the past 15 years. However, much progress can still be made on more practicable approaches to developing and proving OT algorithms. Several constraints have been proposed previously but they are generally difficult to follow and verify in practice. This paper proposes an alternative approach to address this problem. A new consistency model is defined which greatly simplifies the design and proof of OT algorithms","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116420259","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651249
Siddhartha Bose, A. Ennai, Subodh Sohi
Typical collaborations are composed of multiple interactions between people, who may participate from different geographical locations, and may use different devices, modalities and services. For mobile enterprise users, the availability of complete collaboration context, i.e. collaboration information with correlation between artifacts (data and services), at all times, whether they are online or offline, is essential for real-time response to business needs. Available collaboration solutions do not allow complete automatic creation of such contexts. In addition, solutions that support offline access to such context use a local replica of the server on the client, which is cumbersome and is not feasible for all types of mobile devices. The paper proposes a light-weight, portable format for representing collaboration contexts, and enabling offline access to them using disparate devices, without using any local server. It also proposes a conceptual system that uses information, represented in this format, to activate collaborations from any device
{"title":"Portable enterprise collaboration contexts","authors":"Siddhartha Bose, A. Ennai, Subodh Sohi","doi":"10.1109/COLCOM.2005.1651249","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651249","url":null,"abstract":"Typical collaborations are composed of multiple interactions between people, who may participate from different geographical locations, and may use different devices, modalities and services. For mobile enterprise users, the availability of complete collaboration context, i.e. collaboration information with correlation between artifacts (data and services), at all times, whether they are online or offline, is essential for real-time response to business needs. Available collaboration solutions do not allow complete automatic creation of such contexts. In addition, solutions that support offline access to such context use a local replica of the server on the client, which is cumbersome and is not feasible for all types of mobile devices. The paper proposes a light-weight, portable format for representing collaboration contexts, and enabling offline access to them using disparate devices, without using any local server. It also proposes a conceptual system that uses information, represented in this format, to activate collaborations from any device","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122339470","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651221
S. Pandey, P. Prasad, P. Sinha, P. Agrawal
Localization in sensor networks is a prerequisite for associating the sensed phenomenon to a particular location. Various aspects of sensor network localization have recently been studied. However, amongst the vast number of localization schemes proposed, tradeoff between the energy required for localization and resulting accuracy of localization is not addressed. In a highly resource-constrained environment such as a sensor network, it is important to address the above energy accuracy relationship during the localization process. Network lifetime is enhanced by applying energy-aware localization schemes periodically. In this paper, a localization algorithm is presented which transforms the network into a system of springs. Using optimization techniques the stable state of such a system is determined, which yields the locations of the nodes in the network. The energy accuracy tradeoff obtained from the algorithm is studied using MATLAB simulations. Results for a centralized and distributed implementation of the scheme are presented.
{"title":"Localization of sensor networks considering energy accuracy tradeoffs","authors":"S. Pandey, P. Prasad, P. Sinha, P. Agrawal","doi":"10.1109/COLCOM.2005.1651221","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651221","url":null,"abstract":"Localization in sensor networks is a prerequisite for associating the sensed phenomenon to a particular location. Various aspects of sensor network localization have recently been studied. However, amongst the vast number of localization schemes proposed, tradeoff between the energy required for localization and resulting accuracy of localization is not addressed. In a highly resource-constrained environment such as a sensor network, it is important to address the above energy accuracy relationship during the localization process. Network lifetime is enhanced by applying energy-aware localization schemes periodically. In this paper, a localization algorithm is presented which transforms the network into a system of springs. Using optimization techniques the stable state of such a system is determined, which yields the locations of the nodes in the network. The energy accuracy tradeoff obtained from the algorithm is studied using MATLAB simulations. Results for a centralized and distributed implementation of the scheme are presented.","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114507313","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651253
A. Krishnakumar, P. Krishnan
Location estimation enables many innovative applications and is an exciting area of research. With the growing use of wireless technology in enterprise networks, it is an interesting technical challenge to develop techniques for indoor location estimation that leverage the deployed wireless infrastructure. Elegant, cost-effective techniques would present a compelling business proposition. In this paper, we summarize various approaches researchers have studied for the problem of indoor location estimation, concentrating on signal-strength based techniques directed towards 802.11 wireless networks. We also summarize an interesting insight into the best possible accuracy achievable by any technique due to limits imposed by the physical behavior of the radio signal. We identify that the issues driving research work in this area will not only be location accuracy, but other factors like deployment ease, management simplicity, adaptability, and cost of ownership and maintenance. We conclude with some open research problems in this area
{"title":"The theory and practice of signal strength-based location estimation","authors":"A. Krishnakumar, P. Krishnan","doi":"10.1109/COLCOM.2005.1651253","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651253","url":null,"abstract":"Location estimation enables many innovative applications and is an exciting area of research. With the growing use of wireless technology in enterprise networks, it is an interesting technical challenge to develop techniques for indoor location estimation that leverage the deployed wireless infrastructure. Elegant, cost-effective techniques would present a compelling business proposition. In this paper, we summarize various approaches researchers have studied for the problem of indoor location estimation, concentrating on signal-strength based techniques directed towards 802.11 wireless networks. We also summarize an interesting insight into the best possible accuracy achievable by any technique due to limits imposed by the physical behavior of the radio signal. We identify that the issues driving research work in this area will not only be location accuracy, but other factors like deployment ease, management simplicity, adaptability, and cost of ownership and maintenance. We conclude with some open research problems in this area","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130735199","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651229
Zebin Chen, S. Fickas
Our GO (www.go-outside.org) project focuses on community access for the cognitively impaired population. In addition to devising new facilities, we are interested in using existing appliances found in an apartment to interact with a user to help with a specific task, e.g., making a trip to the doctor. This requires establishment of collaboration protocols between the appliances (and smart agents) and user to be established. These protocols must enforce certain safety properties, e.g., that the user get timely information to start a task. We will show how we use a light-weight formal modeling toolkit to reason about a protocol's ability to meet safety properties
{"title":"The plain old television in a smart apartment","authors":"Zebin Chen, S. Fickas","doi":"10.1109/COLCOM.2005.1651229","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651229","url":null,"abstract":"Our GO (www.go-outside.org) project focuses on community access for the cognitively impaired population. In addition to devising new facilities, we are interested in using existing appliances found in an apartment to interact with a user to help with a specific task, e.g., making a trip to the doctor. This requires establishment of collaboration protocols between the appliances (and smart agents) and user to be established. These protocols must enforce certain safety properties, e.g., that the user get timely information to start a task. We will show how we use a light-weight formal modeling toolkit to reason about a protocol's ability to meet safety properties","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116093652","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651226
Kai Lin, David Chen, R. Dromey, Chengzheng Sun
Multi-way dataflow constraints are very useful in the development of collaborative applications, such as collaborative CAD and CASE systems, but satisfying multi-way dataflow constraints in the presence of concurrency in collaborative systems is difficult. In this article, we discuss the issues and techniques in maintaining multi-way dataflow constraints in concurrent environments. In particular, we also proposed a novel strategy that is able to reconstruct computation flows to satisfy multi-way dataflow constraints according to concurrent user operations in collaborative systems. Our strategy ensures both constraint satisfaction and system consistency, which is independent of the execution orders of concurrent operations
{"title":"Maintaining multi-way dataflow constraints in collaborative systems","authors":"Kai Lin, David Chen, R. Dromey, Chengzheng Sun","doi":"10.1109/COLCOM.2005.1651226","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651226","url":null,"abstract":"Multi-way dataflow constraints are very useful in the development of collaborative applications, such as collaborative CAD and CASE systems, but satisfying multi-way dataflow constraints in the presence of concurrency in collaborative systems is difficult. In this article, we discuss the issues and techniques in maintaining multi-way dataflow constraints in concurrent environments. In particular, we also proposed a novel strategy that is able to reconstruct computation flows to satisfy multi-way dataflow constraints according to concurrent user operations in collaborative systems. Our strategy ensures both constraint satisfaction and system consistency, which is independent of the execution orders of concurrent operations","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"339 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123319541","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651212
Lakshmish Ramaswamy, Jianxia Chen
The exponential growth of dynamic Web content has posed serious challenges to the scalability of the World Wide Web. While caching on the edge of the Internet has emerged as a popular technique to address these challenges, many of the present-day edge caching systems do not harness the complete benefits of edge computing. Our research efforts in the cooperative edge cache grid project are aimed at utilizing collaboration among edge caches as a means to further enhance the capabilities and the performance of edge cache network. This paper outlines the cooperative EC grid project including its architecture, fundamental concepts, and various techniques that have been designed for supporting low-cost cooperation among the edge caches
{"title":"Efficient delivery of dynamic content: the cooperative EC grid project","authors":"Lakshmish Ramaswamy, Jianxia Chen","doi":"10.1109/COLCOM.2005.1651212","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651212","url":null,"abstract":"The exponential growth of dynamic Web content has posed serious challenges to the scalability of the World Wide Web. While caching on the edge of the Internet has emerged as a popular technique to address these challenges, many of the present-day edge caching systems do not harness the complete benefits of edge computing. Our research efforts in the cooperative edge cache grid project are aimed at utilizing collaboration among edge caches as a means to further enhance the capabilities and the performance of edge cache network. This paper outlines the cooperative EC grid project including its architecture, fundamental concepts, and various techniques that have been designed for supporting low-cost cooperation among the edge caches","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123413515","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
扫码关注我们
求助内容：
应助结果提醒方式：