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

A new load balancing mechanism for improved video delivery over Wireless Mesh Networks 一种新的负载平衡机制，用于改进无线网状网络上的视频传输

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602303

Adriana Hava, Gabriel-Miro Muntean, Y. Ghamri-Doudane, John Murphy

引用次数: 8

A study on network control method in Elastic Lambda Aggregation Network (EλAN) 弹性Lambda聚合网络(EλAN)网络控制方法研究

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602286

Takehiro Sato, Kazumasa Tokuhashi, H. Takeshita, S. Okamoto, N. Yamanaka

引用次数: 26

Hybrid optoelectronic packet switch with multiple wavelength conversion through an electronic packet switch 通过电子分组交换机实现多波长转换的混合式光电分组交换机

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602297

Z. Dong, R. Rojas-Cessa

引用次数: 1

Energy-Aware Two Link-Disjoint Paths Routing 能量感知的两条链路不相交路径路由

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602298

Gongqi Lin, S. Soh, M. Lazarescu, Kwan-Wu Chin

引用次数: 4

Traffic measurement and analysis in an organic enterprise data center 有机企业数据中心的流量测量与分析

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602289

Ashkan Aghdai, Fan Zhang, N. Dasanayake, Kang Xi, H. J. Chao

{"title":"Traffic measurement and analysis in an organic enterprise data center","authors":"Ashkan Aghdai, Fan Zhang, N. Dasanayake, Kang Xi, H. J. Chao","doi":"10.1109/HPSR.2013.6602289","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602289","url":null,"abstract":"Enterprise data centers (EDCs) are critical infrastructure to large enterprises, government agencies, research institutions, etc. They are used to support a variety of off-the-shelf and customized services. EDCs are different from cloud data centers (CDCs) in two major aspects. Firstly, an EDC is usually built over time and consists of old and new equipment. Secondly, the type of services and applications in EDCs are quite different from those in CDCs. Therefore, we expect that the traffic characteristics in EDCs would also be different from those in CDCs. While most existing data center measurements were from CDCs, we performed extensive traffic measurement and analysis in an EDC that provided multiple services to over a million users. We present the data center architecture, measurement methodology, measurement results, and analysis. The results include traffic matrix, traffic distribution, flow characteristics, and TCP characteristics. Our research reveals that the traffic characteristics in the EDC are indeed quite different from the reported results in CDCs. For example, the traffic matrix tends to be sparse rather than all-to-all. Based on the analysis we provide a few guidelines for EDC design, optimization, and anomaly detection. As the first most extensive study on EDC traffic, our work provides valuable information to future EDC design and implementation, and also helps researchers develop insights into the differences and similarities between EDCs and CDCs.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"25 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":"131970090","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}

引用次数: 12

Summary-aided bloom filter for high-speed named data forwarding 用于高速命名数据转发的摘要辅助布隆滤波器

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602321

Dagang Li, Pei Chen

引用次数: 1

Multihomed optical packet and circuit integrated network based on hierarchical address allocation 基于分层地址分配的多主光分组电路集成网络

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602296

H. Furukawa, K. Fujikawa, T. Miyazawa, N. Wada, H. Harai

