发布求助
文献互助 智能选刊 最新文献

26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)最新文献

筛选
英文 中文
Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks 稀疏无线多跳网络连通性度量的表征
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.28
Srinath Perur, S. Iyer
{"title":"Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks","authors":"Srinath Perur, S. Iyer","doi":"10.1109/ICDCSW.2006.28","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.28","url":null,"abstract":"The extent to which a wireless multi-hop network is connected is usually measured by the probability that all the nodes form a single connected component. We jind this measure, called connectivity, unsuitable for use with sparse networks since it is not indicative of the actual communication capability of the network, and can be unresponsive to changes in network parameters. An alternate connectivity measure that wejnd useful in sparse networks is the fraction of node pairs in the network that are connected. We call this term reachability and claim that it is more intuitive and expressive than connectivity when dealing with sparse networks. We identify reachability as growing according to the logistic growth model and present a regression model for reachability in terms of number of nodes and normalized transmission range. This can be used by a network designer to estimate the tradeoff between how connected the network is, the number of nodes, the area of operation, and transmission range of nodes.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115479963","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}
引用次数: 18
The Power of the Defender 守护者的力量
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.107
Marina Gelastou, M. Mavronicolas, V. P. Lesta, A. Philippou, P. Spirakis
{"title":"The Power of the Defender","authors":"Marina Gelastou, M. Mavronicolas, V. P. Lesta, A. Philippou, P. Spirakis","doi":"10.1109/ICDCSW.2006.107","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.107","url":null,"abstract":"We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the system. However, due to the network’s size, economic and performance reasons, it is capable to provide safety, i.e. clean nodes from the possible presence of attackers, only to a limited part of it. The objective of the defender is to place itself in such a way as to maximize the number of attackers caught, while each attacker aims not to be caught. In [7], a basic case of this problem was modeled as a non-cooperative game, called the Edge model. There, the defender could protect a single link of the network. Here, we consider a more general case of the problem where the defender is able to scan and protect a set of k links of the network, which we call the Tuple model. It is natural to expect that this increased power of the defender should result in a better quality of protection for the network. Ideally, this would be achieved at little expense on the existence and complexity of Nash equilibria (profiles where no entity can improve its local objective unilaterally by switching placements on the network). In this paper we study pure and mixed Nash equilibria in the model. In particular, we propose algorithms for computing such equilibria in polynomial time and we provide a polynomial-time transformation of a special class of Nash equilibria, called matching equilibria, between the Edge model and the Tuple model, and vice versa. Finally, we establish that the increased power of the defender results in higher-quality protection of the network.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115843817","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}
引用次数: 16
Enhanced PCF Protocols for Real-time Multimedia Services over 802.11 Wireless Networks 802.11无线网络上实时多媒体业务的增强PCF协议
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.46
Ming-Chuan Hsu, Yaw-Chung Chen
{"title":"Enhanced PCF Protocols for Real-time Multimedia Services over 802.11 Wireless Networks","authors":"Ming-Chuan Hsu, Yaw-Chung Chen","doi":"10.1109/ICDCSW.2006.46","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.46","url":null,"abstract":"In wireless network environment, different traffic classes exhibit a variety of characteristics and service requirements [4,5,7], such as data rate, maximum tolerable packet error rate and delay bounds. Although IEEE 802.11e [9,10] addresses the QoS issues and classifies the traffic into four prioritized access categories, there is still no guarantee of real-time transmission service due to the lack of an effective coordinating mechanism [11] among contending clients and a satisfactory scheduling method for various delay-sensitive packets from multiple traffic flows. In this work, we propose a nearly complete polling list solution to IEEE 802.11 WLAN by enhancing the original PCF protocol with better demand assignment features. A flexible and fair polling list method among the various time bounds is investigated in the proposed scheme. The performance evaluation based on NS-2 network simulator [12,13] shows that our schemes are well suited for variable bit rate service in real-time multimedia applications.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131602459","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}
引用次数: 12
Study of Server Workload in Large Online Newspaper 大型网络报纸服务器负载的研究
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.104
Zeljko Vrba, T. Plagemann, V. Goebel, X. G. Pañeda
{"title":"Study of Server Workload in Large Online Newspaper","authors":"Zeljko Vrba, T. Plagemann, V. Goebel, X. G. Pañeda","doi":"10.1109/ICDCSW.2006.104","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.104","url":null,"abstract":"In this paper we present an analysis of access traces from a large online newspaper offering both web and Video-on- Demand service. We have analyzed the lifetime of news articles, their popularity, server load, session interactivity, the working set of servers, and the correlation of the number of web and streaming accesses within a session. The results are interpreted in the context of designing a content distribution network targeted at News-on-Demand applications. We show that all of the requested web and streaming content could fit in the main memory of a low-end server.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117372","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}
引用次数: 3
On The Accuracy of Event Distribution Lists for Publish/Subscribe in Dynamic Distributed Systems 动态分布式系统中发布/订阅事件分布表的准确性研究
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.78
R. Baldoni, G. Cortese, F. Morabito, Leonardo Querzoni, S. Piergiovanni, A. Virgillito
{"title":"On The Accuracy of Event Distribution Lists for Publish/Subscribe in Dynamic Distributed Systems","authors":"R. Baldoni, G. Cortese, F. Morabito, Leonardo Querzoni, S. Piergiovanni, A. Virgillito","doi":"10.1109/ICDCSW.2006.78","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.78","url":null,"abstract":"The advent of very large scale distributed applications in the form of peer-to-peer systems, introduced new problems caused by their intrinsic dynamic behavior (i.e., nodes continuously joining and leaving the system). Such problems inhibit the usage of many techniques developed for quasi-static distributed systems. In this paper we analyze the behavior of a simple subscription-flooding based algorithm for publish/ subscribe in a highly dynamic environment. Specifically we define the problem of keeping a list of processes matching a given event (Event Distribution List) complete and accurate. We propose a simple variant of the subscription flooding approach, introducing expiration of subscriptions and their periodic refresh, and show how it can maintain accurate and complete EDLs in a dynamic distributed system.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123206439","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
Architecture for Providing Services in the Ubiquitous Computing Environment 泛在计算环境中提供服务的体系结构
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.19
G. Kunito, Kenji Sakamoto, Naoharu Yamada, Tatsuo Takakashi, Satoshi Tanaka
{"title":"Architecture for Providing Services in the Ubiquitous Computing Environment","authors":"G. Kunito, Kenji Sakamoto, Naoharu Yamada, Tatsuo Takakashi, Satoshi Tanaka","doi":"10.1109/ICDCSW.2006.19","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.19","url":null,"abstract":"Computing and telecommunications are maturing, and Ubiquitous computing has become quite interesting as a new environment in which to seek new services. The goal of Ubiquitous computing is the enhancement of computer utilization by making many computers available throughout the physical environment, but making them effectively invisible to the user. The goal of services in the ubiquitous environment is not making either services or appliances the center of attention, but rather enhancing users’ lives in an unobtrusive manner. In the ubiquitous computing environment, services should be triggered by environmental situations instead of user’s explicit actions. This paper analyzes the triggers needed to provide services from the viewpoint of time, location and objects, shows an architecture to achieve services in the ubiquitous computing environment, and presents a prototype of the real world model for the service platform.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121770441","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}
引用次数: 13
Quality Composition in Web-Service Design web服务设计中的质量组成
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.87
M. Comerio, F. D. Paoli, S. Grega
{"title":"Quality Composition in Web-Service Design","authors":"M. Comerio, F. D. Paoli, S. Grega","doi":"10.1109/ICDCSW.2006.87","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.87","url":null,"abstract":"Modern software components are asked to deliver their services over different communication channels and devices to support mobile and ubiquitous applications. Therefore, development processes that traditionally address only functional requirements must be revised by considering new aspects: quality of service (QoS), user profiles and technical characteristics of channels. Moreover, services obtained by the composition of simple services offered by different providers are getting growing importance. In this paper, we propose a hybrid technique to deal with quality evaluation in composite Web Service design. This work extends and integrates the single-service design process presented in previous papers.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116308383","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}
引用次数: 1
Handling Overload in Publish/Subscribe Systems 在发布/订阅系统中处理过载
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.59
Zbigniew Jerzak, C. Fetzer
{"title":"Handling Overload in Publish/Subscribe Systems","authors":"Zbigniew Jerzak, C. Fetzer","doi":"10.1109/ICDCSW.2006.59","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.59","url":null,"abstract":"A new approach for handling overload in Publish/ Subscribe systems is presented. We address the issues of how to cope (1) with the limitations imposed by the external environment (e.g., network congestion or link failures) and (2) the limitations resulting directly from within the service itself (e.g., high message load). These two issues are handled in a graceful way while ensuring that the most valuable information is given the highest chance of a successful delivery.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123474467","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}
引用次数: 16
Decentralized Electronic Mail 分散的电子邮件
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.39
S. Bercovici, I. Keidar, A. Tal
{"title":"Decentralized Electronic Mail","authors":"S. Bercovici, I. Keidar, A. Tal","doi":"10.1109/ICDCSW.2006.39","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.39","url":null,"abstract":"E-mail is one of the most popular Internet applications. Unfortunately, the server-centric architecture of today’s commercial solutions inherently limits availability, efficiency, and scalability. The single point of failure as well as the increasing processing and storage stress on the server drives the 35 year old architecture to the limits of its abilities. This paper proposes decentralized electronic mail (DEM), a novel e-mail architecture that overcomes existing systems’ shortcomings. Following the mobile-object paradigm, DEM offers a decentralized approach, which breaks the dependency between a mail user and a single service provider, while relying entirely on participants’ resources.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122439308","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}
引用次数: 7
WS-Auction: Mechanism Design for aWeb Services Market web服务拍卖:web服务市场的机制设计
26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) Pub Date : 2006-07-04 DOI: 10.1109/ICDCSW.2006.116
Tiberiu Stef-Praun, V. Rego
{"title":"WS-Auction: Mechanism Design for aWeb Services Market","authors":"Tiberiu Stef-Praun, V. Rego","doi":"10.1109/ICDCSW.2006.116","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.116","url":null,"abstract":"As distributed systems become more complex in terms of the functionality and heterogeneity of their components, the ownership of those components becomes an issue in the allocation phase of the system design. The mechanism design community has addressed the allocation problem in an efficient, truthful, strategyproof way in several settings such as combinatorial auctions, on-line auctions, distributed allocation computation or information elicitation. We are extending the scope of mechanism design by shifting the focus from efficient individual allocations to systemwide efficient allocations. In this setting, we are addressing the spatial and temporal fragmentation of the information characteristic to a distributed market. This paper shows that the necessary mechanism for obtaining an efficient outcome in a distributed market is an indirect auction with provisional allocation and historical information. We also suggest and evaluate the bidding strategy in such an environment, and we show that the truthful strategy is to bid the true valuation at the arrival time in the system.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128379814","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信