Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications最新文献_第7页

Moderating traffic flow over conventional ATM service 减缓传统ATM服务的流量

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021744

T. Nagase, T. Araki, Y. Yoshioka, Tadao Nakamura

引用次数: 0

Executable test sequence for the protocol control and data flow property with overlapping 可执行的测试序列用于协议控制和数据流属性的重叠

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021687

Wen-Huei Chen, Cho-Ching Lu

引用次数: 1

Performance analysis of GSM networks with intelligent underlay-overlay GSM智能底层叠加网络的性能分析

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021669

K. Begain, G. I. Rózsa, A. Pfening, M. Telek

引用次数: 56

Fair queuing with round robin: a new packet scheduling algorithm for routers 轮循公平排队:一种新的路由器分组调度算法

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021794

Arunabha Sen, Ibraz Mohammed, Ravikanth Samprathi, S. Bandyopadhyay

{"title":"Fair queuing with round robin: a new packet scheduling algorithm for routers","authors":"Arunabha Sen, Ibraz Mohammed, Ravikanth Samprathi, S. Bandyopadhyay","doi":"10.1109/ISCC.2002.1021794","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021794","url":null,"abstract":"Over the years several queuing policies have been proposed to ensure fairness between competing requests at a service point. The fair queuing (FQ) algorithm due to Demers, Keshav and Shenkar (1990) is a queuing technique that attains near perfect fairness, where perfect fairness is considered to be the one attained by a fluid flow model. In a data network, the head of the line processor sharing (PS) is considered to be the most fair algorithm. It has been shown that the difference in throughput at any time, in any queue, for any arrival pattern between the FQ and the PS discipline will never exceed MAX, where MAX is the maximum packet size. This difference in throughput is taken as a metric for fairness measure of a queuing algorithm. The drawback of the FQ algorithm is its high packet processing overhead (O (log N)), where N is the number of active flows. To alleviate this problem of high computational complexity, Shreedhar and Varghese (1996) proposed a fair queuing algorithm based on the idea of deficit round robin (DRR). Although DRR reduces the packet processing overhead to O(1), its fairness measure is considerably worse (3MAX) than that of FQ (MAX). In this paper, we present a new round robin based fair queuing algorithm (FQRR) whose packet processing overhead is O(1) and fairness measure is 2MAX.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126951961","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

Capacity-balanced alternate routing for MPLS traffic engineering 用于MPLS流量工程的容量均衡备选路由

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021783

P. Ho, H. Mouftah

引用次数: 6

Facilitating adaptation to trouble spots in wireless MANs 促进对无线城域网故障点的适应

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021709

James S. Pascoe, V. Sunderam, R. Loader, G. Sibley

引用次数: 0

An active network approach to virtual private networks 一种主动网络方法来实现虚拟专用网

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021722

R. Maresca, M. D'Arienzo, M. Esposito, S. Romano, G. Ventre

引用次数: 7

An adaptive survivability admission control mechanism using backup VPs for self-healing ATM networks 自修复ATM网络中使用备份vp的自适应生存能力准入控制机制

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021742

Chi-Chun Lo, Bing-Wen Chuang

{"title":"An adaptive survivability admission control mechanism using backup VPs for self-healing ATM networks","authors":"Chi-Chun Lo, Bing-Wen Chuang","doi":"10.1109/ISCC.2002.1021742","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021742","url":null,"abstract":"A restoration mechanism based on backup capacity provides a solution for assuring network survivability. In this paper we propose an adaptive survivability admission control mechanism using backup virtual paths for self-healing asynchronous transfer mode (ATM) networks. Working virtual paths (WVP) and backup virtual paths (BVP) are configured during the network design phase. For each call request, the proposed mechanism selects a pair of WVP and BVP followed by bandwidth reservation for the pair only if both the WVP and the BVP selected succeed in the call admission control. A backup dependency matrix (BDM) is suggested for recording the most up-to-date information of backup capacity required on a link for restoring a failure on other links. However backup capacity actually reserved on a link is shared by all BVP passing the same link. This \"sharing\" concept substantially reduces the amount of backup capacity required. The selection of BVP uses the BDM so as to make the selection adaptive to the current traffic loads on the network. Two BVP selection methods, min-cost and min-expectation, are proposed. The min-cost strategy increases network utilization while maintaining full survivability under a single link failure. On the contrary, the min-expectation strategy enhances network survivability by slightly reducing network utilization.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129045618","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

Executions of "home applications" and service customisations in Integrated Personal Mobility Architecture 在集成个人移动架构中执行“家庭应用”和服务定制

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021696

Binh Thai, Stephen Wan, A. Seneviratne

引用次数: 2

Software supports for preemptive rollback in optimistic parallel simulation on Myrinet clusters 软件支持在Myrinet集群上进行乐观并行模拟时的抢占式回滚

Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications Pub Date : 2002-07-01 DOI: 10.1109/ISCC.2002.1021738

Andrea Santoro, F. Quaglia

引用次数: 7