{"title":"Multihomed optical packet and circuit integrated network based on hierarchical address allocation","authors":"H. Furukawa, K. Fujikawa, T. Miyazawa, N. Wada, H. Harai","doi":"10.1109/HPSR.2013.6602296","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602296","url":null,"abstract":"We have proposed an optical packet and circuit integrated (OPCI) network which provides over Tbps capacity with low power consumption by optical technologies and deals with diversity of services from best-effort service to quality of service guaranteed service by packet and circuit switching schemes. Recently, we developed an integrated optical packet and circuit switch (OPS/OCS) node and constructed an OPCI ring network testbed. The integrated OPS/OCS node has a function to encapsulate Internet Protocol (IP) packets coming from client networks into optical packets. In this paper, we discuss about how to incorporate OPCI networks into current IP-based wide area networks. For the first time, we experimentally demonstrate an OPCI network testbed incorporated into a multihomed network where IP addresses are hierarchically allocated. The multihomed network provides multiple links with different characteristics such as a 100 Gbps optical packet link for high capacity and shared bandwidth services, a 10 Gbps optical path link for high quality and dedicated bandwidth services, and a 10Gbit Ethernet link for low cost services. Therefore, users can choose adequate link technologies according to application or traffic conditions. We successfully verify that high definition video data is efficiently transported by switching link technologies in the multihomed network.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"83 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":"115082322","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

Link-coloring based scheme for multicast and unicast protection 基于链路着色的组播和单播保护方案

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602285

Y. Bejerano, P. Koppol

{"title":"Link-coloring based scheme for multicast and unicast protection","authors":"Y. Bejerano, P. Koppol","doi":"10.1109/HPSR.2013.6602285","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602285","url":null,"abstract":"We propose a computationally efficient link-coloring based scheme that facilitates end-to-end protection for dynamic multicast and unicast connections. For a given source node, links are colored as red or blue such that, for any destination node, the red and blue paths are guaranteed to be node disjoint. Red and blue trees, constructed using only the red and blue links, respectively, always form redundant trees (RTs) independent of the used tree selection method. RTs connect the source of a multicast connection to all its destinations in such a way that in the event of a single link or node failure in the network, every destination is still connected to the source in at least one of the two trees. In network topologies where such RTs cannot be constructed due to lack of required path diversity, our scheme constructs two multicast trees such that the red and blue paths to any destination node only share cut links or nodes. To our knowledge, our scheme is the first that can construct such RTs. Although finding the optimal RTs is known to be NP-complete, extensive simulations show that our scheme calculates near optimal RTs and substantially outperforms other solutions.","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":"129617795","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

Load balancing in wavelength-routing cloud data centers 波长路由云数据中心的负载均衡

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602314

H. Rastegarfar, L. Rusch, A. Leon-Garcia

引用次数: 2

Cost and delay tradeoff in three-stage switch architecture for data center networks 数据中心网络三级交换架构的成本和延迟权衡

2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2013-07-08 DOI: 10.1109/HPSR.2013.6602290

Shu Fu, Bin Wu, Xiaohong Jiang, A. Pattavina, Lei Zhang, Shizhong Xu

{"title":"Cost and delay tradeoff in three-stage switch architecture for data center networks","authors":"Shu Fu, Bin Wu, Xiaohong Jiang, A. Pattavina, Lei Zhang, Shizhong Xu","doi":"10.1109/HPSR.2013.6602290","DOIUrl":"https://doi.org/10.1109/HPSR.2013.6602290","url":null,"abstract":"Data center networks (DCNs) generally adopt Clos network with crossbar middle switches to achieve non-blocking data switching among the servers, and the number of middle switches is proportional to the number of ports of the aggregation switches in a fixed manner. Besides, reconfiguration overhead of the switches is generally ignored, which may contradict the engineering practice. In this paper, we consider batch scheduling based packet switching in DCNs with reconfiguration overhead at each middle switch, which inevitably leads to packet delay. With existing state-of-the-art traffic matrix decomposition algorithms, we can generate a set of permutations, each of which stands for the configuration of a middle switch. By reconfiguring each middle switch to fulfill multiple configurations in parallel with others, we reveal that a tradeoff exists between packet delay and switch cost (denoted by the number of middle switches), while performance guaranteed switching with bounded packet delay can be achieved without any packet loss. Based on the tradeoff, we can minimize the number of middle switches (under a given packet delay bound) and an overall cost metric (by translating delay into a comparable cost factor), as well as formulating criterions for choosing a matrix decomposition algorithm. This provides a flexible way to reduce the number of middle switches by slightly enlarging the packet delay bound.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"26 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":"126167073","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