Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5985998
Yu Xia, H. J. Chao
This paper proposes a practical stable packet scheduling algorithm for input-queued switches, called StablePlus, which combines a stable matching with a heuristic matching. It not only achieves 100% throughput under any admissible traffic but also has good delay performance. StablePlus can be implemented with today's technology for high line rates, e.g., 100Gbps, and a relatively large input-queued switch, e.g., a few hundred ports.
{"title":"StablePlus: A practical 100% throughput scheduling for input-queued switches","authors":"Yu Xia, H. J. Chao","doi":"10.1109/HPSR.2011.5985998","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5985998","url":null,"abstract":"This paper proposes a practical stable packet scheduling algorithm for input-queued switches, called StablePlus, which combines a stable matching with a heuristic matching. It not only achieves 100% throughput under any admissible traffic but also has good delay performance. StablePlus can be implemented with today's technology for high line rates, e.g., 100Gbps, and a relatively large input-queued switch, e.g., a few hundred ports.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116344580","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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986008
G. R. D. L. Santos, J. Hernández, M. Urueña, I. Seoane, D. Larrabeiti
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.
{"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":"23 1","pages":"0"},"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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986035
Nuutti Varis, J. Manner
Software switching has been largely dismissed as an inefficient option compared to hardware switching, both in terms of cost and performance. Recent increases in processing power for commodity hardware has given reason to revisit software switching. The flexibility of a commodity hardware, software based platform allows us to rapidly create prototypes, while the increased performance of the hardware is starting to enable software based network devices to be used in production environments. Combining these two aspects of commodity hardware based switching has led us to create our own prototype implementation of a next generation frame forwarding protocol. In this paper, we detail the architecture of our implementation and compare the performance of Ethernet switching platforms to our implementation with a synthetic benchmark, designed to measure the maximum frame forwarding rate of the platforms. We explore the throughput characteristics of all platforms in single- and multi core configurations, while keeping the rest of the platform configuration as identical as possible.
{"title":"Performance of a software switch","authors":"Nuutti Varis, J. Manner","doi":"10.1109/HPSR.2011.5986035","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986035","url":null,"abstract":"Software switching has been largely dismissed as an inefficient option compared to hardware switching, both in terms of cost and performance. Recent increases in processing power for commodity hardware has given reason to revisit software switching. The flexibility of a commodity hardware, software based platform allows us to rapidly create prototypes, while the increased performance of the hardware is starting to enable software based network devices to be used in production environments. Combining these two aspects of commodity hardware based switching has led us to create our own prototype implementation of a next generation frame forwarding protocol. In this paper, we detail the architecture of our implementation and compare the performance of Ethernet switching platforms to our implementation with a synthetic benchmark, designed to measure the maximum frame forwarding rate of the platforms. We explore the throughput characteristics of all platforms in single- and multi core configurations, while keeping the rest of the platform configuration as identical as possible.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134228919","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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5985997
Y. S. Hanay, Abhishek Dwaraki, T. Wolf
Optical packet switching networks promise to provide high-speed data communication and serve as the foundation of the future Internet. A key technological problem is the very small size of packet buffers that can be implemented in the optical domain. Existing protocols, for example the transmission control protocol, do not perform well in such small-buffer networks. To address this problem, we have proposed techniques for actively pacing traffic to ensure that traffic bursts are reduced or eliminated and thus do not cause packet losses in routers with small buffers. In this paper, we present the design and prototype of a hardware implementation of a packet pacing system based on the NetFPGA system. Our results show that traffic pacing can be implemented with few hardware resources and without reducing system throughput. Therefore, we believe traffic pacing can be deployed widely to improve the operation of current and future networks.
{"title":"High-performance implementation of in-network traffic pacing","authors":"Y. S. Hanay, Abhishek Dwaraki, T. Wolf","doi":"10.1109/HPSR.2011.5985997","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5985997","url":null,"abstract":"Optical packet switching networks promise to provide high-speed data communication and serve as the foundation of the future Internet. A key technological problem is the very small size of packet buffers that can be implemented in the optical domain. Existing protocols, for example the transmission control protocol, do not perform well in such small-buffer networks. To address this problem, we have proposed techniques for actively pacing traffic to ensure that traffic bursts are reduced or eliminated and thus do not cause packet losses in routers with small buffers. In this paper, we present the design and prototype of a hardware implementation of a packet pacing system based on the NetFPGA system. Our results show that traffic pacing can be implemented with few hardware resources and without reducing system throughput. Therefore, we believe traffic pacing can be deployed widely to improve the operation of current and future networks.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711596","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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986020
T. Mikoshi, T. Takenaka, Takayuki Fujiwara, A. Masuda, K. Shiomoto
We propose a scalable call admission control (CAC) scheme that avoids link congestion while maximizing the total admissible traffic of an IP backbone network. Our proposed scheme is scalable in the sense that it requires bandwidth reservation management only at ingress nodes instead of at every links in the core network. We have already evaluated the performance of admissible traffic in case where traffic observations are not executed at ingress nodes in the reference [1]. In this paper, in order to increase admissible traffic volumes, we newly formulate an LP problem in case where traffic observations are executed at ingress nodes for estimating offered traffic volumes between ingress and egress node pairs. We evaluated our proposed scheme for NSFNET and COST239 and showed that the total admissible traffic increases about 2.7 and 2.5 times more for NSFNET and COST239, respectively, compared with the case where traffic observations are not executed.
{"title":"Improvement of maximum admissible QoS traffic by traffic observations","authors":"T. Mikoshi, T. Takenaka, Takayuki Fujiwara, A. Masuda, K. Shiomoto","doi":"10.1109/HPSR.2011.5986020","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986020","url":null,"abstract":"We propose a scalable call admission control (CAC) scheme that avoids link congestion while maximizing the total admissible traffic of an IP backbone network. Our proposed scheme is scalable in the sense that it requires bandwidth reservation management only at ingress nodes instead of at every links in the core network. We have already evaluated the performance of admissible traffic in case where traffic observations are not executed at ingress nodes in the reference [1]. In this paper, in order to increase admissible traffic volumes, we newly formulate an LP problem in case where traffic observations are executed at ingress nodes for estimating offered traffic volumes between ingress and egress node pairs. We evaluated our proposed scheme for NSFNET and COST239 and showed that the total admissible traffic increases about 2.7 and 2.5 times more for NSFNET and COST239, respectively, compared with the case where traffic observations are not executed.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132212852","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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986030
A. Bremler-Barr, Yaron Koral, Victor Zigdon
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.
由于带宽有限的无线网络设备的大量增加，使用标准GZIP压缩网络流量变得既流行又具有挑战性。安全性和其他基于内容的网络设备需要对成千上万个并发连接的流量进行解压，以便检查内容是否存在不同的签名。解压缩带来的开销抑制了大多数设备处理压缩流量，这反过来限制了流量压缩或引入安全漏洞和其他功能障碍。ACCH算法[1]首先提出了一种统一的模式匹配与解压缩的方法，利用解压缩阶段收集的信息来加速模式匹配。ACCH加速了基于dfa的Aho-Corasick多模式匹配算法。本文提出了一种新的压缩流量模式匹配算法SPC (Shift-based Pattern matching for Compressed traffic)，它加速了常用的Wu-Manber模式匹配算法。SPC比ACCH更简单，具有更高的吞吐量和更低的存储开销。对真实网络流量和真实安全设备签名的分析表明，与ACCH相比，我们可以跳过高达87.5%的数据扫描，并获得超过51%的性能提升。此外，与ACCH的8KB相比，该技术的额外存储需求每个连接只需要4KB的额外信息。
{"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":"487 1","pages":"0"},"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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5985999
Nizar Ben Neji, A. Bouhoula
The coexistence of range based and prefix based fields within the filtering rules is one of the most important cause that makes the packet classification problem difficult to resolve and the proposed hybrid solutions hard to implement. How to effectively support such complex filtering rules is really a challenge. Most of the cases range-based fields need to be converted into a set of standard prefixes. Actually, there is a manifested need to have new expressive conversion techniques to process efficiently multiple type of conditions. In this context, the problem of limited scalability is encountered and must be resolved to avoid the range to prefix blowout. In this paper, we propose the NAF conversion technique (Non-adjacent form) which is able to expand an arbitrary range or multiple ranges into an optimal set of signed prefixes. The proposed technique is flexible enough and let us the possibility to reach a better compression ratio than the previous proposed solutions.
{"title":"NAF conversion: An efficient solution for the range matching problem in packet filters","authors":"Nizar Ben Neji, A. Bouhoula","doi":"10.1109/HPSR.2011.5985999","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5985999","url":null,"abstract":"The coexistence of range based and prefix based fields within the filtering rules is one of the most important cause that makes the packet classification problem difficult to resolve and the proposed hybrid solutions hard to implement. How to effectively support such complex filtering rules is really a challenge. Most of the cases range-based fields need to be converted into a set of standard prefixes. Actually, there is a manifested need to have new expressive conversion techniques to process efficiently multiple type of conditions. In this context, the problem of limited scalability is encountered and must be resolved to avoid the range to prefix blowout. In this paper, we propose the NAF conversion technique (Non-adjacent form) which is able to expand an arbitrary range or multiple ranges into an optimal set of signed prefixes. The proposed technique is flexible enough and let us the possibility to reach a better compression ratio than the previous proposed solutions.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129759303","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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986021
Xiaoliang Wang, Xiaohong Jiang, A. Pattavina
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.
{"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":"44 5","pages":"0"},"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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986019
Jiongze Chen, R. Addie, M. Zukerman
This paper provides a new formula for dimensioning of a link fed by fractional Brownian input. This formula is obtained based on another new approximate result for the stationary workload distribution of a queue loaded by fractional Brownian input. An efficient approach to simulate such a queue is also presented. Agreement between the analytical and the simulation results has been demonstrated numerically.
{"title":"Link dimensioning for fractional Brownian input","authors":"Jiongze Chen, R. Addie, M. Zukerman","doi":"10.1109/HPSR.2011.5986019","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986019","url":null,"abstract":"This paper provides a new formula for dimensioning of a link fed by fractional Brownian input. This formula is obtained based on another new approximate result for the stationary workload distribution of a queue loaded by fractional Brownian input. An efficient approach to simulate such a queue is also presented. Agreement between the analytical and the simulation results has been demonstrated numerically.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124388380","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}
Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986014
Z. Dong, R. Rojas-Cessa, E. Oki
Out-of-sequence is a problem faced by multi-stage buffered Clos-network switches. This paper proposes two buffered three-stage Clos-network packet switches that service packets in sequence and provide high switching performance. The proposed switches require short configuration times as compared to existing bufferless or partially buffered Clos-network switches. The proposed switches use time stamps assigned at the input modules to identify the order of packets in the switch. The switches use time-stamp monitoring mechanisms either at the input modules in a switch called the MMM-IM switch, or at the output modules in a switch called the MMM-OM switch to keep packets in sequence. Synchronization among different switch modules is not required in the proposed switches. The switching performance study presented in this paper shows that in-sequence monitoring at the IM provides higher performance and larger scalability than in-sequence monitoring at the output. Furthermore, the throughput of the MMM-IM switch is comparable to that of a switch that may service packets out of sequence.
{"title":"Memory-memory-memory Clos-network packet switches with in-sequence service","authors":"Z. Dong, R. Rojas-Cessa, E. Oki","doi":"10.1109/HPSR.2011.5986014","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986014","url":null,"abstract":"Out-of-sequence is a problem faced by multi-stage buffered Clos-network switches. This paper proposes two buffered three-stage Clos-network packet switches that service packets in sequence and provide high switching performance. The proposed switches require short configuration times as compared to existing bufferless or partially buffered Clos-network switches. The proposed switches use time stamps assigned at the input modules to identify the order of packets in the switch. The switches use time-stamp monitoring mechanisms either at the input modules in a switch called the MMM-IM switch, or at the output modules in a switch called the MMM-OM switch to keep packets in sequence. Synchronization among different switch modules is not required in the proposed switches. The switching performance study presented in this paper shows that in-sequence monitoring at the IM provides higher performance and larger scalability than in-sequence monitoring at the output. Furthermore, the throughput of the MMM-IM switch is comparable to that of a switch that may service packets out of sequence.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124966245","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：