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

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

筛选
英文 中文
MPTCP solution for seamless local SIPTO mobility 无缝本地SIPTO移动性的MPTCP解决方案
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483099
Souheir Eido, P. Mitharwal, A. Gravey, Christophe Lohr
{"title":"MPTCP solution for seamless local SIPTO mobility","authors":"Souheir Eido, P. Mitharwal, A. Gravey, Christophe Lohr","doi":"10.1109/HPSR.2015.7483099","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483099","url":null,"abstract":"In this paper, we propose a method to support seamless mobility for sessions carried by SIPTO connections. Session continuity has been considered an issue to be solved within 3GPP, as none of the solutions proposed for Mobile IP directly apply in the context of LTE. As in some cases, typically when SIPTO relies on using Local Gateways (LGW), it is necessary to change the IP address allocated to a User Equipment (UE), an active session may be interrupted. We propose an MPTCP based solution within the LTE architecture to maintain a single session, initially carried over a given SIPTO connection, and then carried over another SIPTO connection initiated due to the mobility of user equipment (UE). We identify how MPTCP operates over the LTE architecture, and estimate whether the corresponding delay is compatible with session continuity.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"7 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":"129748329","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
Blind void filling in LR-EPONs: How efficient it can be? lr - epon的盲补效果如何?
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483116
Amr Elrasad, B. Shihada
{"title":"Blind void filling in LR-EPONs: How efficient it can be?","authors":"Amr Elrasad, B. Shihada","doi":"10.1109/HPSR.2015.7483116","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483116","url":null,"abstract":"This work proposes a novel blind void (idle periods) filling in Long-Reach Ethernet Passive Optical Networks (LR-EPONs) namely Size Controlled Batch Void Filling (SCBVF). We emphasize on reducing grant delays and hence reducing the average packet delay. SCBVF delay reduction is achieved by early flushing data during the idle time periods (voids) between allocated grants. The proposed approach can be integrated with almost all of the previously reported dynamic bandwidth allocation schemes. SCBVF is less sensitive to differential distance between ONUs and can work well in case of small differential distances compared to previously reported void filling schemes. We support our work by extensive simulation study considering bursty traffic with long range dependency. Numerical results show a delay reduction up to 35% compared to non-void filling scheme outperforming its main competitors that can achieve up to 7% delay reduction.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"31 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":"126453268","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 the dimensioning of survivable optical metro/core networks with dual-homed access 具有双归属接入的可生存光城域网/核心网的尺寸研究
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483089
J. Izquierdo-Zaragoza, M. Furdek, A. Nag, P. Monti, L. Wosinska, P. Pavón-Mariño
{"title":"On the dimensioning of survivable optical metro/core networks with dual-homed access","authors":"J. Izquierdo-Zaragoza, M. Furdek, A. Nag, P. Monti, L. Wosinska, P. Pavón-Mariño","doi":"10.1109/HPSR.2015.7483089","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483089","url":null,"abstract":"Long-reach passive optical networks (LR-PONs) are able to effectively support the growing demand of traffic originating from residential and business customers. Failures of metro/core (M/C) nodes serving the traffic to/from the access networks covered by LR-PONs, may potentially affect hundreds or thousands of customers. One way of guaranteeing 100% survivability from single-node failures is to apply dual-homing, where each LR-PON is connected to two M/C nodes, and combine it with node-disjoint dedicated-path protection (DPP). In this paper, we present a new approach to provide network survivability against single M/C node failures. Instead of applying dedicated path protection (DPP) strategy, which can require huge amount of extra resources, we combine an unprotected network design with a dynamic multilayer restoration algorithm. Our aim is to determine a suitable amount of resource overbuild (in terms of extra transponders) needed to provide average connection availability close to that guaranteed by DPP. Preliminary results show that dimensioning for the worst-case scenario among a set of predefined M/C node failures, i.e., the one disrupting the highest number of connections, yields to a cost-effective strategy requiring up to 35% less transponders than DPP, while offering the same average connection availability.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"93 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":"124664076","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
Optimizing link spectrum occupancy in elastic optical networks 弹性光网络中链路频谱占用优化
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483109
J. Comellas, M. Ruiz, G. Junyent
{"title":"Optimizing link spectrum occupancy in elastic optical networks","authors":"J. Comellas, M. Ruiz, G. Junyent","doi":"10.1109/HPSR.2015.7483109","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483109","url":null,"abstract":"This work focuses on spectrum assignment in Elastic Optical Networks. The accurate study about spectrum occupancy in a flexgrid link is carried out. As a result, the probability values of finding different connection sizes in a perfectly occupied spectrum are derived. It has been found that the possible states of a full spectrum window are described by the Fibonacci succession terms. After developing some rules on the best traffic profiles matching with this property, the proposal is assessed by means of simulation in a typical flexgrid link as well as at the whole network level.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"31 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":"121976098","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
Multi-option, multi-class path scheduling methods for advance reservation systems 提前预订系统的多选项、多类别路径调度方法
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483080
E. Soltanaghaei, M. Veeraraghavan
{"title":"Multi-option, multi-class path scheduling methods for advance reservation systems","authors":"E. Soltanaghaei, M. Veeraraghavan","doi":"10.1109/HPSR.2015.7483080","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483080","url":null,"abstract":"This work advances the state-of-art in path scheduling and route selection by considering multiple call classes and allowing users to provide multiple start-time options in their requests for bandwidth in advance-reservation systems. Our system model supports two call classes: User-Specified Start Times (USST) and Earliest-Start Time (EST). The USST class is suitable for applications such as remote visualization or 4K immersive video-conferencing, while the EST class is suitable for high-speed large file transfers. Two path-selection algorithms, Earliest Available Path (EAP) and Shortest Available Path (SAP), are considered. Given that most core network links are operated at low utilization to support failure-recovery, we focus our simulation study on low-load operation. At low loads, there is no significant difference in call-blocking rates between EAP and SAP, and therefore, we recommend choosing EAP to lower mean waiting time. Since file-transfers, unlike audio-video calls, do not have an intrinsic rate requirement, we studied the question of what rate to choose for EST calls, and found that if EST calls were assigned the full link capacity, call blocking rates and mean waiting times were higher than if EST calls were assigned half the link capacity. Finally, we studied inter-class effects, and recommend design choices that mitigate these effects.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":" 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131977727","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
Green frame aggregation scheme for Wi-Fi networks 用于Wi-Fi网络的绿色帧聚合方案
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483076
Maha Alaslani, Ahmad J. Showail, B. Shihada
{"title":"Green frame aggregation scheme for Wi-Fi networks","authors":"Maha Alaslani, Ahmad J. Showail, B. Shihada","doi":"10.1109/HPSR.2015.7483076","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483076","url":null,"abstract":"Frame aggregation is a major enhancement in the IEEE 802.11 family to boost the network performance. The increasing awareness about energy efficiency motivates the re-think of frame aggregation design. In this paper, we propose a novel Green Frame Aggregation (GFA) scheduling scheme that optimizes the aggregate size based on channel quality in order to minimize the consumed energy. GFA selects an optimal sub-frame size that satisfies the loss constraint for real-time applications as well as the energy budget of the ideal channel. This scheme is implemented and evaluated using a testbed deployment. The experimental analysis shows that GFA outperforms the conventional frame aggregation methodology in terms of energy efficiency by about 6× in the presence of severe interference conditions. Moreover, GFA outperforms the static frame sizing method in terms of network goodput while maintaining the same end-to-end latency.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"112 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":"131425680","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
A heuristic algorithm for network-wide local unambiguous node failure localization 基于启发式算法的全网局部无二义节点故障定位
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483088
László Gyimóthi, János Tapolcai
{"title":"A heuristic algorithm for network-wide local unambiguous node failure localization","authors":"László Gyimóthi, János Tapolcai","doi":"10.1109/HPSR.2015.7483088","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483088","url":null,"abstract":"This paper deals with fast node failure localization in optical networks with monitoring trails (m-trails). It is based on Network-wide local unambiguous failure localization, which enables every node to autonomously localize any single node failure in the network in a distributed and all-optical manner by inspecting the m-trails traversing through the node. A new and innovative heuristic algorithm is presented which is based on recursion and constrained matching algorithms in general graphs. Extensive simulation is conducted to examine the proposed heuristic in terms of the required cover length to achieve NL-UFL. In our experiments the new heuristic can reduce the computation time by 1000-10000 times compared to prior art.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"9 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":"122253862","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
Combinatorial error detection in linear encoders 线性编码器的组合误差检测
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483114
É. Hosszu, C. Fragouli, János Tapolcai
{"title":"Combinatorial error detection in linear encoders","authors":"É. Hosszu, C. Fragouli, János Tapolcai","doi":"10.1109/HPSR.2015.7483114","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483114","url":null,"abstract":"Linear error correction is widely implemented in millions of telecommunication devices to cope with unreliable or noisy communication channels. A common error in linear encoders is when some bits that are originally one in the generator matrix get erased and become zero - usually due to a soft error becoming a hard error or simply a physical impact on the device. The need to deal with this phenomenon has been recognized in the literature, although to the best of our knowledge no one has ever tried to diagnose erasure-type faults in an encoder. In this paper we focus on the situation when the linear encoder hardware unit becomes faulty and propose a novel combinatorial fault detection scheme based on group testing to diagnose its state with great efficiency in a quick manner. Furthermore we touch upon some solutions to compensate for at both the sender and the receiver side.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"4 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":"114738135","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
Looking for correlation between SPAM and visits on your websites 寻找垃圾邮件和访问你的网站之间的关系
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483092
M. Michalski
{"title":"Looking for correlation between SPAM and visits on your websites","authors":"M. Michalski","doi":"10.1109/HPSR.2015.7483092","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483092","url":null,"abstract":"In this paper, a system implemented in a web server for searching website crawlers which create a database of email addresses for spamming is presented. For every visitor the system generates fake and unique email addresses with hidden and stored data, serves them to the Internet, and waits for response. On the basis of the correlation between the email address used for spamming and information assigned to this address, the system points IP addresses which work for the \"bad systems\". This information can be used in further security systems as firewalls, intrusion detections systems (IDS) and intrusion prevention systems (IPS). A light version of the system which can be used by any administrator of the dynamic website is also presented.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"2012 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":"125644789","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
Stateful OpenFlow: Hardware proof of concept 有状态OpenFlow:概念的硬件证明
2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2015-07-01 DOI: 10.1109/HPSR.2015.7483105
S. Pontarelli, M. Bonola, G. Bianchi, A. Capone, C. Cascone
{"title":"Stateful OpenFlow: Hardware proof of concept","authors":"S. Pontarelli, M. Bonola, G. Bianchi, A. Capone, C. Cascone","doi":"10.1109/HPSR.2015.7483105","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483105","url":null,"abstract":"This paper presents a hardware implementation of Openstate, an extension of OpenFlow that allows performing stateful control functionalities directly inside the switch, without requiring the intervention of an external controller. The paper shows how, with a minimal reworking of the OpenFlow's basic architecture, and reusing the same building blocks, it is possible to greatly extend the intelligence of an OpenFlow switch allowing the offload of many control task directly in the switch. An FPGA based implementation of an Openstate prototype is here presented, the different architectural design choices are discussed, and the performance and limitations of the developed prototype are examinated. Finally, the paper proposes a discussion on the performance achievable by using an ASIC implementation of the OpenState switch1.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"273 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":"130910425","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}
引用次数: 30
首页 上一页 下一页 尾页
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学术官方微信