23rd International Conference on Distributed Computing Systems, 2003. Proceedings.最新文献

筛选
英文 中文
Deliver multimedia streams with flexible QoS via a multicast DAG 通过多播DAG提供具有灵活QoS的多媒体流
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203459
Jiong Yang
{"title":"Deliver multimedia streams with flexible QoS via a multicast DAG","authors":"Jiong Yang","doi":"10.1109/ICDCS.2003.1203459","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203459","url":null,"abstract":"In this paper we investigate the problem of delivering real time multimedia streams in a MAN environment. Most research in this area presumes the scenario where all packets of a stream are transmitted along a single path from the sender to a receiver In this paper, we propose a new application layer multicast scheme, namely ROME, to better fulfill heterogeneous QoS requirements from various receivers simultaneously by setting up multiple paths. Instead of enforcing a multicast tree structure, a multicast DAG (Directed Acyclic Graph) is constructed in ROME, where multiple nodes in the multicast group may share the responsibility to deliver the stream to a node. To achieve this each stream is partitioned into a set of stream shares. A QoS oriented share assignment technique is proposed to distribute stream shares progressively among delivery paths to maximize the number of fulfilled clients while minimizing the overall bandwidth usage. Moreover, both the delivery paths and the stream partition can be adapted easily on the fly to accommodate multicast group membership change during the real time delivery. Last but not least, we evaluate our scheme via simulations and show that the proposed scheme can fulfill a larger number of clients with higher QoS requirements than existing approaches under the same network capacity.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129175083","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}
引用次数: 9
SmartNode: achieving 802.11 MAC interoperability in power-efficient ad hoc networks with dynamic range adjustments SmartNode:在具有动态范围调整的节能自组织网络中实现802.11 MAC互操作性
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203516
Edmond Poon, Baochun Li
{"title":"SmartNode: achieving 802.11 MAC interoperability in power-efficient ad hoc networks with dynamic range adjustments","authors":"Edmond Poon, Baochun Li","doi":"10.1109/ICDCS.2003.1203516","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203516","url":null,"abstract":"The standard CSMA/CA based IEEE 802.11 protocol assumes that each node uses a certain fixed (or maximum) transmission power for the transmission of each packet. However, a MAC protocol with power adjustments can have significant benefits towards better power conservation and higher system throughput through better spatial reuse of spectrum. In this work, we propose a power efficient MAC layer algorithm, SmartNode, that is compatible with the basic RTS-CTS-DATA-ACK MAC protocol defined in IEEE 802.11. Our algorithm uses the minimum required power level for the transmission of data packets, which requires special handling for the exchange of control packets. Compared with previously proposed power-controlled MAC protocols, our algorithm does not require multiple data channels at the physical layer so that it is able to inter-operate with regular nodes running the existing IEEE 802.11 MAC protocol. Through extensive performance evaluations, we have demonstrated that our proposed algorithm is effective in a power-controlled ad hoc network - it is able to increase system throughput while conserving power with dynamic power adjustments.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116282210","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}
引用次数: 23
Impact of data compression on energy consumption of wireless-networked handheld devices 数据压缩对无线联网手持设备能耗的影响
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203479
Rong-Chang Xu, Zhiyuan Li, Cheng Wang, Peifeng Ni
{"title":"Impact of data compression on energy consumption of wireless-networked handheld devices","authors":"Rong-Chang Xu, Zhiyuan Li, Cheng Wang, Peifeng Ni","doi":"10.1109/ICDCS.2003.1203479","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203479","url":null,"abstract":"We investigate the use of data compression to reduce the battery consumed by handheld devices when downloading data from proxy servers over a wireless LAN. To make a careful trade-off between the communication energy and the overhead to perform decompression, we experiment with three universal lossless compression schemes, using a popular handheld device in a wireless LAN environment and we find interesting facts. The results show that, from the battery-saving perspective, the gzip compression software (based on LZ77) to be far superior to bzip2 (based on BWT) and compress (based on LZW). We then present an energy model to estimate the energy consumption for the compressed downloading. With this model, we further reduce the energy cost of gzip by interleaving communication with computation and by using a block-by-block selective scheme based on the compression factor of each block. We also use a threshold file size below which the file is not to be compressed before transferring.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125461503","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}
引用次数: 67
Evaluating distributed checkpointing protocols 评估分布式检查点协议
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203475
A. Agbaria, Ari Freund, R. Friedman
{"title":"Evaluating distributed checkpointing protocols","authors":"A. Agbaria, Ari Freund, R. Friedman","doi":"10.1109/ICDCS.2003.1203475","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203475","url":null,"abstract":"This paper presents an objective measure, called overhead ratio, for evaluating distributed checkpointing protocols. This measure extends previous evaluation schemes by incorporating several additional parameters that are inherent in distributed environments. In particular, we take into account the rollback propagation of the protocol, which impacts the length of the recovery process, and therefore the expected program run-time in executions that involve failures and recoveries. The paper also analyzes several known protocols and compares their overhead ratio.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131615731","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
Experiences with monitoring OSPF on a regional service provider network 具有在区域服务提供商网络中监控OSPF的经验
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203467
D. Watson, F. Jahanian, C. Labovitz
{"title":"Experiences with monitoring OSPF on a regional service provider network","authors":"D. Watson, F. Jahanian, C. Labovitz","doi":"10.1109/ICDCS.2003.1203467","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203467","url":null,"abstract":"This paper presents the results from a detailed, experimental study of OSPF an intra-domain routing protocol, running on a mid-size regional Internet service provider. Using multiple, distributed probes running custom monitoring tools, we collected continuous protocol information for a full year. We use this data to analyze the health of the network including the amount, source, duration and periodicity of routing instability. We found that information from external routing protocols produces significant levels of instability within OSPF. We also examine the evolution of the routing topology over time, showing that short term changes are incremental and that the long term trend shows constant change. Finally, we present a set of detailed investigations into several large scale anomalies. These anomalies demonstrate the significant impact external routing protocols have on OSPF. In addition, they highlight the need for new network management tools that can incorporate information from routing protocols.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127505343","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}
引用次数: 89
Fragmentation based D-MAC protocol in wireless ad hoc networks 无线自组网中基于分片的D-MAC协议
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203497
Zhenmin Li, Pin Zhou, J. Hou
{"title":"Fragmentation based D-MAC protocol in wireless ad hoc networks","authors":"Zhenmin Li, Pin Zhou, J. Hou","doi":"10.1109/ICDCS.2003.1203497","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203497","url":null,"abstract":"Directional antennas have been recently suggested to be used in wireless ad hoc networks to reduce interference outside the antenna direction and to increase spatial reuse of wireless channels. Several MAC schemes that exploit directional antennas have been proposed, among which the two D-MAC schemes proposed in [5] may have received the most attention. In this paper, we carefully analyze how the second D-MAC scheme proposed in [5] operates in the hidden/exposed terminal scenarios and show that it not only introduces new collisions, but also reduces spatial reuse to some extent. To remedy these problems, we propose an enhanced version of the second D-MAC scheme, called fragmentation based D-MAC (FD-MAC), to reduce collision, to achieve better spatial reuse (than the second D-MAC scheme), and to improve fairness. Through ns-2 simulation, we demonstrate the effectiveness of FD-MAC, and in particular, we show that in complex scenarios such as multihop forwarding and mesh topologies, FD-MAC significantly outperforms DCF with RTS/CTS and the two D-MAC schemes, both in terms of throughput and fairness.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129925230","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}
引用次数: 4
Performance optimizations for group key management schemes 组密钥管理方案的性能优化
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203463
Sencun Zhu, Sanjeev Setia, S. Jajodia
{"title":"Performance optimizations for group key management schemes","authors":"Sencun Zhu, Sanjeev Setia, S. Jajodia","doi":"10.1109/ICDCS.2003.1203463","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203463","url":null,"abstract":"Recently, many group key management approaches based on the use of logical key trees have been proposed to address the issue of scalable group rekeying that is needed to support secure communications for large and dynamic groups. In this paper, we present two optimizations for logical key tree organizations that utilize information about the characteristics of group members to further reduce the overhead of group rekeying. First, we propose a partitioned key tree organization that exploits the temporal patterns of group member joins and departures to reduce the overhead of rekeying. Using an analytic model, we show that our optimization can achieve up to 31.4% reduction in key server bandwidth overhead over the unoptimized scheme. Second, we propose an approach under which the key tree is organized based on the loss probabilities of group members. Our analysis shows this optimization can reduce the rekeying overhead by up to 12.1%.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973665","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}
引用次数: 34
Remote belief: preserving volition for loosely coupled processes 远程信念:为松散耦合的过程保留意志
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203493
N. Aydin, P. Sivilotti
{"title":"Remote belief: preserving volition for loosely coupled processes","authors":"N. Aydin, P. Sivilotti","doi":"10.1109/ICDCS.2003.1203493","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203493","url":null,"abstract":"Knowledge has proven to be a useful and fundamental formalism for reasoning about distributed systems. The application of this formalism, however entails a loss of volition on the part of processes about which something is known. This loss of volition is often not appropriate in loosely coupled distributed systems. In this paper we generalize the formal characterization of knowledge into one of belief. Belief has the advantage of allowing processes to maintain volition. We examine some of the similarities and surprising differences between knowledge and belief. We also present some examples of distributed applications that are more conveniently characterized with belief rather than knowledge.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131892781","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
QoS-assured service composition in managed service overlay networks 托管服务覆盖网络中qos保证的服务组合
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203466
Xiaohui Gu, K. Nahrstedt, Rong N. Chang, Christopher Ward
{"title":"QoS-assured service composition in managed service overlay networks","authors":"Xiaohui Gu, K. Nahrstedt, Rong N. Chang, Christopher Ward","doi":"10.1109/ICDCS.2003.1203466","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203466","url":null,"abstract":"Many value-added and content delivery services are being offered via service level agreements (SLAs). These services can be interconnected to form a service overlay network (SON) over the Internet. Service composition in SON has emerged as a cost-effective approach to quickly creating new services. Previous research has addressed the reliability, adaptability, and compatibility issues for composed services. However little has been done to manage generic quality-of-service (QoS) provisioning for composed services, based on the SLA contracts of individual services. In this paper we present QUEST a QoS assUred composEable Service infrasTructure, to address the problem. QUEST framework provides: (1) initial service composition, which can compose a qualified service path under multiple QoS constraints (e.g., response time, availability). If multiple qualified service paths exist, QUEST chooses the best one according to the load balancing metric; and (2) dynamic service composition, which can dynamically recompose the service path to quickly recover from service outages and QoS violations. Different from the previous work, QUEST can simultaneously achieve QoS assurances and good load balancing in SON.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134121524","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}
引用次数: 201
Cross-feature analysis for detecting ad-hoc routing anomalies 用于检测ad-hoc路由异常的交叉特征分析
23rd International Conference on Distributed Computing Systems, 2003. Proceedings. Pub Date : 2003-05-19 DOI: 10.1109/ICDCS.2003.1203498
Yi-an Huang, W. Fan, Wenke Lee, Philip S. Yu
{"title":"Cross-feature analysis for detecting ad-hoc routing anomalies","authors":"Yi-an Huang, W. Fan, Wenke Lee, Philip S. Yu","doi":"10.1109/ICDCS.2003.1203498","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203498","url":null,"abstract":"With the proliferation of wireless devices, mobile ad-hoc networking (MANET) has become a very exciting and important technology. However, MANET is more vulnerable than wired networking. Existing security mechanisms designed for wired networks have to be redesigned in this new environment. In this paper, we discuss the problem of intrusion detection in MANET. The focus of our research is on techniques for automatically constructing anomaly detection models that are capable of detecting new (or unseen) attacks. We introduce a new data mining method that performs \"cross-feature analysis\" to capture the inter-feature correlation patterns in normal traffic. These patterns can be used as normal profiles to detect deviation (or anomalies) caused by attacks. We have implemented our method on a few well known ad-hoc routing protocols, namely, Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (AODV), and have conducted extensive experiments on the ns-2 simulator. The results show that the anomaly detection models automatically computed using our data mining method can effectively, detect anomalies caused by typical routing intrusions.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114988010","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}
引用次数: 283
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书