Proceedings 21st International Conference on Distributed Computing Systems最新文献_第4页

Robust TCP congestion recovery 健壮的TCP拥塞恢复

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918949

Haining Wang, K. Shin

{"title":"Robust TCP congestion recovery","authors":"Haining Wang, K. Shin","doi":"10.1109/ICDSC.2001.918949","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918949","url":null,"abstract":"Presents a new robust TCP (Transmission Control Protocol) congestion recovery scheme to (1) handle bursty packet losses while preserving the self-clocking capability; (2) detect a TCP connection's new equilibrium during congestion recovery, thus improving both link utilization and effective throughput; and (3) make the TCP behavior during congestion recovery very close to that during congestion avoidance, thus \"extending\" the performance model for congestion avoidance to that for TCP loss recovery. Furthermore, the new recovery scheme requires only a slight modification to the sender side of TCP implementation, thus making it widely deployable. The performance of the proposed scheme is evaluated for scenarios with many TCP flows under the drop-tail and RED (random early detection) gateways in the presence of bursty packet losses. The evaluation results show that the new scheme achieves at least as great a performance improvement as TCP SACK (Selective ACKnowledgments) and consistently outperforms TCP New-Reno. Moreover, its steady-state TCP behavior is close to the ideal TCP congestion behavior. Since the proposed scheme does not require selective acknowledgments nor receiver modifications, its implementation is much simpler than TCP SACK.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133450465","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

Differentiated caching services; a control-theoretical approach 差异化缓存服务;控制理论方法

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918992

Ying Lu, A. Saxena, T. Abdelzaher

{"title":"Differentiated caching services; a control-theoretical approach","authors":"Ying Lu, A. Saxena, T. Abdelzaher","doi":"10.1109/ICDSC.2001.918992","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918992","url":null,"abstract":"The increasing diversity of Internet appliances calls for an architecture for performance differentiation on information access. The World Wide Web is the dominant interface for information access today. Web proxy caching is the key performance accelerator in the Web infrastructure. While many research efforts have addressed performance differentiation in the network and on Web servers, providing multiple levels of service in proxy caches has received much less attention. This paper has two main contributions. First, we describe, implement and evaluate an architecture for differentiated content caching services as a key element of the Internet infrastructure. Second, we describe a control-theoretical approach that lays well-understood theoretical foundations for resource management to achieve performance differentiation in proxy caches. We describe our experiences with implementing the differentiated caching services scheme in Squid, a popular proxy cache used by many Internet service providers today. Experimental studies and analyses prove that differentiated caching services provide significant better performance to the premium content classes.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126365460","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}

引用次数: 149

An analytical study of opportunistic lease renewal 机会性租赁续期的分析研究

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918943

R. Burns, R. Rees, D. Long

引用次数: 9

On detecting global predicates in distributed computations 分布式计算中全局谓词的检测

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918927

N. Mittal, V. Garg

{"title":"On detecting global predicates in distributed computations","authors":"N. Mittal, V. Garg","doi":"10.1109/ICDSC.2001.918927","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918927","url":null,"abstract":"Monitoring of global predicates is a fundamental problem in asynchronous distributed systems. This problem arises in various contexts, such as design, testing and debugging, and fault tolerance of distributed programs. In this paper, we establish that the problem of determining whether there exists a consistent cut of a computation that satisfies a predicate in k-CNF (k/spl ges/2), in which no two clauses contain variables from the same process, is NP-complete in general. A polynomial-time algorithm to find the consistent cut, if it exists, that satisfies the predicate for special cases is provided. We also give algorithms (albeit exponential) that can be used to achieve an exponential reduction in time over existing techniques for solving the general version. Furthermore, we present an algorithm to determine whether there exists a consistent cut of a computation for which the sum x/sub 1/+x/sub 2/+/spl middot//spl middot//spl middot/+x/sub n/ exactly equals some constant k, where each x/sub i/ is an integer variable on a process p/sub i/ such that it is incremented or decremented by at most one at each step. As a corollary, any symmetric global predicate on Boolean variables, such as absence of simple majority and exclusive-OR of local predicates, can now be detected. Additionally, the problem is proved to be NP-complete if each x/sub i/ can be changed by an arbitrary amount at each step. Our results solve the previously open problems in predicate detection proposed by V.K. Garg (1997) and bridge the wide gap between the known tractability and intractability results that have existed until now.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121287772","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}

引用次数: 46

A real-time system for tele-surgery 远程手术的实时系统

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918953

S. Butner, Moji Ghodoussi

引用次数: 35

A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests 具有优先级请求的抢占和降级的动态带宽分配启发式算法

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918985

P. Dharwadkar, H. Siegel, E. Chong

{"title":"A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests","authors":"P. Dharwadkar, H. Siegel, E. Chong","doi":"10.1109/ICDSC.2001.918985","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918985","url":null,"abstract":"Bandwidth allocation is a fundamental problem in communication networks. The problem of bandwidth allocation is further intensified when the requested bandwidth exceeds the available unused bandwidth and so not all requests can be completely served. This research examines on-line bandwidth allocation, where the decision for acceptance or rejection of the request has to be made when future requests and their arrival statistics are not known. A request can be defined as a flow of information from a source to a destination with a certain amount of bandwidth, a priority level, a utility function that is based on the bandwidth received and a worth that is based on the utility function and the priority level. The goal of this research is to develop a scheduling heuristic for an overloaded system that attempts to schedule the requests such that the sum of the worths of the requests satisfied in a fixed interval of rime is the maximum. The scheduling heuristic can preempt or degrade already-scheduled requests. Three different types of utility functions (step, linear, and concave) are examined. Other parameters being considered include network loading and the relative weights of the different priority levels. The heuristic variations developed are shown to perform well compared to a complete sharing policy and an upper bound.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131727287","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}

引用次数: 33

LIME: a middleware for physical and logical mobility LIME:用于物理和逻辑移动的中间件

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918983

A. Murphy, G. Picco, G. Roman

引用次数: 493

Optimal hash routing for Web proxies Web代理的最优散列路由

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918948

Xueyan Tang, S. Chanson

引用次数: 4

Constructing adaptive software in distributed systems 在分布式系统中构建自适应软件

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918994

Wen-ke Chen, M. Hiltunen, R. Schlichting

引用次数: 149

Applications of probabilistic quorums to iterative algorithms 概率群体在迭代算法中的应用

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918929

Hyunyoung Lee, J. Welch

引用次数: 18