发布求助
文献互助 智能选刊 最新文献

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)最新文献

筛选
英文 中文
Fast incremental CRC updates for IP over ATM networks 快速增量CRC更新的IP在ATM网络
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923602
Florian Braun, M. Waldvogel
{"title":"Fast incremental CRC updates for IP over ATM networks","authors":"Florian Braun, M. Waldvogel","doi":"10.1109/HPSR.2001.923602","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923602","url":null,"abstract":"In response to the increasing network speeds, many operations in IP routers and similar devices are being made more efficient. With the advances in other areas of packet processing, the verification and regeneration of cyclic redundancy check (CRC) codes of the data link layer is likely to become a bottleneck in the near future. In this paper, we present a mechanism to defer CRC verification without compromising reliability. This opens the possibility of incremental updates of the CRC. We introduce a new high-speed technique and present efficient implementations, speeding up CRC processing by a factor of 15. Although the paper and analysis focuses on IP over ATM, the scheme applies to a much wider set of network protocols.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134274800","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}
引用次数: 38
Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection 哈密顿周期保护:网状WDM光网络保护的一种新方法
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923599
Hong Huang, J. Copeland
{"title":"Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection","authors":"Hong Huang, J. Copeland","doi":"10.1109/HPSR.2001.923599","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923599","url":null,"abstract":"Designing a protection scheme for a mesh WDM network is a challenging task. Extending the concept of the SONET self-healing ring in the mesh topology by using multiple rings to cover a mesh is inefficient in network resource usage. Mesh-based schemes can yield an optimal solution in network resource usage, but entails complicated switch reconfigurations when network element fails. In addition, mesh optimization needs traffic demands as input, therefore is not applicable to dynamic traffic. We introduce a novel mesh WDM network protection scheme-Hamiltonian cycle protection (HCP)-that is simple, efficient and applicable to dynamic traffic. HCP performs traffic grooming in spare resource space by consolidating spare capacity into as few links as possible, thus minimizing the number of spare switch ports and reducing spare link capacity. HCP can simplify the network recovery process by minimizing the number of nodes involved in switch reconfigurations and enabling the switch reconfiguration to be performed at coarse granularity.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128246074","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}
引用次数: 42
Multiple priority, per flow, dual GCRA rate controller for ATM switches 多优先级，每流，双GCRA速率控制器的ATM交换机
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923626
A. Hagai, B. Patt-Shamir
{"title":"Multiple priority, per flow, dual GCRA rate controller for ATM switches","authors":"A. Hagai, B. Patt-Shamir","doi":"10.1109/HPSR.2001.923626","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923626","url":null,"abstract":"We propose a rate controller for ATM switches. The rate controller supports multiple priorities, and dual leaky bucket (GCRA) traffic descriptors (such as VBR). While regulating each stream independently, our rate controller requires relatively modest computation bandwidth so that it can be implemented without any additional special-purpose hardware. The memory space requirement under reasonable circumstances is close to the most space-efficient schemes. It also enjoys the important advantage of being decoupled from the link scheduler. We analyze the outgoing traffic characteristics of our shaper with combination of strict priority and WFQ link scheduler, and find the optimal shaping parameters so as to maintain conformance at downstream switches. We study the best ways to allocate resources to rate controllers along the path of connection, and demonstrate the effectiveness of aggressive and light shaping in a multiple stage network under various network loads.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130239104","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
Study of the TCP/UDP fairness issue for the assured forwarding per hop behavior in differentiated services networks 差分业务网络中保证每跳转发行为的TCP/UDP公平性问题研究
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923630
A. Kolarov
{"title":"Study of the TCP/UDP fairness issue for the assured forwarding per hop behavior in differentiated services networks","authors":"A. Kolarov","doi":"10.1109/HPSR.2001.923630","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923630","url":null,"abstract":"The IETF Differentiated Services Working Group has standardized the assured forwarding (AF) per hop behavior (PHB). Studies of the AF PHB showed that there are a number of factors that affect fair bandwidth distribution for traffic flows with equal target rates. These factors cause unfair distribution of excess bandwidth in an over provisioned network as well as unfair degradation in an under provisioned network. One of the key factors identified is the effect of congestion non-responsive flows such as UDP when they share the same AF class with TCP flows. We investigate the effect of separating TCP and UDP flows into two AF classes of fair bandwidth distribution. The study shows that decoupling TCP and UDP flows in two AF classes controls distribution of bandwidth resources better than in the case when TCP and UDP flows share the same AF class. Moreover, an active queue management (AQM) technique that is used to realize the multiple levels of drop precedences required in the AF PHB becomes simpler for implementation. Isolation of TCP and UDP flows in router queues allows better control of the AF PHB, and therefore, better control of an overall end-to-end quality of AF service.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124148149","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}
引用次数: 6
Admission control and bandwidth management for VLANs vlan的准入控制和带宽管理
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923618
T. Alj, Jean-Charles Grégoire
{"title":"Admission control and bandwidth management for VLANs","authors":"T. Alj, Jean-Charles Grégoire","doi":"10.1109/HPSR.2001.923618","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923618","url":null,"abstract":"We explore how 802.1Q(p) can be successfully exploited within the DIFFSERV framework. Borrowing from work on INTSERV and SBM, but in keeping with a KISS philosophy, we analyze how, in combination with admission control and bandwidth management, we can deliver services with guarantees of quality for applications such as VoIP on a per-VLAN basis. In conclusion, we show that it possible to use a pure layer-2 infrastructure to support large-scale deployment of new services in a wide regional area.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122093469","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
Probabilistic fair queuing 概率公平排队
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923668
T. Anker, R. Cohen, D. Dolev, Y. Singer
{"title":"Probabilistic fair queuing","authors":"T. Anker, R. Cohen, D. Dolev, Y. Singer","doi":"10.1109/HPSR.2001.923668","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923668","url":null,"abstract":"Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of randomized algorithms for packet scheduling. These algorithms are simple to implement and require small amounts of computation time. Specifically we present an O(1) probabilistic weighted fair queuing algorithm that emits packets from flows with an improved delay jitter. Experimental results of the proposed randomized algorithms suggest that the randomized approach is a viable alternative to the currently deployed deterministic fair queuing algorithms.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"162 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129165964","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
Heterogeneity-aware shortest path routing: flow holding time, user demand and network state 异构感知最短路径路由:流量保持时间、用户需求和网络状态
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923648
S. Yang, Xun Su, Gustavo De Veciana
{"title":"Heterogeneity-aware shortest path routing: flow holding time, user demand and network state","authors":"S. Yang, Xun Su, Gustavo De Veciana","doi":"10.1109/HPSR.2001.923648","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923648","url":null,"abstract":"We investigate possible performance improvements by exploring heterogeneity of traffic characteristics when designing a shortest path routing scheme. First we focus on the effect of the maintenance of the link metrics for connections with different holding times. We found that by using a differentiated routing scheme with respect to connection holding times, one can enhance network performance for a range of traffic loads. Second we propose a selective routing control scheme which determines whether to accept a shortest path routing decision based on user demands in the (source, destination, bandwidth request) tuple. Simulations were conducted to exhibit the effectiveness of such a routing algorithm. Finally, realizing the difference in routing \"local\" versus \"transit\" traffic, we present a novel approach to aggregate network state by drawing on an analogy to circuit theory. The proposed \"effective capacity\" abstraction is not only efficient in terms of the signaling savings, but also maintains a compatible routing metric to represent aggregated and local states.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132372853","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}
引用次数: 5
A dual level leaky bucket traffic shaper architecture for DiffServ networks 用于DiffServ网络的双级漏桶流量形状器架构
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923607
S. Zeng, N. Uzun, S. Papavassiliou
{"title":"A dual level leaky bucket traffic shaper architecture for DiffServ networks","authors":"S. Zeng, N. Uzun, S. Papavassiliou","doi":"10.1109/HPSR.2001.923607","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923607","url":null,"abstract":"A dual level leaky bucket traffic shaper (DLLBTS) architecture for the edge nodes of differentiated services networks is proposed. It can guarantee not only the class-based service level agreement (SLA), but also the fair resources sharing among flows belonging to the same class. In order to make the implementation practical, we proposed a simplified DLLBTS architecture. This simplified scheme can achieve the goal of DLLBTS with a low implementation complexity so that it can be implemented with the current VLSI technology.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131228479","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}
引用次数: 3
Influence of link state updating on the performance and cost of QoS routing in an intranet 内网中链路状态更新对QoS路由性能和开销的影响
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923664
Zhansong Ma, Peng Zhang, R. Kantola
{"title":"Influence of link state updating on the performance and cost of QoS routing in an intranet","authors":"Zhansong Ma, Peng Zhang, R. Kantola","doi":"10.1109/HPSR.2001.923664","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923664","url":null,"abstract":"QoS routing has been regarded as an essential enhancing mechanism for providing differentiated QoS in the IP networks. QoS routing needs link state updating algorithms for acquiring accurate link state information (e.g., available link bandwidth) to compute routes. However, an unsuitable link state updating also brings excess computation and communication cost so that seriously degrades the performance of QoS routing. In this paper, we present four link state update algorithms for QoS routing in an Intranet, i.e., period based, threshold based, equal class based, and unequal class based updating. By doing extensive simulations, we investigate and compare their impact on the performance and cost of on-demand QoS routing in an intranet. Our simulation results prove that QoS routing can achieve both high performance and low cost under the careful selection of link state updating algorithms and their parameters.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125467823","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}
引用次数: 13
首页 上一页
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学术官方微信