2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)最新文献_第2页

Cooperative load balancing for hierarchical SDN controllers 分层SDN控制器的协同负载均衡

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525646

H. Selvi, Gürkan Gür, Fatih Alagöz

引用次数: 40

Adaptive elastic spectrum allocation based on traffic fluctuation estimate in flexible OFDM-based optical networks 基于业务量波动估计的柔性ofdm光网络自适应弹性频谱分配

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525643

M. Chino, T. Miyazaki, E. Oki, S. Okamoto, N. Yamanaka

{"title":"Adaptive elastic spectrum allocation based on traffic fluctuation estimate in flexible OFDM-based optical networks","authors":"M. Chino, T. Miyazaki, E. Oki, S. Okamoto, N. Yamanaka","doi":"10.1109/HPSR.2016.7525643","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525643","url":null,"abstract":"A flexible orthogonal frequency-division multiplexing optical network enables to change bandwidth flexibly by changing the number of sub-carriers. We consider that users request to dynamically change the number of sub-carriers. In this context, the network resources can be used more efficiently. The dynamic bandwidth change needs a certain time. Service centric resource allocation must be considered in terms of waiting time to change the number of sub-carriers. If the user demands drastically increase such as a disaster priority telephone service, a waiting time for bandwidth changes is not tolerated because emergency is time-critical. This is caused by a chain-change of bandwidth such as a multiple-car pileup. This paper proposes a grouped elastic spectrum allocation scheme to satisfy the tolerable waiting time of the service in an optical fiber link. Spectrums are grouped to restrict a waiting time in the proposed scheme. In addition, the proposed scheme determines a margin bandwidth with neighbor spectrums to prevent frequent reallocation by estimating real traffic behavior. Numerical results show that a required bandwidth can be saved with satisfying waiting time constraints. Additionally measurement granularity is discussed.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654518","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

An efficient flow monitoring algorithm using a flexible match structure 一种基于柔性匹配结构的高效流量监测算法

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525663

Ze Yang, K. Yeung

引用次数: 1

Traffic splitting technique using meter table in software-defined network 软件定义网络中基于表的流量分流技术

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525648

N. Kitsuwan, E. Oki

引用次数: 6

Improving the Tor traffic distribution with circuit switching method 用电路交换方法改进Tor流量分配

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525647

Kale Timothy Girry, S. Ohzahata, Celimuge Wu, Toshihiko Kato

引用次数: 3

SNS information-based network control system developed on FLARE experiment environment 基于SNS的信息化网络控制系统是在FLARE实验环境下开发的

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525654

Haruka Yanagida, A. Nakao, Shu Yamamoto, Saneyasu Yamaguchi, M. Oguchi

引用次数: 0

Source-based wavelength-path protection scheme with tree-shaped backup-path configuration in WDM networks WDM网络中树形备份路径配置的基于源的波长路径保护方案

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525639

M. Hayashitani, S. Okamoto, E. Oki, N. Yamanaka

引用次数: 3

Two-service analytical model for partially-shared elastic optical link spectrum 部分共享弹性光链路频谱的双业务分析模型

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525642

Joobum Kim, Shuyi Yan, A. Fumagalli, E. Oki, N. Yamanaka

{"title":"Two-service analytical model for partially-shared elastic optical link spectrum","authors":"Joobum Kim, Shuyi Yan, A. Fumagalli, E. Oki, N. Yamanaka","doi":"10.1109/HPSR.2016.7525642","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525642","url":null,"abstract":"Elastic Optical Networks (EONs) have the potential to improve the fiber spectrum utilization by allocating spectrum resources to multiple traffic requests proportionally to the amount of carried traffic. However, achieving high spectrum utilization in this elastic scenario is hindered by the resulting spectrum fragmentation. A number of studies have addressed and made attempts to mitigate spectrum fragmentation. Most of these studies are based on simulation techniques and target the overall blocking probability experienced by the offered traffic requests due to the lack of available spectrum resources. Some studies have also shown that blocking probability in EON can be uneven, i.e., high-rate circuit requests are more likely to be blocked when compared to low-rate requests due to the shortage of contiguously available spectrum resources. The contribution of this paper is to extend an existing Markov Chain (MC) model previously proposed by the authors to quantify blocking probability in a two-service elastic fiber link. The model extension accounts for a self-limited and partial sharing of the fiber spectrum to accommodate the two types of service. The MC model is used to quantify both the blocking probability and its fairness across the two types of service, documenting how the EON uneven blocking behavior can be significantly mitigated by performing partial (as opposed to full) sharing of the fiber spectrum.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133730978","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

Management model of virtualized network resources for trading between owner and user 用于所有者和用户之间交易的虚拟化网络资源管理模型

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525666

N. Kamiyama, K. Shiomoto

{"title":"Management model of virtualized network resources for trading between owner and user","authors":"N. Kamiyama, K. Shiomoto","doi":"10.1109/HPSR.2016.7525666","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525666","url":null,"abstract":"With network virtualization, users of network resources, i.e., service providers (SPs), can be separated from the owners of the network resources, i.e., infrastructure providers (InPs). In this case, SPs are not required to own the network infrastructure, and they can focus on providing network services without constructing and managing the network infrastructure. This is expected to encourage small and medium-sized enterprises to start various types of network services. However, to promote the separation between owners and users of network resources, it is important to suitably define the management model of network resources that is necessary to trade resources between InPs and SPs. In this paper, we summarize the requirements for a management model of network resources considering the aspects of both InPs and SPs and propose a management model consisting of allocation blocks (ABs) that satisfies these requirements. We also propose a method of optimally designing the ABs for a given time-series of resource demand by SPs. Through numerical evaluation using the actual log data of a VoD service, we clarify that the proposed method can reduce the total fee paid by SPs compared with a straightforward approach, i.e., uniform ABs.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"108 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132983489","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

A low-latency multipath routing without elephant flow detection for data centers 数据中心的低延迟多路径路由，无需大象流检测

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525638

Suchandra Chakraborty, Chien Chen

{"title":"A low-latency multipath routing without elephant flow detection for data centers","authors":"Suchandra Chakraborty, Chien Chen","doi":"10.1109/HPSR.2016.7525638","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525638","url":null,"abstract":"Multipath routing in data center has been studied intensively in recent years in order to minimize the finish time of data transfer or the latency of message sending. Existing scheme of splitting traffic at the granularity of packets can cause reordered packets within a TCP flow. Another alternative scheme of splitting traffic at the granularity of a flow avoids packet reordering but may increase latency as it does not differentiate between elephant and mice flows. A newer efficient approach is to split elephants down into many mice flows, and distribute them uniformly at random over all paths. However, elephant detection is mandatory and the performance is largely depends on accuracy of the elephant detection. We propose, a simple yet effective multipath routing that leverage the same idea of splitting elephants down into many mice flows but without any farther requirement of elephant flow detection by using the hard time-out based flow removal feature of OpenFlow switches. Furthermore, we integrate a VLAN based routing scheme to addresses the challenges of cost-effective scalability. As per our simulation using mininet, we found a 44% reduction in overall flow completion time (FCT) compared to TinyFlow and 32% reduction in the consumption of flow table entry resources inside of aggregate switches in datacenter.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356003","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}

引用次数: 11