نتایج جستجو برای: ip lookup
تعداد نتایج: 46030 فیلتر نتایج به سال:
In many applications, the rule to be applied is chosen based on a single field of the packet header: the destination address. When an incoming packet matches more than one filter and there is no criterion that breaks the tie (either to pick the filter with the highest priority, or to pick the most-specific filter, etc.), the router cannot unambiguously categorise the packet. Thus, one considers...
In this paper, we present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into the smaller ones 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.
Internet routers forward packets based on the destination address of a packet. A packet's address is matched against the destination prefixes stored in the router's forwarding table, and the packet is sent to the output interface determined by the longest matching prefix. While some existing schemes work well for IPv4 addresses, we believe that none of the current schemes scales well to IPv6, e...
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forwarding table in order to determine the packet’s next-hop. In this paper, we present an efficient hardware solution for the IP address lookup problem. We model the address lookup problem as a searching problem on a binar...
SRAM (static random access memory)-based pipelined algorithmic solutions have become competitive alternatives to TCAMs (ternary content addressable memories) for high-throughput IP lookup. Multiple pipelines can be utilized in parallel to improve the throughput further. However, several challenges must be addressed to make such solutions feasible. First, the memory distribution over different p...
In the past decade there has been an increasing need for designs to address the time and cost efficiency issues from various computer network applications such as general IP address lookup and specific network intrusion detection. Hashing techniques have been widely adopted for this purpose, among which XOR-operation-based hashing is one of most popular techniques due to its relatively small ha...
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering the number of prefixes and its lengths. As compared to the software-based solutions, the Ternary content-addressable memory can offer sustained throughput and simple system architecture. It is attractive for IPv6 rout...
Srinivasan and Varghese [17] have proposed the use of multibit tries to represent routing tables used for Internet (IP) address lookups. They propose an dynamic programing algorithm to determine the strides for an optimal variable-stride trie that has at most levels. Here, is the number of prefixes in the routing table and is the length of the longest prefix. We improve on this algorithm by pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید