24th International Conference on Distributed Computing Systems, 2004. Proceedings.最新文献_第2页

A study of BGP path vector route looping behavior BGP路径矢量路由循环行为的研究

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281640

Dan Pei, Xiaoliang Zhao, D. Massey, Lixia Zhang

{"title":"A study of BGP path vector route looping behavior","authors":"Dan Pei, Xiaoliang Zhao, D. Massey, Lixia Zhang","doi":"10.1109/ICDCS.2004.1281640","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281640","url":null,"abstract":"Measurements have shown evidences of inter-domain packet forwarding loops in the Internet, but the exact cause of these loops remains unclear. As one of the efforts in identifying the causes, this paper examines how transient loops can be created at the inter-domain level via BGP, and what are the major factors that contribute to duration of the routing loops. As a path-vector routing protocol, BGP messages list the entire AS path to each destination and the path information enables each node to detect, thus break, arbitrarily long routing loops involving itself. However, delays due to physical constrains and protocol mechanisms slow down routing updates propagation and the routing information inconsistencies among the nodes lead to loop formation during convergence. We show that the duration of transient BGP loops match closely to BGP's routing convergence time and the looping duration is linearly proportional to BGP's minimum route advertisement interval timer (MRAI) value. We also examine four BGP routing convergence enhancements and show that two enhancements effective in speeding up routing convergence are also effective in reducing routing loops.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132764359","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}

引用次数: 60

Efficient Web services response caching by selecting optimal data representation 通过选择最佳数据表示实现高效的Web服务响应缓存

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281583

Toshiro Takase, Michiaki Tatsubori

{"title":"Efficient Web services response caching by selecting optimal data representation","authors":"Toshiro Takase, Michiaki Tatsubori","doi":"10.1109/ICDCS.2004.1281583","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281583","url":null,"abstract":"We discuss the design for an efficient response cache mechanism appropriate for the Web services architecture. The important feature of Web services is its interoperability between heterogeneous platforms. This interoperability is based on widely accepted standards such as XML, SOAP, and WSDL. We describe a response cache mechanism for Web services client middleware without any extensions to these standards so that the client can participate transparently in the existing Web services community. We propose three optimization methods to improve the performance of our response cache. The first optimization is caching the post-parsing representation instead of the XML message itself. The second is caching application objects. For this optimization, we show some copying processes that are dependent on the type of cached objects. The third optimization is for read-only objects. These methods reduce the overhead of XML processing or object copying. We have implemented a prototype of a response cache on Apache-Axis, and evaluated these optimization methods through experiments for Google Web services. Finally, based on the experimental results, we discuss the optimal configuration of these methods based on data types.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"45 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134060922","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}

引用次数: 30

Robust emulations of shared memory in a crash-recovery model 在崩溃恢复模型中健壮地模拟共享内存

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281605

R. Guerraoui, Ron R. Levy

引用次数: 43

Data indexing in peer-to-peer DHT networks 对等DHT网络中的数据索引

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281584

L. Garcés-Erice, P. Felber, E. Biersack, G. Urvoy-Keller, K. Ross

引用次数: 96

A distributed approach to solving overlay mismatching problem 一种分布式解决叠加不匹配问题的方法

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281576

Yunhao Liu, Zhenyun Zhuang, Li Xiao, L. Ni

引用次数: 104

A distributed approach to topology-aware overlay path monitoring 拓扑感知覆盖路径监控的分布式方法

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281575

Chiping Tang, P. McKinley

引用次数: 20

Coordinating adaptations in distributed systems 在分布式系统中协调适应

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281611

Brian Ensink, Vikram S. Adve

{"title":"Coordinating adaptations in distributed systems","authors":"Brian Ensink, Vikram S. Adve","doi":"10.1109/ICDCS.2004.1281611","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281611","url":null,"abstract":"Distributed applications may use sophisticated runtime adaptation strategies to meet their performance or quality-of-service goals. Coordinating an adaptation that involves multiple processes can require complex communication or synchronization, in addition to communication in the base application. We propose conceptually simple high-level directives and a sophisticated runtime algorithm for coordinating adaptation automatically and transparently in distributed applications. The coordination directives specify when to adapt, in terms of the relative computational progress of each relevant process. The coordination algorithm relies on simple compiler transformations to track the progress of the processes, and performs the adaptive changes locally and asynchronously at each process. Measurements of the runtime overhead of the automatic coordination algorithm for two adaptive applications (a parallel PDE solver and a distributed video tracking code) show that the overhead is less than 1% of execution time for both these codes, even with relatively frequent adaptations, and does not grow significantly with the number of coordinating processes.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130733699","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}

引用次数: 35

Roaming honeypots for mitigating service-level denial-of-service attacks 用于减轻服务级拒绝服务攻击的漫游蜜罐

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281598

S. Khattab, Chatree Sangpachatanaruk, D. Mossé, R. Melhem, T. Znati

{"title":"Roaming honeypots for mitigating service-level denial-of-service attacks","authors":"S. Khattab, Chatree Sangpachatanaruk, D. Mossé, R. Melhem, T. Znati","doi":"10.1109/ICDCS.2004.1281598","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281598","url":null,"abstract":"Honeypots have been proposed to act as traps for malicious attackers. However, because of their deployment at fixed (thus detectable) locations and on machines other than the ones they are supposed to protect, honeypots can be avoided by sophisticated attacks. We propose roaming honeypots, a mechanism that allows the locations of honeypots to be unpredictable, continuously changing, and disguised within a server pool. A (continuously changing) subset of the servers is active and providing service, while the rest of the server pool is idle and acting as honeypots. We utilize our roaming honeypots scheme to mitigate the effects of service-level DoS attacks, in which many attack machines acquire service from a victim server at a high rate, against back-end servers of private services. The roaming honeypots scheme detects and filters attack traffic from outside a firewall (external attacks), and also mitigates attacks from behind a firewall (internal attacks) by dropping all connections when a server switches from acting as a honeypot into being active. Through ns-2 simulations, we show the effectiveness of our roaming honeypots scheme. In particular, against external attacks, our roaming honeypots scheme provides service response time that is independent of attack load for a fixed number of attack machines.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836106","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}

引用次数: 85

Fault-tolerant data delivery for multicast overlay networks 多播覆盖网络的容错数据传输

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281635

V. Pappas, Beichuan Zhang, A. Terzis, Lixia Zhang

引用次数: 18

EnviroTrack: towards an environmental computing paradigm for distributed sensor networks 面向分布式传感器网络的环境计算范式

24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281625

T. Abdelzaher, Brian M. Blum, Qing Cao, Yong Chen, David Evans, Jemin George, S. George, Lin Gu, T. He, S. Krishnamurthy, L. Luo, S. Son, J. Stankovic, R. Stoleru, A. Wood

引用次数: 274