The Experts below are selected from a list of 729 Experts worldwide ranked by ideXlab platform
M.j. Akhbarizadeh - One of the best experts on this subject based on the ideXlab platform.
-
Prefix segregation scheme for a TCAM-based IP Forwarding Engine
IEEE Micro, 2005Co-Authors: M.j. Akhbarizadeh, M. Nourani, C.d. CantrellAbstract:A novel design for IP packet Forwarding based on a new ternary content-addressable-memory configuration offers an efficient hardware solution for the longest-prefix matching problem in Internet routers. The architecture has lower update complexity, lower cost, and shorter search latency compared to the conventional TCAM structure.
-
Throughput increase in packet Forwarding Engines using adaptive block-selection scheme
IEEE Communications Letters, 2005Co-Authors: M.j. Akhbarizadeh, M. NouraniAbstract:We propose a new approach for using the block-selection scheme to increase the search throughput in a multi-block TCAM-based packet Forwarding Engine. While the existing methods try to counter and forcibly balance the inherent bias of the Internet traffic, our method takes advantage of it hence improving flexibility of table management and scalability towards high rates of change in traffic bias. This approach also offers higher throughput than the current art.
-
Reconfigurable memory architecture for scalable IP Forwarding Engines
Microprocessors and Microsystems, 2003Co-Authors: M. Nourani, M.j. AkhbarizadehAbstract:Abstract In this paper, a reconfigurable memory architecture and lookup technique for IP packet Forwarding Engines is presented. This is achieved by partitioning the Forwarding table into smaller partial lookup tables for each output port and allowing a Forwarding Engine to process them in parallel. This effectively reduces the complexity of finding the ‘longest prefix match’ problem to the ‘first prefix match’ problem. Our method is a flexible technique that significantly elevates the scalability of the next generation network processors and other packet processing devices. Such scalability facilitates migration to IPv6 and benefits network equipments especially in terms of growing routing table size, traffic, frequency of route updates and bandwidth requirement.
-
GLOBECOM - A fully scalable IP Forwarding Engine based on partitioned lookup table
Global Telecommunications Conference 2002. GLOBECOM '02. IEEE, 2002Co-Authors: M. Nourani, M.j. AkhbarizadehAbstract:In this paper, we present a fully scalable architecture for IP packet Forwarding Engines used in router line cards and other network equipment. Our conceptually sliced architecture can be replicated to increase the number of ports or deal with larger lookup tables. We show empirical evidence that, using our architecture, the expansion requires very limited glue logic and does not deteriorate the performance. Such a scalability feature is especially vital to satisfy the Internet's huge appetite for large routing tables, increased traffic, higher speed and the migration to IPv6.
-
ICC - An IP packet Forwarding technique based on partitioned lookup table
2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2002Co-Authors: M.j. Akhbarizadeh, M. NouraniAbstract:We present an efficient IP packet Forwarding methodology and architecture. This is achieved by partitioning the lookup table into smaller ones for each output port and allowing a Forwarding Engine to process them in parallel. This effectively reduces the complexity of the problem of finding "the longest prefix match" to that of finding "the first prefix match".
M. Nourani - One of the best experts on this subject based on the ideXlab platform.
-
Prefix segregation scheme for a TCAM-based IP Forwarding Engine
IEEE Micro, 2005Co-Authors: M.j. Akhbarizadeh, M. Nourani, C.d. CantrellAbstract:A novel design for IP packet Forwarding based on a new ternary content-addressable-memory configuration offers an efficient hardware solution for the longest-prefix matching problem in Internet routers. The architecture has lower update complexity, lower cost, and shorter search latency compared to the conventional TCAM structure.
-
Throughput increase in packet Forwarding Engines using adaptive block-selection scheme
IEEE Communications Letters, 2005Co-Authors: M.j. Akhbarizadeh, M. NouraniAbstract:We propose a new approach for using the block-selection scheme to increase the search throughput in a multi-block TCAM-based packet Forwarding Engine. While the existing methods try to counter and forcibly balance the inherent bias of the Internet traffic, our method takes advantage of it hence improving flexibility of table management and scalability towards high rates of change in traffic bias. This approach also offers higher throughput than the current art.
-
Reconfigurable memory architecture for scalable IP Forwarding Engines
Microprocessors and Microsystems, 2003Co-Authors: M. Nourani, M.j. AkhbarizadehAbstract:Abstract In this paper, a reconfigurable memory architecture and lookup technique for IP packet Forwarding Engines is presented. This is achieved by partitioning the Forwarding table into smaller partial lookup tables for each output port and allowing a Forwarding Engine to process them in parallel. This effectively reduces the complexity of finding the ‘longest prefix match’ problem to the ‘first prefix match’ problem. Our method is a flexible technique that significantly elevates the scalability of the next generation network processors and other packet processing devices. Such scalability facilitates migration to IPv6 and benefits network equipments especially in terms of growing routing table size, traffic, frequency of route updates and bandwidth requirement.
-
GLOBECOM - A fully scalable IP Forwarding Engine based on partitioned lookup table
Global Telecommunications Conference 2002. GLOBECOM '02. IEEE, 2002Co-Authors: M. Nourani, M.j. AkhbarizadehAbstract:In this paper, we present a fully scalable architecture for IP packet Forwarding Engines used in router line cards and other network equipment. Our conceptually sliced architecture can be replicated to increase the number of ports or deal with larger lookup tables. We show empirical evidence that, using our architecture, the expansion requires very limited glue logic and does not deteriorate the performance. Such a scalability feature is especially vital to satisfy the Internet's huge appetite for large routing tables, increased traffic, higher speed and the migration to IPv6.
-
ICC - An IP packet Forwarding technique based on partitioned lookup table
2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2002Co-Authors: M.j. Akhbarizadeh, M. NouraniAbstract:We present an efficient IP packet Forwarding methodology and architecture. This is achieved by partitioning the lookup table into smaller ones for each output port and allowing a Forwarding Engine to process them in parallel. This effectively reduces the complexity of the problem of finding "the longest prefix match" to that of finding "the first prefix match".
K Hayashi - One of the best experts on this subject based on the ideXlab platform.
-
High-speed IP packet/Ethernet frame Forwarding Engine (CAFE) for ATM-based network router/bridge
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220), 1998Co-Authors: K Toyoshima, Yutaka Watanabe, Haruka Miyao, Hideyuki Tsuboi, H. Fujiwara, K HayashiAbstract:The number of Internet users is now increasing rapidly because of the popularity of the WWW. Intra-nets and extra-nets have also become very popular as they enable efficient business processing. Accordingly, there is increasing demand for Internet/intra-net/extra-net services that offer higher speed, shorter delay, higher throughput, and stronger security at lower cost. To satisfy those demands, this paper proposes the network router/bridge concept that acts as a large router/bridge when constructing a nationwide computer network and a cut-through ATM-based Forwarding Engine (CAFE) that forwards IP packets/Ethernet frames with cell-by-cell processing in the network router/bridge. We also propose a hardware based fast search method to get the address entry table suitable for cell-by-cell processing, one of the key technologies of CAFE.
-
high speed ip packet ethernet frame Forwarding Engine cafe for atm based network router bridge
International Conference on Communications, 1998Co-Authors: K Toyoshima, Yutaka Watanabe, Haruka Miyao, Hideyuki Tsuboi, H. Fujiwara, K HayashiAbstract:The number of Internet users is now increasing rapidly because of the popularity of the WWW. Intra-nets and extra-nets have also become very popular as they enable efficient business processing. Accordingly, there is increasing demand for Internet/intra-net/extra-net services that offer higher speed, shorter delay, higher throughput, and stronger security at lower cost. To satisfy those demands, this paper proposes the network router/bridge concept that acts as a large router/bridge when constructing a nationwide computer network and a cut-through ATM-based Forwarding Engine (CAFE) that forwards IP packets/Ethernet frames with cell-by-cell processing in the network router/bridge. We also propose a hardware based fast search method to get the address entry table suitable for cell-by-cell processing, one of the key technologies of CAFE.
-
ATM-based cut-through Forwarding Engine for computer communication networks
GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record, 1997Co-Authors: Yutaka Watanabe, K Toyoshima, Haruka Miyao, H. Fujiwara, H. Tsubol, K HayashiAbstract:The demand for Internet services has exploded due to the emergence of the World Wide Web (WWW). Intranets have also been receiving much attention. There is increasing demand for Internet and intranet services that offer higher speed, higher throughput, and stronger security at low cost. This paper points out the problems of constructing a nationwide computer network and proposes the network router/bridge concept that acts as a large router/bridge. We also propose a cut-through ATM-based Forwarding Engine (CAFE) that handles IP packets/Ethernet frames, it has a Forwarding function and high throughput. In conjunction with the existing ATM backbone network, it yields low communication cost.
-
A novel approach to network router/bridge for nationwide intranet
Proceedings of ICICS 1997 International Conference on Information Communications and Signal Processing. Theme: Trends in Information Systems Engineeri, 1997Co-Authors: Haruka Miyao, K Toyoshima, Yutaka Watanabe, Hideyuki Tsuboi, H. Fujiwara, K HayashiAbstract:Intranets have been receiving much more attention due to the success of the WWW. There is an increasing demand for intranets that offer higher speed, higher throughput, and stronger security at low cost. This paper points out the problems of constructing a nationwide computer network and proposes the cut-through ATM-based Forwarding Engine and a new network configuration concept that acts as a large router/bridge.
Yongguang Zhang - One of the best experts on this subject based on the ideXlab platform.
-
PRESTO - CAFE: a configurable packet Forwarding Engine for data center networks
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow - PRESTO '09, 2009Co-Authors: G. Lu, Yongguang ZhangAbstract:Recently, Data Center Networking (DCN) has attracted many research attentions and innovative DCN designs have been proposed [1, 2]. All these designs need specialized packet Forwarding Engines due to their special routing algorithms, which are either based on commonly used packet headers or self-defined ones. Although programmable Forwarding devices are available, it is difficult to use them to prototype these DCN designs, especially when self-defined headers are introduced. In this paper, we present a hardware based Configurable pAcket Forwarding Engine (CAFE) to facilitate the prototyping process. Through simple APIs, CAFE can be easily configured to forward self-defined packets, modify, insert, and delete arbitrary packet header fields without re-designing the hardware. We have implemented CAFE using NetFPGA. Evaluation demonstrates that CAFE can be easily configured and it can forward packets at line-rate.
-
cafe a configurable packet Forwarding Engine for data center networks
ACM Special Interest Group on Data Communication, 2009Co-Authors: G. Lu, Yongguang ZhangAbstract:Recently, Data Center Networking (DCN) has attracted many research attentions and innovative DCN designs have been proposed [1, 2]. All these designs need specialized packet Forwarding Engines due to their special routing algorithms, which are either based on commonly used packet headers or self-defined ones. Although programmable Forwarding devices are available, it is difficult to use them to prototype these DCN designs, especially when self-defined headers are introduced. In this paper, we present a hardware based Configurable pAcket Forwarding Engine (CAFE) to facilitate the prototyping process. Through simple APIs, CAFE can be easily configured to forward self-defined packets, modify, insert, and delete arbitrary packet header fields without re-designing the hardware. We have implemented CAFE using NetFPGA. Evaluation demonstrates that CAFE can be easily configured and it can forward packets at line-rate.
S. Sahni - One of the best experts on this subject based on the ideXlab platform.
-
Low-Power TCAMs for Very Large Forwarding Tables
IEEE ACM Transactions on Networking, 2010Co-Authors: W. Lu, S. SahniAbstract:Ternary content-addressable memories (TCAMs) may be used to obtain a simple and very fast implementation of a router's Forwarding Engine. The applicability of TCAMs is, however, limited by their size and high power requirement. Zane et al. proposed a method and associated algorithms to reduce the power needed to search a Forwarding table using a TCAM. We improve on both the algorithms proposed by them. Additionally, we show how to couple TCAMs and high-bandwidth SRAMs so as to overcome both the power and size limitations of a pure TCAM Forwarding Engine. By using one of our novel TCAM-SRAM coupling schemes (M-12 Wb), we are able to reduce TCAM memory by a factor of about 5 on IPv4 data sets and by a factor of about 2.5 on IPv6 data sets; TCAM power requirement is reduced by a factor of about 10 on IPv4 data sets and by a factor of about 6 on IPv6 data sets. These comparisons are with respect to the improved TCAM algorithms we have developed for the strategies of Zane et al. The stated improvements come at the cost of increasing SRAM requirement by a factor 2.5 for IPv4 data and a factor of 5 for IPv6 data. This cost is unimportant given that SRAMs are relatively quite cheap and have much less power requirement. For another of our novel TCAM-SRAM coupling schemes (1-12Wc), the TCAM memory and power reduced by factors of about 4 and 12 for IPv4 data sets, respectively, and by factors of about 2 and 10 for IPv6 data sets. The SRAM required, however, increased by factors of 3 and 7, respectively. These improvements come with no loss in the time (as measured by the number of TCAM searches and SRAM accesses) to do a lookup.
-
Low Power TCAMs for Very Large Forwarding Tables
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, 2008Co-Authors: W. Lu, S. SahniAbstract:Ternary content-addressable memories (TCAMs) may be used to obtain a simple and very fast implementation of a router's Forwarding Engine. The applicability of TCAMs is, however, limited by their size and high power requirement. Zane et al. (2003) proposed a method and associated algorithms to reduce the power needed to search a Forwarding table using a TCAM. We improve on both the algorithms proposed by them. Additionally, we show how to couple TCAMs and high bandwidth SRAMs so as to overcome both the power and size limitations of a pure TCAM Forwarding Engine.
-
INFOCOM - Low Power TCAMs for Very Large Forwarding Tables
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, 2008Co-Authors: W. Lu, S. SahniAbstract:Ternary content-addressable memories (TCAMs) may be used to obtain a simple and very fast implementation of a router's Forwarding Engine. The applicability of TCAMs is, however, limited by their size and high power requirement. Zane et al. (2003) proposed a method and associated algorithms to reduce the power needed to search a Forwarding table using a TCAM. We improve on both the algorithms proposed by them. Additionally, we show how to couple TCAMs and high bandwidth SRAMs so as to overcome both the power and size limitations of a pure TCAM Forwarding Engine.