2011 IEEE 12th International Conference on High Performance Switching and Routing最新文献_第2页

StablePlus: A practical 100% throughput scheduling for input-queued switches StablePlus:一个实用的100%吞吐量调度输入队列交换机

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5985998

Yu Xia, H. J. Chao

引用次数: 5

Study of a hybrid OCDMA-WDM segmented ring for metropolitan area networks 城域网OCDMA-WDM混合分段环的研究

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986008

G. R. D. L. Santos, J. Hernández, M. Urueña, I. Seoane, D. Larrabeiti

{"title":"Study of a hybrid OCDMA-WDM segmented ring for metropolitan area networks","authors":"G. R. D. L. Santos, J. Hernández, M. Urueña, I. Seoane, D. Larrabeiti","doi":"10.1109/HPSR.2011.5986008","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986008","url":null,"abstract":"Optical Code Division Multiple Access (OCDMA) techniques have shown outstanding capabilities in the sharing of optical media, in particular in access networks. However, OCDMA systems may suffer from Multiple Access Interference (MAI) and other kinds of noise when many users access the shared media simultaneously, increasing the BER (Bit Error Rate) to unacceptable levels, that is, a situation at which all combined signals interfere and are lost. This work proposes a mixed OCDMA and Tunable Transmitter-Fixed Receiver (TT-FR) WDM and ring architecture at which the ring is split into small-size segments to limit the probability of MAI. Essentially, every segment in the ring has got two hub nodes (on the segment's head and tail) which forwards inter-segment traffic to other hub nodes on dedicated home wavelengths, thus making use of WDM. The access media inside the segment is shared between the nodes by means of OCDMA, and code reuse is possible on different segments. Our performance analysis shows how to split a given ring into segments in order to minimise the BER due to multiple users accessing the network and allow for high bit-rates for a given traffic load. In addition, we analyse the possibility of introducing Forward Error Correction (FEC) at a moderate overhead cost to improve performance.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802467","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

Performance of a software switch 软件交换机的性能

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986035

Nuutti Varis, J. Manner

引用次数: 7

High-performance implementation of in-network traffic pacing 高性能实现网内流量踱步

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5985997

Y. S. Hanay, Abhishek Dwaraki, T. Wolf

引用次数: 8

Improvement of maximum admissible QoS traffic by traffic observations 通过流量观察改进最大允许QoS流量

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986020

T. Mikoshi, T. Takenaka, Takayuki Fujiwara, A. Masuda, K. Shiomoto

引用次数: 0

Shift-based pattern matching for compressed web traffic 基于shift的模式匹配压缩web流量

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986030

A. Bremler-Barr, Yaron Koral, Victor Zigdon

{"title":"Shift-based pattern matching for compressed web traffic","authors":"A. Bremler-Barr, Yaron Koral, Victor Zigdon","doi":"10.1109/HPSR.2011.5986030","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986030","url":null,"abstract":"Compressing web traffic using standard GZIP is becoming both popular and challenging due to the huge increase in wireless web devices, where bandwidth is limited. Security and other content based networking devices are required to decompress the traffic of tens of thousands concurrent connections in order to inspect the content for different signatures. The overhead imposed by the decompression inhibits most devices from handling compressed traffic, which in turn either limits traffic compression or introduces security holes and other dysfunctionalities. The ACCH algorithm [1] was the first to present a unified approach to pattern matching and decompression, by taking advantage of information gathered in the decompression phase to accelerate the pattern matching. ACCH accelerated the DFA-based Aho-Corasick multi-pattern matching algorithm. In this paper, we present a novel algorithm, SPC (Shift-based Pattern matching for Compressed traffic) that accelerates the commonly used Wu-Manber pattern matching algorithm. SPC is simpler and has higher throughput and lower storage overhead than ACCH. Analysis of real web traffic and real security devices signatures shows that we can skip scanning up to 87.5% of the data and gain performance boost of more than 51% as compared to ACCH. Moreover, the additional storage requirement of the technique requires only 4KB additional information per connection as compared to 8KB of ACCH.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132162499","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}

引用次数: 10

NAF conversion: An efficient solution for the range matching problem in packet filters NAF转换:包过滤中范围匹配问题的有效解决方案

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5985999

Nizar Ben Neji, A. Bouhoula

引用次数: 9

Assessing network vulnerability under probabilistic region failure model 概率区域失效模型下的网络脆弱性评估

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986021

Xiaoliang Wang, Xiaohong Jiang, A. Pattavina

{"title":"Assessing network vulnerability under probabilistic region failure model","authors":"Xiaoliang Wang, Xiaohong Jiang, A. Pattavina","doi":"10.1109/HPSR.2011.5986021","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986021","url":null,"abstract":"The mission critical network infrastructures are facing potential large region threats, both intentional (like EMP attack, bomb explosion) and natural (like earthquake, flooding). The available research on region failure related vulnerability studies generally adopt a kind of simple “deterministic” region failure models, which can not capture some important features of real region failure scenarios, where a network component in the region only fails with certain probability, and more importantly, such failure probability tends to vary with both its dimension and its distance to failure center. In this paper, we provide a more general “probabilistic” region failure model to capture the key features of a region failure and apply it for the network vulnerability assessment. To facilitate such assessment, we adopt a grid partition-based scheme to estimate various statistical network metrics under a random region failure. A theoretical framework is also established to determine a suitable grid partition such that a specified estimation error requirement is satisfied. The grid partition technique is also useful for identifying the vulnerable zones of a network, which can guide network designers to initiate proper network protection against such failures. The work in this paper helps us more deeply understand the network vulnerability behavior under region failure and facilitates the design and maintenance of future highly survivable mission critical networks.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045100","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}

引用次数: 47

Link dimensioning for fractional Brownian input 分数布朗输入的连杆尺寸

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986019

Jiongze Chen, R. Addie, M. Zukerman

引用次数: 1

Memory-memory-memory Clos-network packet switches with in-sequence service 内存-内存-内存使用顺序服务关闭网络分组交换机

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986014

Z. Dong, R. Rojas-Cessa, E. Oki

引用次数: 19