{"title":"Internal congestion control in a cluster-based router","authors":"Qinghua Ye, Mike H. MacGregor","doi":"10.1109/HSPR.2008.4734414","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734414","url":null,"abstract":"Congestion is a problem in any distributed system. In this paper, we present and evaluate a congestion control scheme to manage congestion internal to a cluster-based router. Our results show that it is possible to improve the overall forwarding rate of the router by reducing the injection rate of traffic to the internal network when the router is under heavy load. Our control algorithm is based on backward explicit congestion notification combined with a novel method for queue scheduling. We find that the forwarding rate of our prototype router can be increased by nearly 33% while the traffic in the internal network can be reduced by up to 59%. Fair allocation of resources under overload is guaranteed by our scheme.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115404584","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}
{"title":"A construction of shared optical buffer queue with switched delay lines","authors":"Xiaoliang Wang, Xiaohong Jiang, S. Horiguchi","doi":"10.1109/HSPR.2008.4734426","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734426","url":null,"abstract":"In this paper, we focus on the feedback construction of FIFO shared optical buffer queue from bufferless switch and fiber delay lines. The construction consists of an (M+2)times(M+2) crossbar switch and M fiber delay lines with delay d1, d2, ... , dM which are connected from M outputs of the switch fabric to M inputs. We show that, when setting di = min(M + 1 - i, i), i = 1, ... , M, such a construction can work as a 1-to-2 shared buffer queue.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117193299","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}
{"title":"On joint sequence design for feedback-based two-stage switch architecture","authors":"Bing Hu, K. Yeung","doi":"10.1109/HSPR.2008.4734430","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734430","url":null,"abstract":"An N times N feedback-based two-stage switch is configured using a pre-determined and periodic joint sequence of N joint configurations. The joint sequence used is characterized by both in-order packet delivery and staggered symmetry properties. In this paper, we focus on designing optimal joint sequences. We first divide all possible joint sequences into four classes, with staggered symmetry property only, with in-order packet delivery property only, with both properties and with none of the properties. We then show that anchor output and ordered joint sequence are the necessary and sufficient conditions for packet inorder delivery. Since the staggered symmetry property is necessary for efficient feedback path implementation, we calculate that there are [(N-1)!]2 joint sequences with both inorder packet delivery and staggered symmetry properties. In order to find out the optimal joint sequence that can minimize the switch delay performance for a given traffic profile, we believe it can only be achieved by searching through the whole pool of [(N-1)!]2 joint sequences.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124901919","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}
{"title":"A map-and-route approach for Segment Shared Protection in multi-domain networks","authors":"D. Truong, B. Jaumard","doi":"10.1109/HSPR.2008.4734447","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734447","url":null,"abstract":"Routing and protection with an overlapping segment shared protection (OSSP) scheme in multi-domain networks is more difficult than that in single domain networks because of scalability requirements. We propose a novel approach for OSSP routing where the underlying idea is the prior identification of Potential Intra-domain Paths (PIP) for carrying working and backup traffic between domain border nodes. These PIPs help to reduce the multi-domain network to a simpler aggregated network where routing is performed without unnecessarily going down to the physical links. The novel approach offers an exact and highly scalable routing thanks to the prior identification of the PIPs and the introduction of a maximal share risk group feature. Experiments show that the quality of the proposed approach is close to the optimal single-domain network solution and outperforms the existing multi-domain network solutions.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132451822","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}
Haesung Hwang, Koji Yamamoto, S. Ata, K. Inoue, M. Murata
{"title":"Minimization of ACL storage by adding minimal hardware of range matching and logical gates to TCAM","authors":"Haesung Hwang, Koji Yamamoto, S. Ata, K. Inoue, M. Murata","doi":"10.1109/HSPR.2008.4734431","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734431","url":null,"abstract":"Ternary content addressable memory (TCAM) is a special type of memory used in routers in order to achieve high speed packet classification. The classification is performed using the five fields in an access control list (ACL), port numbers being one of them. Since port numbers that are expressed in ranges require multiple entries in storage, this results in an increased cost of hardware. In this paper we propose a method to reduce the number of entries when expressing ranges in TCAM. We use range matching devices integrated within the TCAMpsilas control logic and optimized prefix expansion that utilizes logical AND and NOT gates in the TCAM array itself. In addition, we use real data of an existing network to show that the proposed architecture can store the ACL in an efficient way.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132541190","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}
Y. Fukushima, Xiaohong Jiang, A. Pattavina, S. Horiguchi
{"title":"Self-routing design of nonblocking WDM switches based on arrayed waveguide grating","authors":"Y. Fukushima, Xiaohong Jiang, A. Pattavina, S. Horiguchi","doi":"10.1109/HSPR.2008.4734457","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734457","url":null,"abstract":"Arrayed waveguide grating (AWG) is a promising technology for constructing high-speed large-capacity WDM switches, because it can switch fast, is scalable to large size and consumes little power. To take the full advantages of high-speed AWG, the routing control of a massive AWG-based switch should be as simple as possible. In this paper, we focus on the self-routing design of AWG-based switches with O(1) constant routing complexity and propose a novel construction of self-routing AWG switches that can guarantee the attractive nonblocking property for both the wavelength-to-wavelength and wavelength-to-fiber request models. It is expected that the proposed construction will be useful for the design and all-optical implementation of future ultra high-speed optical packet/burst switches.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386884","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}
{"title":"Revealing the optimality gap for Traffic Engineering algorithms","authors":"Huan Liu","doi":"10.1109/HSPR.2008.4734435","DOIUrl":"https://doi.org/10.1109/HSPR.2008.4734435","url":null,"abstract":"Traffic Engineering (TE) is important and necessary in order to fully utilize the existing network resources and reduce capital expenditure. Given its importance, many algorithms have been proposed in the literature. Unfortunately, there is still not a consistent methodology to evaluate these algorithms. Worse yet, some variants of the traffic engineering problem are known to be NP-hard. Thus, given a particular TE problem, in general, it is not possible to know the optimal solution; hence, it is difficult to assess how a particular heuristic algorithm performs. Even though several heuristic algorithms could be used to validate each other, the best solution from these algorithms could still be very far away from the optimal solution. We propose a novel methodology to evaluate TE algorithms. In this methodology, we construct TE problems with known optimal solutions and we then use these TE problem instances to test the performance of TE algorithms. We found that some TE algorithms perform poorly, and the result deviates from the optimum further as the problem size gets bigger. Our results suggest that there is large room for algorithm improvements and further research is required. Even though we only demonstrate the power of the methodology in the context of traffic engineering algorithms, the methodology is general enough that it could be applied in many other areas as well.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126919698","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}