2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing最新文献_第3页

Dynamic virtual organization management for service oriented enterprise applications 面向服务的企业应用的动态虚拟组织管理

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651252

P. Robinson, Yücel Karabulut, J. Haller

引用次数: 23

"Token" equilibria in sensor networks with multiple sponsors 多发起者传感器网络中的“令牌”均衡

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651265

David A. Miller, S. Tilak, T. Fountain

引用次数: 25

Symbiotic multi-path routing with attractor selection 具有吸引子选择的共生多路径路由

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651261

K. Leibnitz, N. Wakamiya, M. Murata

引用次数: 2

Collaborative Computing: Issues and Challenges 协同计算:问题与挑战

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651224

Ling Liu

引用次数: 0

Brownian gossip: exploiting node mobility to diffuse information in ad hoc networks 布朗八卦:利用节点移动性在自组织网络中传播信息

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651262

Romit Roy Choudhury

{"title":"Brownian gossip: exploiting node mobility to diffuse information in ad hoc networks","authors":"Romit Roy Choudhury","doi":"10.1109/COLCOM.2005.1651262","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651262","url":null,"abstract":"Several network services, including routing, resource-discovery, etc., require the knowledge of a node's location, before invoking their respective algorithms. Locating a node is a challenging problem in large-scale ad hoc networks, especially when the nodes are mobile. Initial approaches to learn a node's location relied on flooding a query in the network. In view of the large overheads of flooding, gossiping was later proposed as a scalable alternative. With gossiping, each node probabilistically forwards the query. Research findings show that for carefully chosen gossip probabilities, the query is very likely to reach the destination. While gossiping is a random propagation of a specific information, a similar effect might be achieved if nodes move randomly carrying the same information in their local caches. Thus, a node's location information can diffuse into the network via node mobility, as opposed to wireless transmissions that incur bandwidth. If these mobile nodes lend their caches to be queried by its neighborhood, a distributed location estimation service can be envisioned. Clearly, wireless transmission and physical mobility appear to be two modes of information transportation. While each have been studied individually, there has been little work on the possibility of combining them. For example, mobile nodes that gossip with each other periodically, may achieve percolation at significantly lower overheads. This paper investigates the combined potential of gossip and random (Brownian) node mobility. We argue that using such a combined strategy, it might be possible to design a scalable location service for mobile networks, over which several other applications can be developed, including geographic routing, resource discovery, etc","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"12 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":"115356058","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}

引用次数: 21

Floor control alternatives for distributed videoconferencing over IP networks IP网络上分布式视频会议的楼层控制替代方案

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651241

J. Garcia-Luna-Aceves, P. Mantey, Sireesh N. Potireddy

{"title":"Floor control alternatives for distributed videoconferencing over IP networks","authors":"J. Garcia-Luna-Aceves, P. Mantey, Sireesh N. Potireddy","doi":"10.1109/COLCOM.2005.1651241","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651241","url":null,"abstract":"Applications that require the communication of multiple video streams can consume considerable bandwidth and computing resources, which poses a challenge for the widespread use of videoconferencing over the IP Internet. On the one hand, the bandwidth of the link connecting a given participant to a videoconferencing session may not be enough to support many video streams at bit rates of 500 kbps or more, especially when the participant is connecting to the rest of the Internet through a wireless link. On the other hand, the processing capacity of a participating site may not be enough to decode several video streams in real time. This paper explores the use of floor control over videoconferencing applications as a means to support videoconferences with many participating sites, but with a processing and communication overhead per site that is equivalent to a two-party videoconference. The main tradeoff we explore is the scalability attained with floor control versus the latencies incurred with floor transitions, which can be much too disruptive to the videoconference participants. We present a viable compromise in which only the video stream of the \"floor holder\" is sent to all sites, but the floor-passing protocol is such that it supports a brief overlap of the transmissions from the old and the new floor holder, such that the participants in the videoconference can instantaneously switch over to the media streams of the next speaker in an apparently seamless transition. Experimental results and implementation in a research video-conferencing system show that the proposed protocol can run effectively, eliminating race conditions, while maintaining scalability and reliability","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"8 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":"124974138","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}

引用次数: 2

Free riders under control through service differentiation in peer-to-peer systems 通过点对点系统中的服务差异化控制搭便车者

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651213

Loubna Mekouar, Y. Iraqi, R. Boutaba

{"title":"Free riders under control through service differentiation in peer-to-peer systems","authors":"Loubna Mekouar, Y. Iraqi, R. Boutaba","doi":"10.1109/COLCOM.2005.1651213","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651213","url":null,"abstract":"Trust is required in a file sharing peer-to-peer system to achieve better cooperation among peers. In reputation-based peer-to-peer systems, reputation is used to build trust among peers. In these systems, highly reputable peers will usually be selected to upload requested files, decreasing significantly malicious uploads in the system. However, these peers need to be motivated to upload files by increasing the benefits that they receive from the system. In addition, it is necessary to motivate free riders to contribute to the system by sharing files. Malicious peers must be forced to contribute positively by uploading authentic files instead of malicious ones. In this paper, the contribution behavior of the peer is used as a guideline for service differentiation. The new concept of availability is introduced for partially-decentralized peer-to-peer systems. Both availability and involvement of the peer are used to assess its contribution behavior. Simulation results confirm the ability of the proposed scheme to effectively identify both free riders and malicious peers and reduce the level of service provided to them. Simulation results also confirm that based on rational behavior, peers are motivated to increase their contribution to receive services. Moreover, using our scheme, peers must continuously participate, reducing significantly the so-called milking phenomenon","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":"125076374","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}

引用次数: 8

Performance evaluation of rating aggregation algorithms in reputation systems 信誉系统中评级聚合算法的性能评价

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651235

Zhengqiang Liang, Weisong Shi

引用次数: 20

Efficient event and query distribution in sensor networks 传感器网络中事件和查询的高效分配

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651246

Man-Hon Chan, K. Lui, V. Tam

{"title":"Efficient event and query distribution in sensor networks","authors":"Man-Hon Chan, K. Lui, V. Tam","doi":"10.1109/COLCOM.2005.1651246","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651246","url":null,"abstract":"A sensor network consists of a large number of sensors which are equipped with sensing, computation, and communication devices. Due to limitation in size, a sensor has only limited energy and storage. Traditional wireless network protocols cannot be applied in sensor networks directly. We study the distribution of events and queries in sensor networks. An event is something of interest detected by a sensor. A query is a request of information. A conventional approach to facilitate query nodes to acquire what they want is flooding. Nevertheless, flooding is not desirable in sensor networks due to the large number of nodes and limited energy in sensors. Recently, the concept of data-centric storage (DCS) is introduced where information of the same kind is kept in the same set of nodes. Queries can then be sent to these nodes for information retrievals. Theoretical analysis shows that this approach requires a lot fewer messages than the flooding approach when query frequencies are not high. Unfortunately, existing protocols based on DCS are prone to the hot-spot problem where some nodes have to handle lots of messages. In this paper, we present an efficient protocol for distributing events and queries in a location-aware sensor networks so that the load among nodes is more evenly distributed. We evaluate our protocol using simulations and the results show that our protocol successfully alleviates the hot-spot problem","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":"116287574","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}

引用次数: 11

Distributed on-line Bayesian search 分布式在线贝叶斯搜索

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2005-12-19 DOI: 10.1109/COLCOM.2005.1651263

Alfredo García, E. Campos-Náñez, Chenyang Li

引用次数: 2