Pub Date : 2001-05-29DOI: 10.1109/HPSR.2001.923638
M. Kobayashi, T. Murase
This paper describes a new IP forwarding table search method that can be implemented on a general-purpose processor with a high-speed cache memory. It uses an efficient small data structure to store an IP forwarding table in the cache memory by exploiting a characteristic of the IP address prefixes of forwarding tables in the Internet backbone. At the particular level of the prefix-tree, the number of the prefixes below most of the nodes is very small. The method enables a general-purpose 500-MHz processor equipped with a 512-KB internal cache to perform searches at the wire-speed of a 2.4-Gb/sec link.
{"title":"A processor based high-speed longest prefix match search engine","authors":"M. Kobayashi, T. Murase","doi":"10.1109/HPSR.2001.923638","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923638","url":null,"abstract":"This paper describes a new IP forwarding table search method that can be implemented on a general-purpose processor with a high-speed cache memory. It uses an efficient small data structure to store an IP forwarding table in the cache memory by exploiting a characteristic of the IP address prefixes of forwarding tables in the Internet backbone. At the particular level of the prefix-tree, the number of the prefixes below most of the nodes is very small. The method enables a general-purpose 500-MHz processor equipped with a 512-KB internal cache to perform searches at the wire-speed of a 2.4-Gb/sec link.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263582","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923596
Cheng Shan
While weighted fair queueing (WFQ) and many other fair scheduling methods can provide guaranteed worst case delay bounds, they are not scalable to a large number of connections due to per-flow queuing. This paper presents a new packet scheduling method-round-robin priority queuing (RRPQ). RRPQ guarantees a per-session-based delay bound without per-flow queuing. It also avoids many other implementation complexities in fair queuing scheduling. The scalability and low implementation cost of RRPQ make it a practical solution in providing guaranteed delay bounds in high-speed networks.
{"title":"A new scalable and efficient packet scheduling method in high-speed packet switch networks","authors":"Cheng Shan","doi":"10.1109/HPSR.2001.923596","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923596","url":null,"abstract":"While weighted fair queueing (WFQ) and many other fair scheduling methods can provide guaranteed worst case delay bounds, they are not scalable to a large number of connections due to per-flow queuing. This paper presents a new packet scheduling method-round-robin priority queuing (RRPQ). RRPQ guarantees a per-session-based delay bound without per-flow queuing. It also avoids many other implementation complexities in fair queuing scheduling. The scalability and low implementation cost of RRPQ make it a practical solution in providing guaranteed delay bounds in high-speed networks.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161184","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923645
K. Yoshigoe, Ken Christensen
Input buffered switches with virtual output queues (VOQ) are scalable to very high speeds, but require switch matrix scheduling algorithms to achieve high throughput. Existing scheduling algorithms based on parallel request grant-accept cycles cannot natively support variable length Ethernet packets. A parallel-polled VOQ (PP-VOQ) architecture is proposed that natively supports variable length packets. Small amounts of FIFO buffering within a crossbar are used. Using simulation, the PP-VOQ with buffered crossbar switch is shown to have lower switch delay at high offered loads than an iSLIP switch for both cell and variable-length packet traffic. The PP-VOQ switch does not require internal speed-up or complex reassembly mechanisms. The priority mechanism implemented in both the iSLIP and PP-VOQ switches are demonstrated to provide guaranteed rate and bounded delay for schedulable traffic.
{"title":"A parallel-polled virtual output queued switch with a buffered crossbar","authors":"K. Yoshigoe, Ken Christensen","doi":"10.1109/HPSR.2001.923645","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923645","url":null,"abstract":"Input buffered switches with virtual output queues (VOQ) are scalable to very high speeds, but require switch matrix scheduling algorithms to achieve high throughput. Existing scheduling algorithms based on parallel request grant-accept cycles cannot natively support variable length Ethernet packets. A parallel-polled VOQ (PP-VOQ) architecture is proposed that natively supports variable length packets. Small amounts of FIFO buffering within a crossbar are used. Using simulation, the PP-VOQ with buffered crossbar switch is shown to have lower switch delay at high offered loads than an iSLIP switch for both cell and variable-length packet traffic. The PP-VOQ switch does not require internal speed-up or complex reassembly mechanisms. The priority mechanism implemented in both the iSLIP and PP-VOQ switches are demonstrated to provide guaranteed rate and bounded delay for schedulable traffic.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130100968","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923667
G. Riley, M. Ammar, E. Zegura
We introduce the concept of Neighbor-Index Vector (NIx-Vector) routing which gives efficient and consistent routing of packets in Internet routers. A NIx-Vector is a compact representation of a routing path, which is small enough to be included in a packet header. We show how, by including the routing information in the packet header, routing decisions can be made in O(1) time at each router, with no caching or state in the routers (other than the existing routing tables). The creation of a NIx-Vector for a source and destination pair requires one round trip time, but once the NIx-Vector is known, it can be retained by the source and reused indefinitely with no further setup time required (or until it becomes no longer valid, which is easily detected). In addition to O(1) routing decisions, the use of NIx-Vectors to record and specify routes has other benefits. NIx-Vectors provide for route pinning which is beneficial for reservation protocols and mitigates the effect of routing flaps on long lived flows. A variation of NIx-Vectors can insure symmetrical routes from a source to a destination and back to the source, which is also beneficial to some reservation protocols. We give a complete description of how NIx-Vectors are created and used in Internet routers; and give empirical data showing the number of bits required to represent NIx-Vectors for typical Internet paths.
{"title":"Efficient routing using NIx-Vectors","authors":"G. Riley, M. Ammar, E. Zegura","doi":"10.1109/HPSR.2001.923667","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923667","url":null,"abstract":"We introduce the concept of Neighbor-Index Vector (NIx-Vector) routing which gives efficient and consistent routing of packets in Internet routers. A NIx-Vector is a compact representation of a routing path, which is small enough to be included in a packet header. We show how, by including the routing information in the packet header, routing decisions can be made in O(1) time at each router, with no caching or state in the routers (other than the existing routing tables). The creation of a NIx-Vector for a source and destination pair requires one round trip time, but once the NIx-Vector is known, it can be retained by the source and reused indefinitely with no further setup time required (or until it becomes no longer valid, which is easily detected). In addition to O(1) routing decisions, the use of NIx-Vectors to record and specify routes has other benefits. NIx-Vectors provide for route pinning which is beneficial for reservation protocols and mitigates the effect of routing flaps on long lived flows. A variation of NIx-Vectors can insure symmetrical routes from a source to a destination and back to the source, which is also beneficial to some reservation protocols. We give a complete description of how NIx-Vectors are created and used in Internet routers; and give empirical data showing the number of bits required to represent NIx-Vectors for typical Internet paths.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090134","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923615
V. Oberle, H. Ritter, Klaus Wehrle
We focus on the distribution of pricing information between autonomous systems in the Internet. Therefore we propose the border pricing protocol (BPP) as a protocol for exchanging pricing information in analogy to the border gateway protocol, the current Internet standard for inter-autonomous system routing protocols. The open pricing framework is sketched as well as its relation to the differentiated services architecture. The mechanisms of the BPP are presented and the content of the pricing and charging information base is discussed.
{"title":"BPP: a protocol for exchanging pricing information between autonomous systems","authors":"V. Oberle, H. Ritter, Klaus Wehrle","doi":"10.1109/HPSR.2001.923615","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923615","url":null,"abstract":"We focus on the distribution of pricing information between autonomous systems in the Internet. Therefore we propose the border pricing protocol (BPP) as a protocol for exchanging pricing information in analogy to the border gateway protocol, the current Internet standard for inter-autonomous system routing protocols. The open pricing framework is sketched as well as its relation to the differentiated services architecture. The mechanisms of the BPP are presented and the content of the pricing and charging information base is discussed.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131335497","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923628
S. Van den Bosch, P. de La Vallee-Poussin, G. Van Hoey, H. de Neve, G. Petit
Two mixed-integer linear programming (MILP) formulations of a centralized, off-line traffic engineering tool are compared with respect to their scalability properties. Such an algorithm can be used to optimize the routing configuration in a DiffServ network. It is shown that a considerable reduction of the number of variables and constraints can be obtained by pairing primary and protection path candidates prior to the routing optimization. Simulations of networks with different sizes evidence this result,.
{"title":"Study of scalability properties of two LP-based algorithms for traffic engineering in a flat differentiated services network","authors":"S. Van den Bosch, P. de La Vallee-Poussin, G. Van Hoey, H. de Neve, G. Petit","doi":"10.1109/HPSR.2001.923628","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923628","url":null,"abstract":"Two mixed-integer linear programming (MILP) formulations of a centralized, off-line traffic engineering tool are compared with respect to their scalability properties. Such an algorithm can be used to optimize the routing configuration in a DiffServ network. It is shown that a considerable reduction of the number of variables and constraints can be obtained by pairing primary and protection path candidates prior to the routing optimization. Simulations of networks with different sizes evidence this result,.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131210510","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923612
X. Hou, H. Mouftah
The implementation of wavelength converters in the optical crossconnect (OXC) is a key step towards the all-optical networks. Optical switches are the building blocks of OXC with the functions of wavelength routing, reconfigurability, network protection and restoration. Wavelength converters are used to effectively alleviate the blocking probability and help to resolve contention at the output port of switches by shifting one incoming wavelength to another outgoing wavelength at an OXC node. The deployment of wavelength converters within optical switches offers robust routing, switching functions and network management in the optical layer. This is critical to the emerging all-optical Internet. However, the high cost of wavelength converters at the current stage of fabrication technology remains an issue when we design node architectures for an optical network. This paper proposes a new wavelength-convertible switch and investigates the most cost-effective use of wavelength converters.
{"title":"Design of wavelength-convertible optical switches for the all-optical next-generation Internet","authors":"X. Hou, H. Mouftah","doi":"10.1109/HPSR.2001.923612","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923612","url":null,"abstract":"The implementation of wavelength converters in the optical crossconnect (OXC) is a key step towards the all-optical networks. Optical switches are the building blocks of OXC with the functions of wavelength routing, reconfigurability, network protection and restoration. Wavelength converters are used to effectively alleviate the blocking probability and help to resolve contention at the output port of switches by shifting one incoming wavelength to another outgoing wavelength at an OXC node. The deployment of wavelength converters within optical switches offers robust routing, switching functions and network management in the optical layer. This is critical to the emerging all-optical Internet. However, the high cost of wavelength converters at the current stage of fabrication technology remains an issue when we design node architectures for an optical network. This paper proposes a new wavelength-convertible switch and investigates the most cost-effective use of wavelength converters.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134461602","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923671
Jinhui Li, N. Ansari
The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class-of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.
{"title":"QoS guaranteed input queued scheduling algorithms with low delay","authors":"Jinhui Li, N. Ansari","doi":"10.1109/HPSR.2001.923671","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923671","url":null,"abstract":"The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class-of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"36 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395942","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923635
V. Konda, T. Chow
We study the problem of traffic grooming to reduce the number of transceivers in optical networks. We show that this problem is equivalent to a certain traffic maximization problem. We give an intuitive interpretation of this equivalence and use this interpretation to derive a greedy algorithm for transceiver minimization. We discuss implementation issues and present computational results comparing the heuristic solutions with the optimal solutions for several small example networks. For larger networks, the heuristic solutions are compared with known bounds on the optimal solution obtained using integer programming tools.
{"title":"Algorithm for traffic grooming in optical networks to minimize the number of transceivers","authors":"V. Konda, T. Chow","doi":"10.1109/HPSR.2001.923635","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923635","url":null,"abstract":"We study the problem of traffic grooming to reduce the number of transceivers in optical networks. We show that this problem is equivalent to a certain traffic maximization problem. We give an intuitive interpretation of this equivalence and use this interpretation to derive a greedy algorithm for transceiver minimization. We discuss implementation issues and present computational results comparing the heuristic solutions with the optimal solutions for several small example networks. For larger networks, the heuristic solutions are compared with known bounds on the optimal solution obtained using integer programming tools.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001781","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 : 2001-05-29DOI: 10.1109/HPSR.2001.923595
Hongyuan Shi, H. Sethu
The controlled load service defined within the IETF's Integrated Services architecture for QoS in the Internet requires source points to regulate the traffic while the network provides a soft guarantee on performance. Packets sent in violation of the traffic are marked so that the network may give them lower priority. We have defined the requirements of a scheduler serving packets belonging to the controlled load service. Besides efficiency and throughput goals, we define another important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets. For any given desired bound /spl alpha/ on this additional delay, we present the CL(/spl alpha/) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1). We also provide analytical proofs of these results on the CL(/spl alpha/) scheduler. The principle used in this algorithm can also be used to schedule flows with multilevel priorities, such as in some real-time video streams as well as in other emerging service models of the Internet that mark packets to identify drop precedences.
{"title":"On scheduling real-time traffic under controlled load service in an integrated services Internet","authors":"Hongyuan Shi, H. Sethu","doi":"10.1109/HPSR.2001.923595","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923595","url":null,"abstract":"The controlled load service defined within the IETF's Integrated Services architecture for QoS in the Internet requires source points to regulate the traffic while the network provides a soft guarantee on performance. Packets sent in violation of the traffic are marked so that the network may give them lower priority. We have defined the requirements of a scheduler serving packets belonging to the controlled load service. Besides efficiency and throughput goals, we define another important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets. For any given desired bound /spl alpha/ on this additional delay, we present the CL(/spl alpha/) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1). We also provide analytical proofs of these results on the CL(/spl alpha/) scheduler. The principle used in this algorithm can also be used to schedule flows with multilevel priorities, such as in some real-time video streams as well as in other emerging service models of the Internet that mark packets to identify drop precedences.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372230","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
扫码关注我们
求助内容：
应助结果提醒方式：