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

2007 Workshop on High Performance Switching and Routing最新文献

筛选
英文 中文
Reinforcing State-Dependent N Best Quality of Service Routes in Communication Networks 通信网络中状态依赖N最佳服务质量路由的增强
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281269
A. Mellouk, S. Hoceini
{"title":"Reinforcing State-Dependent N Best Quality of Service Routes in Communication Networks","authors":"A. Mellouk, S. Hoceini","doi":"10.1109/HPSR.2007.4281269","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281269","url":null,"abstract":"In the context of modern high-speed Internet network, routing is often complicated by the notion of guaranteed quality of service (QoS), which can either be related to time, packet loss or bandwidth requirements: constraints related to various types of QoS make some routing inacceptable. Due to emerging real-time and multimedia applications, efficient routing of information packets in dynamically changing communication network requires that as the load levels, traffic patterns and topology of the network change, the routing policy also adapts. We focused in this paper on QoS based routing by developing a neuro-dynamic programming to construct dynamic state-dependent routing policies. In this paper, we propose an approach based on adaptive algorithm for packet routing using reinforcement learning called N best optimal path Q routing algorithm (NOQRA) which optimizes two criteria: cumulative cost path (or hop count if each link cost =1) and end-to-end delay. A load balancing policy depending on a dynamical traffic path probability distribution function is also defined and embodied in NOQRA to characterize the distribution of the traffic over the N Best Paths. Numerical results obtained with OPNET simulator for different levels of traffic's load show that NOQRA gives better results compared to standard optimal path routing and Q-routing algorithm based on Q-learning paradigm.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127495124","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
Optical-to-Wireless-Integration Cost Modeling 光与无线集成成本建模
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281222
Peng Lin, Ting Wang, Junqiang Hu, Yoshihiko Suemurat, Shinya Nakamurat, Chunming Qiaot
{"title":"Optical-to-Wireless-Integration Cost Modeling","authors":"Peng Lin, Ting Wang, Junqiang Hu, Yoshihiko Suemurat, Shinya Nakamurat, Chunming Qiaot","doi":"10.1109/HPSR.2007.4281222","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281222","url":null,"abstract":"The next generation network (NGN) may be regarded as a fresh broadband architecture that best utilizes and combines the major advances in optical, wireless, and computer communication networking of the past decade. Attractive business opportunities will be opened by the NGN, but cost-effectiveness in building and operating it remains a crucial challenge that can differentiate a profitable implementation strategy from one that is merely \"hype\". This paper proposes a promising PON+WiMax architecture for optical-wireless-integration (OWI) and a cost model for this architecture that considers the related optimization issues. Results from initial use of this cost model compare OWI with other existing solutions for broadband access, showing superior cost-effectiveness for the OWI solution as well as the potential for further reducing capital and operating expenses.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115022729","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}
引用次数: 14
One Algorithm to Match Them All: On a Generic NIPS Pattern Matching Algorithm 一种匹配所有模式的算法:一种通用NIPS模式匹配算法
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281234
Y. Weinsberg, S. Tzur-David, D. Dolev, T. Anker
{"title":"One Algorithm to Match Them All: On a Generic NIPS Pattern Matching Algorithm","authors":"Y. Weinsberg, S. Tzur-David, D. Dolev, T. Anker","doi":"10.1109/HPSR.2007.4281234","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281234","url":null,"abstract":"Today's network intrusion prevention systems (NIPS) provide an important defense mechanism against security threats. The detection of network attacks utilizes a highspeed pattern matching algorithm that can be implemented in either hardware or software. Adapting a software-based pattern matching algorithm to hardware-based device is a complicated task. This paper presents a cost effective multi-pattern matching algorithm based on Field Programmable Gate Arrays (FPGAs) and standard RAM. The algorithm achieves line-rate speed, which is several orders of magnitude faster than the current state of the art, while attaining similar accuracy of detection. The algorithm can be easily adapted to operate in hardware-based NIPS and attain even higher speed by utilizing a TCAM memory.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122458589","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
Packet Loss Analysis of Synchronous Buffer-less Optical Switch with Shared Limited Range Wavelength Converters 共享有限波长转换器的同步无缓冲光开关丢包分析
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281243
C. Raffaelli, M. Savi, N. Akar, Ezhan Karasan
{"title":"Packet Loss Analysis of Synchronous Buffer-less Optical Switch with Shared Limited Range Wavelength Converters","authors":"C. Raffaelli, M. Savi, N. Akar, Ezhan Karasan","doi":"10.1109/HPSR.2007.4281243","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281243","url":null,"abstract":"Application of synchronous optical switches in optical packet/burst switched networks is considered. The shared per node architectural concept, where wavelength converters are shared among all input and output channels, is applied for contention resolution in the wavelength domain. A semi-analytical traffic model suitable to represent the different contributions to packet loss is proposed and validated. Full and limited range wavelength conversion capabilities are considered, and loss results obtained to support switch design. An approximated fully analytical approach for the limited range case is also described and comparison with simulation results is presented to assess the capability to capture the main aspects of packet loss behavior.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117076020","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
Load-balanced Three-stage Switch Architecture 负载均衡的三级交换机架构
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281253
Bing Hu, K. Yeung
{"title":"Load-balanced Three-stage Switch Architecture","authors":"Bing Hu, K. Yeung","doi":"10.1109/HPSR.2007.4281253","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281253","url":null,"abstract":"A load-balanced two-stage switch is scalable and can provide close to 100% throughput. Its major problem is that packets can be mis-sequenced when they arrive at output ports. In a recent work, the packet mis-sequencing problem is elegantly solved by a feedback-based two-stage switch architecture. In this paper, we extend the feedback-based switch architecture from two-stage to three-stage to further cut down packet delay. The idea is to map the heavy flows to experience less middle-stage port delay using the switch fabric in the third stage. We show that the resulting three-stage architecture also ensures in-order packet delivery and close to 100% throughput. To identify heavy flows, a simple and practical traffic matrix estimation algorithm is also proposed. As compared with the original feedback-based two-stage switch architecture, the three-stage switch can cut down the delay performance by as large as 43.4% for a 32times32 switch under a hot-spot traffic pattern with input load at p=0.95. For random uniform traffic, the saving in delay is about 8%.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124663258","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
A Link State Advertisement Protocol for Optical Transparency Islands 光学透明岛的链路状态通告协议
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281218
S. Das, R. Tabrizi, P. Monti, M. Tacca, A. Fumagalli
{"title":"A Link State Advertisement Protocol for Optical Transparency Islands","authors":"S. Das, R. Tabrizi, P. Monti, M. Tacca, A. Fumagalli","doi":"10.1109/HPSR.2007.4281218","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281218","url":null,"abstract":"Plug and play optical (PPO) nodes enable fast, re-configurable, and flexible ad hoc deployment of optical networks. Once plugged, the PPO nodes provide all-optical circuits between client nodes to alleviate the electronic processing bottleneck of high speed networks. To offer these wavelength routing functionalities to client nodes the PPO nodes must self-adjust to possible changes of the optical physical topology and fiber propagation characteristics. To discover such changes the PPO nodes must make use of a link state advertisement (LSA) protocol that is scalable in the number of plugged PPO nodes. This paper describes a scalable LSA protocol with constrained message flooding to match the limited propagation reach of the optical signal, i.e., the PPO node transparency island (TI). Scalability is thus achieved naturally by limiting the link state advertisement scope to only those PPO nodes that need to receive the link updates. As discussed in the paper, the proposed protocol appears to be a viable solution when the TI size is relatively small, e.g., in optical networks without signal regeneration.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126799807","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
Load Balanced Two-Stage Switches Using Arrayed Waveguide Grating Routers 使用阵列波导光栅路由器的负载平衡两级交换机
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281264
Xin Wang, K. Yeung
{"title":"Load Balanced Two-Stage Switches Using Arrayed Waveguide Grating Routers","authors":"Xin Wang, K. Yeung","doi":"10.1109/HPSR.2007.4281264","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281264","url":null,"abstract":"Constructing a load balanced two-stage switch using optical switch fabrics must properly address the non-negligible amount of switch reconfiguration overhead. Unlike other optical switch fabrics, an NtimesN arrayed waveguide grating router (AWGR) allows N2 parallel connections (one on each wavelength) established between its N inputs and N outputs. This eliminates the need for switch reconfigurations. In this paper, we design a load-balanced two-stage switch using AWGRs. In particular, we adopt the efficient feedback-based two-stage switch architecture. The key issue is how to implement the joint sequence of N switch configurations logically in AWGR. We show that the resulting logical joint sequence inherits the original staggered symmetry property as well as the in-order packet delivery property. Since building a large sized AWGR is difficult, a systematic approach of constructing large AWGR from smaller AWGR modules is also proposed. Simulations show that the feedback-based two-stage switch using AWGRs gives an excellent overall delay-throughput performance under various traffic conditions.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116269950","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
An Efficient Approximate Markovian Model for Optical Packet Switches Employing Partial Buffer Sharing Mechanism under Self-Similar Traffic Input 自相似流量输入下采用部分缓冲共享机制的光分组交换机的高效近似马尔可夫模型
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281232
M. R. Perati, Shou-Kuo Shao, C. Chang, Jingshown Wu
{"title":"An Efficient Approximate Markovian Model for Optical Packet Switches Employing Partial Buffer Sharing Mechanism under Self-Similar Traffic Input","authors":"M. R. Perati, Shou-Kuo Shao, C. Chang, Jingshown Wu","doi":"10.1109/HPSR.2007.4281232","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281232","url":null,"abstract":"In this paper, we propose an efficient approximate Markovian model for optical packet switch (OPS) employing partial buffer sharing (PBS) mechanism under self-similar traffic input The computation complexity could be greatly reduced while retaining satisfactory accuracy. Accordingly, we investigate and analyze both the short term and long term performance measures. Our model is useful in performing the optimal buffer control for OPS employing PBS to provide differentiated services (DiffServ) under self-similar traffic input.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131357553","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}
引用次数: 14
Multi-layer Traffic Engineering Experimental System in IP Optical Network IP光网络多层流量工程实验系统
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281271
D. Shimazaki, E. Oki, K. Shiomoto
{"title":"Multi-layer Traffic Engineering Experimental System in IP Optical Network","authors":"D. Shimazaki, E. Oki, K. Shiomoto","doi":"10.1109/HPSR.2007.4281271","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281271","url":null,"abstract":"We developed distributed-controlled multi-layer traffic engineering system. There is no previous works that report the system. Therefore, we can not confirm feasibility and scalability of the system. In this paper, we report an experiment on our system consisting of Internet protocol (IP) routers and optical cross-connects (OXCs). In this system, control is provided by generalized multi-protocol label switching (GMPLS) and IP network topology and IP routes are dynamically reconfigured to suit traffic characteristics. These functions prevent traffic congestion as well as any decrease in link utilization rates. We had experiments to test behavior of the routers and OXCs depending on traffic characteristics. We cleared that the distributed-controlled multi-protocol label switching (MPLS)/GMPLS traffic engineering system was feasible and scalable by the experiments.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115156406","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
Decoupling Maximal Size Matching Schedulers for Scalable Electro-Optical Switches 可扩展电光开关的解耦最大尺寸匹配调度
2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281252
M. Rodelgo-Lacruz, F. González-Castaño, C. López-Bravo
{"title":"Decoupling Maximal Size Matching Schedulers for Scalable Electro-Optical Switches","authors":"M. Rodelgo-Lacruz, F. González-Castaño, C. López-Bravo","doi":"10.1109/HPSR.2007.4281252","DOIUrl":"https://doi.org/10.1109/HPSR.2007.4281252","url":null,"abstract":"In this paper we propose a novel scaling approach that combines the advantages of the fully decoupled Birkhoff-von Neumann architecture and the low latency of maximal size matching (MSM) schedulers, to meet the highly demanding performance requirements of electro-optical switches. We identify a sufficient condition for the stability of a decoupled MSM scheduler. The particular case of decoupled iSLIP is studied.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134026092","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
下一页 尾页
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学术官方微信