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

2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)最新文献

筛选
英文 中文
Developing layer 3 switch with 100 Gbps optical packet interface 开发100gbps光分组接口的三层交换机
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483083
K. Fujikawa, H. Furukawa, K. Sugai, T. Muranaka, H. Harai
{"title":"Developing layer 3 switch with 100 Gbps optical packet interface","authors":"K. Fujikawa, H. Furukawa, K. Sugai, T. Muranaka, H. Harai","doi":"10.1109/HPSR.2015.7483083","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483083","url":null,"abstract":"We newly developed a layer 3 switch prototype that has one 100 Gbps optical packet interface and twelve 10 GbE interfaces. This is a gateway node to the optical packet switched network. While similar nodes made by the authors just have conversion capability from/to Ethernet frames to/from optical packets, this switch provides full layer 3 switching capability among the 13 ports, namely, packets incoming from any input port can be sent to any output port via destination IP address lookup. We show 12,000 prefixes are looked-up and 4,000 destination addresses of optical packets are added as a result of the lookup. We also show that the layer 3 switch is connected to the access line to the Internet.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130474048","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
Fixed-mobile Convergence: Infrastructure, functionality, services — The combo perspective 固定-移动融合:基础设施、功能、服务-组合视角
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483118
Péter Olaszi, D. Breuer, T. Cinkler, A. Gravey, J. Torrijos, S. Gosselin, A. Hamidian, S. Höst, T. Mamouni, S. Pachnicke
{"title":"Fixed-mobile Convergence: Infrastructure, functionality, services — The combo perspective","authors":"Péter Olaszi, D. Breuer, T. Cinkler, A. Gravey, J. Torrijos, S. Gosselin, A. Hamidian, S. Höst, T. Mamouni, S. Pachnicke","doi":"10.1109/HPSR.2015.7483118","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483118","url":null,"abstract":"Fixed-mobile convergence initially focused on optimizing fixed and mobile telephone infrastructure for voice services. The appearance of VoIP and smartphones, the growing popularity of social networks and video hosting services, the emerging of 5G, Internet of Things, machine-to-machine communication and ever newer over-the-top services motivated manufacturers, network operators and service providers to refocus and data delivery. The tutorial highlights the structural and functional aspects for efficiently instrumenting this convergence process, including infrastructure considerations, network function virtualization, software defined networking, unified functionality. The presentations are embedded into an overview of the past efforts, a summary of the state of the art, and a look-ahead for future communications networks. The authors are members of the Combo European consortium working on fixed-mobile convergence.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132123896","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
Next generation resilient redundant router 下一代弹性冗余路由器
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483082
H. Asenov, Chase Cotton
{"title":"Next generation resilient redundant router","authors":"H. Asenov, Chase Cotton","doi":"10.1109/HPSR.2015.7483082","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483082","url":null,"abstract":"The need in the commercial Internet to continually improve unit capital costs coupled with the increased reliability needed to carry all service types drives carrier architectures toward ever larger routers deployed in non-redundant configurations. This requires advancements in High Availability (HA) Non-Stop operation of these systems. We propose and implement a distributed architecture for these next generation core routers by implementing N-Modular Redundancy for control process software. The system employs an eventually consistent framework based on a Distributed Hash Table database. The overall goal is a system capable of non-stop routing, meaning that a router can still process both control and data messages, even after multiple software and hardware failures. Details on the architecture are provided and an estimation of scalability, overhead, and fault recovery time is presented.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115345181","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
Fault-tolerant cell dispatching for onboard space-memory-memory Clos-network packet switches 板载空间-记忆-记忆clos网络分组交换机的容错单元调度
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483090
Kai Liu, Jian Yan, Jianhua Lu
{"title":"Fault-tolerant cell dispatching for onboard space-memory-memory Clos-network packet switches","authors":"Kai Liu, Jian Yan, Jianhua Lu","doi":"10.1109/HPSR.2015.7483090","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483090","url":null,"abstract":"Space-memory-memory (SMM) Clos-network switch is an attractive alternative to an onboard switch due to its features of non-blocking, path diversity, distributed scheduling, and low implement cost. In this paper, in order to resist serious crosspoint faults induced by the harsh space radiation environment, we propose a fault-tolerant desynchronized static round-robin (FT-DSRR) cell dispatching algorithm for onboard SMM Clos-network switch. Different from previous schemes without fault tolerance, the cells in the proposed FT-DSRR can bypass the faulty paths and be evenly dispatched to the fault-free paths. Theoretical analysis demonstrates that, in the worst case, 100% throughput can be achieved under any admissible traffic when any (m-n) crosspoint faults occurring in an input/output module or in all central modules, where m and n are the number of inputs and outputs of input module, respectively. Simulation results indicate that, in the case of faults occurring randomly, FT-DSRR exhibits a good performance in terms of throughput and average cell delay under different traffic scenarios.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116295338","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
LAWIN: A Latency-AWare InterNet architecture for latency support on best-effort networks LAWIN:一种延迟感知的互联网架构，用于在尽力而为的网络上支持延迟
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483104
Katsushi Kobayashi
{"title":"LAWIN: A Latency-AWare InterNet architecture for latency support on best-effort networks","authors":"Katsushi Kobayashi","doi":"10.1109/HPSR.2015.7483104","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483104","url":null,"abstract":"While strict latency restrictions are imposed on network applications, current best-effort Internet architecture entirely lacks this support. In this paper, we propose a “Latency AWare InterNet” (LAWIN) architecture that supports various latency requirements while retaining the best-effort service model. In the LAWIN architecture, applications specify their desired network latency limits, or deadlines, into all packets, and routers schedule these packets according to their deadlines. To this end, we propose two earliest-deadline-first (EDF)-based packet schedulers. The first imposes the same packet loss rate on all applications regardless of the latency specified by each, and provides rough flow-rate fairness. The second scheduler imposes a biased packet loss probability. The biased scheduler also provides an efficient latency and bandwidth trading mechanism for application settings, which motivates applications to set optimal latencies in order to improve efficiency.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631267","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
Bridge priority provisioning for maximizing equal cost shortest path availability 桥优先级配置最大化等成本最短路径可用性
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483078
Yu-Cheng Tsao, T. Hou
{"title":"Bridge priority provisioning for maximizing equal cost shortest path availability","authors":"Yu-Cheng Tsao, T. Hou","doi":"10.1109/HPSR.2015.7483078","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483078","url":null,"abstract":"Shortest Path Bridging (SPB) is a new layer 2 switching technology which is the latest on the IEEE 802.3 Ethernet evolution path and provides improved scalability. It is suitable for large-scale cloud data center networks that require hundreds or thousands of switches (or bridges) to connect up to tens of thousands of servers. In SPB, 16 ECT (equal cost tree) algorithms are introduced to select one of multiple equal cost shortest paths (ECSPs). However, some ECSPs may not be selected by these ECT algorithms at all. In this paper, we propose provisioning bridge priority to address this issue. The proposed distinct XOR relation (DXR) constraint on the bridge priority is shown to allow maximum number of ECSPs to be selected by the ECT algorithms.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129279329","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
Dimensioning optical clouds with shared-path shared-computing (SPSC) protection 具有共享路径共享计算(SPSC)保护的光学云的量纲
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483085
C. Natalino, P. Monti, L. França, M. Furdek, L. Wosinska, C. Francês, Joao W. Costa
{"title":"Dimensioning optical clouds with shared-path shared-computing (SPSC) protection","authors":"C. Natalino, P. Monti, L. França, M. Furdek, L. Wosinska, C. Francês, Joao W. Costa","doi":"10.1109/HPSR.2015.7483085","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483085","url":null,"abstract":"Service relocation represents a promising strategy to provide flexible and resource efficient resiliency from link failures in the optical cloud environment. However, when a failure affects a node hosting a datacenter (DC), service relocation from the affected DC is not possible. One alternative to protect against DC failures relies on using design strategies that duplicate the IT (i.e., storage and processing) resources in a backup DC at the expense of increasing resource overbuild (i.e., cost) of the network. This work proposes a dimensioning strategy based on the shared-path shared-computing (SPSC) concept able to protect against any single link, server, or DC failure scenario with minimal resource overbuild for the network and IT infrastructures. SPSC is based on the intuition that only storage units need complete replication in backup DC, while processing units can be instantiated only after the occurrence of a failure, leaving the design strategy some leeway to minimize their number. As result, the proposed SPSC design shows a considerable reduction in the amount of backup resources when compared to the dedicated protection strategies.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115631169","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
Advances in dynamic routing models and algorithms for large-scale graphs 大规模图的动态路由模型和算法研究进展
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483073
D. Papadimitriou
{"title":"Advances in dynamic routing models and algorithms for large-scale graphs","authors":"D. Papadimitriou","doi":"10.1109/HPSR.2015.7483073","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483073","url":null,"abstract":"This document provides a detailed description and motivation together with the structure of the tutorial lecture on Advances in Dynamic Routing Models and Algorithms for Large-Scale Graphs provided at the 2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR). After motivating the importance of this multi-disciplinary research topic blending algorithm graph theory, distributed computing as well as performance analysis and modeling, this paper provides a detailed structure of the tutorial lecture. We conclude this paper by the challenges resulting from new application domains in routing, in particular, for so-called information-centric networks and position the new paradigms presented in the second part of this lecture, namely, the overlay model (content-distribution networks) and named-based routing model.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116992692","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}
引用次数: 0
SONAR: A scalable stream-oriented system for real-time network traffic measurements 声纳:用于实时网络流量测量的可扩展流导向系统
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483101
Jun Liu, Y. Du, Jie Yang, N. Ansari
{"title":"SONAR: A scalable stream-oriented system for real-time network traffic measurements","authors":"Jun Liu, Y. Du, Jie Yang, N. Ansari","doi":"10.1109/HPSR.2015.7483101","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483101","url":null,"abstract":"Accurate and real-time network measurements are becoming increasingly critical for a large variety of management tasks like accounting, bandwidth provisioning and security analysis. However, existing network measurement techniques have major limitations in supporting scalable and real-time traffic data monitoring and analyzing on high-speed (10Gbps and beyond) network links. Therefore, we propose a novel real-time network measurement system, named SONAR, which facilitates the convergence of real-time network monitoring and traffic analysis. We illustrate how the proposed system is designed and implemented based on streaming computing technologies, and demonstrate its capabilities with a built-in abnormal traffic detection application. The proposed system, based on real-world actualization and evaluation, has been demonstrated to be a high-performance and scalable solution for real-time network traffic measurements.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121445752","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
p-Cycle design without candidate cycle enumeration in mixed-line-rate optical networks
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483110
Min Ju, Fen Zhou, Zuqing Zhu, S. Xiao
{"title":"p-Cycle design without candidate cycle enumeration in mixed-line-rate optical networks","authors":"Min Ju, Fen Zhou, Zuqing Zhu, S. Xiao","doi":"10.1109/HPSR.2015.7483110","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483110","url":null,"abstract":"This paper develops and evaluates a new protection solution for pre-configured-cycle (p-cycle) design in Mixed-Line-Rate (MLR) optical networks. Conventional p-cycle approaches require enumerating candidate cycles in advance and screening p-cycles using heuristic algorithms. Our method generates p-cycles directly in one-step using an Integer Linear Programming (ILP) model. Cost-effective transponders and distance-adaptive line rates are provisioned for every p-cycle to minimize joint cost of transponders and spare capacity. The design problem is solved together with spectral clustering based graph partitioning, which permits to compute the optimal solution in independent sub-graphs concurrently. The results show that our protection method is cost-efficient for p-cycle design with mixed line rates and scalable for large optical networks.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130951215","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学术官方微信