The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.最新文献

A novel fairness algorithm for resilient packet ring networks with low computational and hardware complexity 一种新的低计算复杂度和硬件复杂度的弹性分组环网络公平性算法

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-28 DOI: 10.1109/LANMAN.2004.1338391

Fahd Alharbi, N. Ansari

{"title":"A novel fairness algorithm for resilient packet ring networks with low computational and hardware complexity","authors":"Fahd Alharbi, N. Ansari","doi":"10.1109/LANMAN.2004.1338391","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338391","url":null,"abstract":"The resilient packet ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR is to achieve high bandwidth utilization, optimum spatial reuse on the dual rings, and fairness. The challenge is to design an algorithm that can react dynamically to the traffics in achieving these objectives. The RPR fairness algorithm (J. Kao et al., January 2002) is comparatively simple, but it poses some critical limitations that require further investigation and remedy. One of the major problems is that the amount of bandwidth allocated by the algorithm oscillates severely under the unbalanced traffic scenarios. These oscillations presents a barrier in achieving spatial reuse and high bandwidth utilization. We propose a low complexity fairness algorithm (LCFA) in allocating the bandwidth fairly to RPR nodes with a very low computational complexity O(1) that requires a simple hardware requirement similar to that of the RPR fairness algorithm.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133729897","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}

引用次数: 8

Content-based charging support for multiple interworking providers 针对多个互连提供商的基于内容的收费支持

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338431

P. Rácz, B. Stiller

引用次数: 1

Jitter analysis of homogeneous traffic in wireless differentiated services networks 无线差别化业务网络中同质业务的抖动分析

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338429

Jong‐Moon Chung, H. Soo, Wun-Cheol Jeong

引用次数: 3

Traffic engineering with constraint-based routing in DiffServ/MPLS network diffserver /MPLS网络中基于约束路由的流量工程

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338416

Yuzhong Chen, Bingqing Yang, Ren Rong, Yanhui Geng, Nenghai Yu

引用次数: 2

Extending OSPF routing protocol for shared mesh restoration 扩展OSPF路由协议，用于共享网格恢复

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338410

Hang Liu, E. Bouillet, D. Pendarakis, Nooshin Komaee, Jean-François P. Labourdette, S. Chaudhuri

引用次数: 0

Application of the theory of the multicommodity for the flows distribution in MPLS networks 多商品理论在MPLS网络流量分配中的应用

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338415

M. Huerta, X. Hesselbach

引用次数: 7

Multiple QoS support using M-LWDF in OFDMA adaptive resource allocation 在OFDMA自适应资源分配中使用M-LWDF支持多重QoS

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338435

Kanghee Kim, Insoo Koo, Seokjin Sung, Kiseon Kim

引用次数: 27

Evaluation of a tunnel set-up mechanism in QoS-aware Ethernet access networks qos感知以太网接入网中隧道建立机制的评估

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338440

F. D. Greve, F. V. Quickenborne, P. V. Heuven, F. Turck, B. Vermeulen, S. V. D. Berghe, I. Moerman, P. Demeester, S. V. D. Bosch, N. Janssens, C. Bouchat, B. V. Vlerken

引用次数: 6

The stability of the resilient packet ring aggressive fairness algorithm 弹性分组环野蛮公平性算法的稳定性

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338392

Fredrik Davik, S. Gjessing

{"title":"The stability of the resilient packet ring aggressive fairness algorithm","authors":"Fredrik Davik, S. Gjessing","doi":"10.1109/LANMAN.2004.1338392","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338392","url":null,"abstract":"Resilient packet ring (RPR) is currently being standardized by the Institute of Electrical and Electronics Engineers (IEEE), within the 802.17 working group. RPR is a dual ring based medium access protocol based on the \"buffer insertion\" principle. Instead of controlling the access to the ring using a circulating token, each station on the ring executes its part of a distributed fairness algorithm. The task of the fairness algorithm is to ensure that all stations gets their fair share of the bandwidth, when there is more demand than supply. This article discusses how the RPR fairness algorithm is able to divide the bandwidth fairly among contending stations as well as the requirements for this to work correctly. We discuss how and when the fairness algorithm fails to converge to a fair value, and what is needed in order to make it converge. Finally we show that the setting of the RPR IpCoef configuration parameter is of crucial importance for the convergence of the fairness algorithm as well as some guidelines for setting this correctly. To do this, we first present some analytical work, of which some were contributed to the RPR working group and is now incorporated in the standard. We explain our approach using an informal \"proof by induction\".","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128805386","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}

引用次数: 10

Localized transmission scheduling for spatial multiplexing using smart antennas in wireless adhoc networks 无线自组网中基于智能天线的空间复用局部传输调度

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI: 10.1109/LANMAN.2004.1338427

Dhananjay Lal, T. Joshi, D. Agrawal

引用次数: 9