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

筛选
英文 中文
Circuit emulation in optical packet-switched WDM ring network for wireless backhaul 无线回程光分组交换WDM环网电路仿真
I. Chao, M. Yuang
{"title":"Circuit emulation in optical packet-switched WDM ring network for wireless backhaul","authors":"I. Chao, M. Yuang","doi":"10.1109/HPSR.2013.6602294","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602294","url":null,"abstract":"In this paper, we propose an integrated traffic control scheme (ITCS), which facilitates circuit emulation service (CES) for wireless backhaul over a previously proposed experimental optical packet-switched WDM ring network, HOPSMAN. To ensure efficient setup of CES connections, ITCS employs a simple mean-rate-based distributed admission control followed by a novel slot-marking reservation. The total connection setup delay is comprised of the setup queueing delay and slot-marking delay. While the slot-marking delay is nearly a ring time, the mean setup queueing delay is formally computed through an accurate approximation based on an M/G/m queueing analysis. Simulation results show that ITCS accommodates remarkably high CES traffic loads while satisfying a wide range of delay and jitter requirements for wireless backhaul.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114669907","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
On practical stable packet scheduling for bufferless three-stage Clos-network switches 无缓冲三级clos网络交换机的实用稳定分组调度
Yu Xia, H. J. Chao
{"title":"On practical stable packet scheduling for bufferless three-stage Clos-network switches","authors":"Yu Xia, H. J. Chao","doi":"10.1109/HPSR.2013.6602283","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602283","url":null,"abstract":"In this paper, we extend our previous work of StablePlus, a stable scheduling algorithm for single-stage packet switches, to bufferless three-stage Clos-network switches. StablePlus is based on an existing stable distributed scheduling algorithm, called DISQUO. We further improve the switching performance by incorporating a heuristic scheduling algorithm after the DISQUO scheduling. In a three-stage Clos-network switch, DISQUO is first used to solve the output contention which generates a stable matching between the input and output ports, then Karol's algorithm is used to find the feasible internal paths for the matched input and output pairs. However, the latter requires multiple mini-cycles to complete the path-finding task. Worse is that the number of mini-cycles increases as the switch size does, limiting the Clos-network to a small implementable size. By replacing the Hamiltonian Walk in DISQUO with time-division multiplexing (TDM) scheme, we show that the number of required mini-cycles for Karol's algorithm can be reduced to only two, independent of the switch size. Moreover, with the help of a parallel hardware approach, we can implement packet scheduling in O(1) time complexity. To support high data rates, e.g., 100 Gbps, we can also make the scheduling work on a frame basis. We prove that StablePlus can achieve 100% throughput under any admissible traffic, and by simulations we show that it also has good delay performance.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129934390","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
Adaptive forward error correction for energy efficient optical transport networks 节能光传输网络的自适应前向纠错
Anders Rasmussen, S. Ruepp, M. Berger, K. J. Larsen
{"title":"Adaptive forward error correction for energy efficient optical transport networks","authors":"Anders Rasmussen, S. Ruepp, M. Berger, K. J. Larsen","doi":"10.1109/HPSR.2013.6602316","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602316","url":null,"abstract":"In this paper we propose a novel scheme for on the fly code rate adjustment for forward error correcting (FEC) codes on optical links. The proposed scheme makes it possible to adjust the code rate independently for each optical frame. This allows for seamless rate adaption based on the link state of the optical light path and the required amount of throughput going towards the destination node. The result is a dynamic FEC, which can be used to optimize the connections for throughput and/or energy efficiency, depending on the current demand.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"53 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120903185","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
A cross layer routing protocol in CRMANET CRMANET中的一种跨层路由协议
Y. Sun, C. Phillips, Jingwen Bai, Liumeng Song, Rina Wu
{"title":"A cross layer routing protocol in CRMANET","authors":"Y. Sun, C. Phillips, Jingwen Bai, Liumeng Song, Rina Wu","doi":"10.1109/HPSR.2013.6602318","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602318","url":null,"abstract":"This paper proposes a cross layer routing protocol which operates with Cognitive Radio (CR) Ad Hoc Networks. The new routing protocol exploits the passage of CR performance information from the Physical/MAC layers up to Network layer as contributing factors within the route selection algorithms. The performance of the proposed protocol is investigated via simulations and the results confirm its favorable operation within ad hoc network environments.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121401789","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
Interest flooding reduction in Content Centric Networks 减少内容中心网络中的兴趣泛滥
Vijayabharathi Ekambaram, K. Sivalingam
{"title":"Interest flooding reduction in Content Centric Networks","authors":"Vijayabharathi Ekambaram, K. Sivalingam","doi":"10.1109/HPSR.2013.6602313","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602313","url":null,"abstract":"The Content Centric Networking (CCN) architectural framework is designed with the central abstraction of content distribution rather than host-to-host connectivity. CCN has several advantages such as inherent router caching, lower content retrieval time and network load reduction. However, it also faces various challenges such as scalability, deployment and storage issues. In particular, the routing state information that needs to be maintained in the CCN routers leads to very high memory requirements that might not be met using current technologies. If the routing state information stored in the routers is reduced, it leads to flooding of interest packets increasing congestion in the network. The objective of this paper is to propose techniques that avoid congestion due to interest flooding in CCN while having low router memory requirements. We have proposed three different algorithms to address this problem and present their performance using discrete-event simulation models.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130112760","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
A low power and delay multi-protocol switch with IO and network virtualization 具有IO和网络虚拟化的低功耗和延迟多协议交换机
Haojun Luo, J. Hui, A. Fayoumi
{"title":"A low power and delay multi-protocol switch with IO and network virtualization","authors":"Haojun Luo, J. Hui, A. Fayoumi","doi":"10.1109/HPSR.2013.6602287","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602287","url":null,"abstract":"Data centers connect a larger number of servers requiring IO and switches with low power and delay. Virtualization of IO and network is crucial for these servers, which run virtual processes for computing, storage, and applications. We propose using the PCI Express (PCIe) protocol and a new PCIe switch fabric for IO and switch virtualization. The switch fabric has little data buffering, allowing up to 512 physical 10 Gb/s PCIe 2.0 lanes to be connected via a switch fabric on a chip. The switch is scalable with adapters running multiple adaptation protocols, such as Ethernet over PCIe, PCIe over Internet, or FibreChannel over Ethernet. Such adaptation protocols allow integration of IO often required for disjoint data center applications such as storage and networking. The novel switch fabric based on space-time carrier sensing facilitates high bandwidth, low power, and low delay multiprotocol switching. To achieve Terabit switching, both time (high transmission speed) and space (multi-stage interconnection network) technologies are required. In this paper, we present the design of an up to 256 lanes Close-network of multistage crossbar switch fabric for PCIe system. The switch core consists of 32 16x16 crossbar sub-switches. We also propose a new output contention resolution algorithm utilizing an out-of-band protocol of Request-To-Send (RTS), Clear-To-Send (CTS) before sending PCIe packets through the switch fabric. Preliminary power and delay estimates are provided.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"7 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131541211","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
Collector-based cell reordering in load-balanced switch fabrics 负载均衡交换结构中基于收集器的单元重排序
S. Antonakopoulos, S. Fortune, R. McLellan, Lisa Zhang
{"title":"Collector-based cell reordering in load-balanced switch fabrics","authors":"S. Antonakopoulos, S. Fortune, R. McLellan, Lisa Zhang","doi":"10.1109/HPSR.2013.6602282","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602282","url":null,"abstract":"Load-balanced switch fabrics offer the promise of very high capacity without the requirement of increased operating rates. We provide a novel solution to the well-known cell reordering problem, which arises in load-balanced switch fabrics if different paths through the switch fabric have different delays. We give a simple sorting circuit, easily implemented in hardware, that can be placed in the final stage of the fabric. This minimizes the delay through the fabric and removes any constraints on operation of the first stage. We show that the sorting circuit can be implemented to operate at a rate of one cell per cycle; we give a probabilistic analysis of required queue occupancies, both at the sorting circuit and at midstage elements; we also briefly discuss congestion control in load-balanced switch fabrics.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121725920","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
On capacity provisioning in datacenter networks for full bandwidth communication 关于在数据中心网络中为全带宽通信提供容量
Wenda Ni, Changcheng Huang, Jing Wu
{"title":"On capacity provisioning in datacenter networks for full bandwidth communication","authors":"Wenda Ni, Changcheng Huang, Jing Wu","doi":"10.1109/HPSR.2013.6602291","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602291","url":null,"abstract":"Recent advances in datacenter network design have enabled full bandwidth communication based on the notion of Valiant load balancing. In this paper, we study from the link capacity viewpoint how such communication paradigm can be supported in the context of link failures, the study of which is currently absent. In particular, we target full bandwidth communication among all the servers, for all valid traffic patterns, and under k arbitrary link failures. We derive the minimum link capacity required on two typical datacenter topologies-VL2 and fat-tree. Our main finding is that given the same server scale, fat-tree requires less total link capacity than VL2 for 1 ≤ k ≤ n/4, where n denotes the port count of homogeneous switches used in fat-tree. For k > n/4, there exists a turning point from which VL2 becomes more capacity-efficient.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122501013","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
N-Cloud: Improving performance and security in cloud storage N-Cloud:提高云存储的性能和安全性
Fahad Alsolami, C. E. Chow
{"title":"N-Cloud: Improving performance and security in cloud storage","authors":"Fahad Alsolami, C. E. Chow","doi":"10.1109/HPSR.2013.6602319","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602319","url":null,"abstract":"In this paper we propose N-Cloud scheme which improves performance, availability, and confidentiality in cloud storage. N-Cloud provides availability by dividing/splitting a file into many chunks, and replicating in a non-overlapping manner these chunks into many cloud storages, based on security and reliability consideration. In this scheme, the chunks of a file can be encrypted concurrently while the encrypted chunks can be uploaded to geographical separated cloud storages in parallel. Same benefit can be achieved for the downloading and decrypting process. It greatly speeds up the processing and transfer. N-Cloud provides confidentiality by dividing/splitting a file into many chunks, encrypting all chunks, and distributing these chunks to many clouds. N-Cloud ensures that no one cloud has the whole file; the scheme will not be compromised unless an attacker breaks into all cloud storage. A preliminary results show significant performance improvement over existing schemes.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133962794","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
PIE: A lightweight control scheme to address the bufferbloat problem PIE:解决缓冲区膨胀问题的轻量级控制方案
Rong Pan, P. Natarajan, C. Piglione, M. Prabhu, V. Subramanian, F. Baker, Bill VerSteeg
{"title":"PIE: A lightweight control scheme to address the bufferbloat problem","authors":"Rong Pan, P. Natarajan, C. Piglione, M. Prabhu, V. Subramanian, F. Baker, Bill VerSteeg","doi":"10.1109/HPSR.2013.6602305","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602305","url":null,"abstract":"Bufferbloat is a phenomenon where excess buffers in the network cause high latency and jitter. As more and more interactive applications (e.g. voice over IP, real time video conferencing and financial transactions) run in the Internet, high latency and jitter degrade application performance. There is a pressing need to design intelligent queue management schemes that can control latency and jitter; and hence provide desirable quality of service to users. We present here a lightweight design, PIE (Proportional Integral controller Enhanced), that can effectively control the average queueing latency to a reference value. The design does not require per-packet extra processing, so it incurs very small overhead and is simple to implement in both hardware and software. In addition, the design parameters are self-tuning, and hence PIE is robust and optimized for various network scenarios. Simulation results, theoretical analysis and Linux testbed results show that PIE can ensure low latency and achieve high link utilization under various congestion situations.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125785928","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}
引用次数: 362
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学术官方微信