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

2006 Workshop on High Performance Switching and Routing最新文献

筛选
英文 中文
Ethernet in core networks: a technical and economical analysis 核心网中的以太网:技术和经济分析
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709695
Arno Schmid-Egger, A. Kirstädter
{"title":"Ethernet in core networks: a technical and economical analysis","authors":"Arno Schmid-Egger, A. Kirstädter","doi":"10.1109/HPSR.2006.1709695","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709695","url":null,"abstract":"Ethernet is an uncompleted success story extending its reach from LAN and metro areas now also into core networks. 100 Gbps Ethernet will be the key enabler for a new generation of true end-to-end carrier grade Ethernet networks. This paper first focuses on functionality and standards required to enable carrier-grade Ethernet-based core networks and possible Ethernet backbone network architectures will be discussed. The second part then evaluates the CAPEX and OPEX performance of Ethernet core networks and competitive network architectures. The results propose that Ethernet will not only soon be mature enough for deployment in backbone networks but also provide huge cost advantages to providers","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131057260","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}
引用次数: 15
Distributed crossbar schedulers 分布式交叉排度器
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709688
C. Minkenberg, F. Abel, E. Schiattarella
{"title":"Distributed crossbar schedulers","authors":"C. Minkenberg, F. Abel, E. Schiattarella","doi":"10.1109/HPSR.2006.1709688","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709688","url":null,"abstract":"The goal of this work is to enable distributed (multi-chip) implementations of iterative matching algorithms for crossbar-based packet switches, as opposed to the traditional monolithic (single-chip) ones. The practical motivation for this effort is the design and implementation in FPGAs of a scheduler for a 64-port optical crossbar switch. Sizing experiments show that the scheduler logic must be distributed over multiple devices, which introduces a number of new challenges. Most importantly, the physical distances introduce latencies that exceed the timing requirements, and the separation of logical units prevents shared access to status information. We consider three levels of distribution, and present techniques to mitigate the consequences of specific distribution levels. The performance results obtained via simulation show that, using these methods, a distributed scheduler can achieve a performance close to that of a monolithic scheduler, even with large internal latencies","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124077988","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
Design issues for edge nodes in agile all-photonic networks 敏捷全光子网络边缘节点的设计问题
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709683
R. Radziwilowicz, M.G. Khair, S. A. Paredes, T. Hall
{"title":"Design issues for edge nodes in agile all-photonic networks","authors":"R. Radziwilowicz, M.G. Khair, S. A. Paredes, T. Hall","doi":"10.1109/HPSR.2006.1709683","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709683","url":null,"abstract":"This paper raises the issues faced in edge node design for an agile all-photonic network (AAPN) and proposes solutions. The architecture discussed addresses several issues such as packet processing, traffic aggregation and encapsulation, buffers implementation, local scheduling, QoS provision, traffic monitoring and internal control mechanisms. The main goal of this work is to provide a detailed description of the functional modules considering technologies readily available now or immediately on the horizon","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901085","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}
引用次数: 1
Multi-hop scheduling algorithms in switches with reconfiguration latency 具有重配置延迟的交换机多跳调度算法
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709702
V. Alaria, A. Bianco, P. Giaccone, Emilio Leonardi, Ferrante Neri
{"title":"Multi-hop scheduling algorithms in switches with reconfiguration latency","authors":"V. Alaria, A. Bianco, P. Giaccone, Emilio Leonardi, Ferrante Neri","doi":"10.1109/HPSR.2006.1709702","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709702","url":null,"abstract":"Optical switching fabrics (OSF) are receiving increasing attention in the design of high speed packet switches, due to their excellent properties in terms of available bandwidth and reduced power consumption. However, most optical devices suffer a reconfiguration latency each time input/output connections are modified; unfortunately, this latency may not be negligible with respect to the packet transmission time, and can adversely affect performance, especially delay and throughput. The multi-hop approach, i.e., sending packets to the final destination port exploiting transmission to intermediate ports, was shown to be a promising way to control the tradeoff between delay and throughput. In this paper, we examine the multi-hop approach when using a logical interconnections based on multidimensional regular topologies. We discuss not only the scheduling problem for these topologies, but also the design of routing and queueing schemes. Performance are analyzed by simulation","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122163943","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}
引用次数: 7
Sharing wavelength converters in multistage optical packet switches 在多级光分组交换机中共享波长转换器
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709707
C. Raffaelli, M. Savi, A. Stavdas
{"title":"Sharing wavelength converters in multistage optical packet switches","authors":"C. Raffaelli, M. Savi, A. Stavdas","doi":"10.1109/HPSR.2006.1709707","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709707","url":null,"abstract":"This paper describes a multistage switch based on the broadcast-and-select principle. It implements shared per node wavelength conversion for contention resolution in optical packet-switched networks. A novel scheduling algorithm is proposed to control packet forwarding in synchronous context. An analytical model is provided to calculate the packet loss probability related to the multistage configuration. Results show how the sharing of wavelength converters impacts on node performance, and provide a meaningful support for cost-performance benchmarking studies","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129828206","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}
引用次数: 26
Route optimization for efficient failure recovery in optical burst switched networks 光突发交换网络中有效故障恢复的路由优化
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709735
Qian Chen, G. Mohan, K. Chua
{"title":"Route optimization for efficient failure recovery in optical burst switched networks","authors":"Qian Chen, G. Mohan, K. Chua","doi":"10.1109/HPSR.2006.1709735","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709735","url":null,"abstract":"We consider the problem of offline route optimization for failure recovery in optical burst switched (OBS) networks. The primary and backup paths for each flow are determined in such a way to minimize the expected burst loss over normal and failure states. When a failure occurs, the affected traffic are transferred to the pre-configured backup path, resulting in fast recovery. Our route selection is efficient because we consider the unique features of OBS networks such as streamline effect. We argue that route selection based on Erlang B formula is not accurate because of this effect. We analyze the streamline effect and propose a more accurate loss estimation formula which takes the streamline effect into consideration. Based on this formula, we develop a mixed integer linear programming (MILP) formulation. Since the MILP-based solution is computationally intensive, we develop a heuristic algorithm. We verify the effectiveness of our algorithms through numerical results obtained by solving the MILP formulation with CPLEX and also through simulation results","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124239350","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}
引用次数: 7
Effective burst preemption in OBS network OBS网络中有效的突发抢占
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709737
M. Klinkowski, D. Careglio, D. Morató, J. Solé-Pareta
{"title":"Effective burst preemption in OBS network","authors":"M. Klinkowski, D. Careglio, D. Morató, J. Solé-Pareta","doi":"10.1109/HPSR.2006.1709737","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709737","url":null,"abstract":"Burst preemption is the most effective technique to provide quality of service (QoS) differentiation in optical burst switching (OBS) networks. Nonetheless, in conventional OBS architectures, when preemption happens the control packet corresponding to the preempted burst continues its travel to the destination node reserving resources at each node of the path. Therefore, an additional signaling procedure should be carried out to release these unnecessary reservations. In this paper we present novel control architecture to efficiently apply burst preemption without the need of the signaling procedure. Analytical and simulation results prove the effectiveness of this proposal","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124370589","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}
引用次数: 7
RTF/spl I.bar/TIE: a tunable interdomain egress selection algorithm robust to transient link failures RTF/spl .bar/TIE:一种对瞬态链路故障具有鲁棒性的可调域间出口选择算法
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709721
Yaping Liu, Z. Gong, Feng Zhao
{"title":"RTF/spl I.bar/TIE: a tunable interdomain egress selection algorithm robust to transient link failures","authors":"Yaping Liu, Z. Gong, Feng Zhao","doi":"10.1109/HPSR.2006.1709721","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709721","url":null,"abstract":"Hot-potato routing is a mechanism employed in the border gateway protocol (BGP), when the BGP selects the interdomain egress with the closest egress point based on intradomain path costs. Recent work has shown that it can impact the robustness of interdomain routing especially for large ISP backbones. Some mechanisms have been proposed to replace the hot-potato routing such as interdomain traffic engineering by tweaking BGP routes, the tunable Interdomain Egress Selection mechanism and so on. However, these methods often ignore the issue of link failures or the failure duration, which arise as part of everyday network operations. In this paper, we propose a flexible mechanism for routers to select the egress point robust to transient link failures with satisfying traffic engineering goals. The proposed RTF_TIE algorithm can also satisfy the purpose of real time in routers. Experiments with topology, routing data, traffic flow data from Abilene network demonstrate that the algorithm is effective","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131844917","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
Integrated multi-layer bandwidth recovery for multimedia communications 用于多媒体通信的集成多层带宽恢复
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709723
L. Valcarenghi, F. Paolucci, P. Castoldi, L. Rossi, F. Cugini
{"title":"Integrated multi-layer bandwidth recovery for multimedia communications","authors":"L. Valcarenghi, F. Paolucci, P. Castoldi, L. Rossi, F. Cugini","doi":"10.1109/HPSR.2006.1709723","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709723","url":null,"abstract":"The quality of service required by multimedia applications, such as video on demand (VoD), must be seamlessly guaranteed in spite of any failure (e.g., connection failure or server failure). Thus, if connections carrying multimedia application traffic fail, not only the client-server connectivity but also the pre-failure QoS guarantees must be recovered to prevent user perception of the occurred failure. is study, a solution for recovering bandwidth guaranteed client-server connections (i.e., bandwidth recovery) is proposed and experimentally evaluated. The proposed solution can be applied to both bandwidth guaranteed connection failures and server failures. The bandwidth recovery scheme is based on the integration of an application layer recovery scheme, i.e. server migration, and a multi-protocol label switching (MPLS) layer recovery scheme, i.e. LSP path restoration, through a resource broker (RB). The solution, being based on restoration, does not require prior extra resource allocation besides a working LSP, while at the application layer it requires the availability of a back-up server. The proposed RB solution can be easily implemented in a distributed environment. Experimental results show that the proposed bandwidth recovery scheme is able to dynamically recover bandwidth guaranteed connections within few seconds in all the considered connection failure scenarios","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"47 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893338","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}
引用次数: 1
Synchronizing routing information of control plane and forwarding plane gracefully 控制平面和转发平面路由信息同步
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709696
Feng Zhao, Xicheng Lu, Baosheng Wang, Jinjing Zhao
{"title":"Synchronizing routing information of control plane and forwarding plane gracefully","authors":"Feng Zhao, Xicheng Lu, Baosheng Wang, Jinjing Zhao","doi":"10.1109/HPSR.2006.1709696","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709696","url":null,"abstract":"High availability in networks has become increasingly critical. Although the graceful restart mechanism makes the restarting router continue forwarding packets, the routing information between the control plane and the forwarding plane tends be inconsistent after the router completes its restart. The routing information inconsistency has a great influence on the forwarding behavior. Some actions must be taken to synchronize them. We think the synchronizing process should be graceful to minimize the negative effect of the router restart and keep it non-stop forwarding. So we present an algorithm PFGSA (prefixes file based graceful synchronizing algorithm) in the case that the control plane cannot get the forwarding plane routing information. The analysis and test results of the algorithm show that the control plane can synchronize the routing information in relatively short time. We believe the availability in networks will be increased further with the implementation of our algorithm","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133513480","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信