Class / Patent application number | Description | Number of patent applications / Date published |
370395310 | Including routing table | 89 |
20080205408 | TRANSMITTING A PACKET FROM A DISTRIBUTED TRUNK SWITCH - A method of transmitting a packet from a distributed trunk switch and a computer-readable medium storing instructions therefor is described. The method comprises populating an address table of the distributed trunk switch. The method also comprises receiving a packet from a device connected to the distributed trunk switch and transmitting the received packet via a distributed trunk (DT) port of the distributed trunk switch if the destination address of the received packet corresponds to a distributed trunk port in the address table. | 08-28-2008 |
20080212592 | Apparatus and method for route summarization and distribution in a massively parallel router - A router for interconnecting external devices coupled to the router. The router comprises a switch fabric and a plurality of routing nodes coupled to the switch fabric. Each routing node is capable of transmitting data packets to, and receiving data packets from, the external devices and is further capable of transmitting data packets to, and receiving data packets from, other routing nodes via the switch fabric. The router also comprises a control processor for comparing the N most significant bits of a first subnet address associated with a first external port of a first routing node with the N most significant bits of a second subnet address associated with a second external port of the first routing node. The router determines a P-bit prefix of similar leading bits in the first and second subnet addresses and transmits the P-bit prefix to other routing nodes. | 09-04-2008 |
20080225860 | Distributed routing table interface - Application programming interface (API) for starting and accessing distributed routing table (DRT) functionality. The API facilitates bootstrapping into the DRT by one or more devices of a group of devices (a mesh) seeking to collaborate over a serverless connection, establishing a node of the DRT, where each node is an instance of an application that is participating in the mesh, and node participation by allowing the application to search for keys published by other nodes in the mesh, or by becoming part of the mesh by publishing a key. The API facilitates optimization of the routing table for quickly finding a root of a specific key in the mesh by finding the key directly in a cache or by asking a root node of the key that is in the local routing table that is closest numerically to the key being searched. | 09-18-2008 |
20080240112 | LAYER 2 ROUTING PROTOCOL | 10-02-2008 |
20080247398 | Method for Reduction of Data Packet Losses On Updating of an Address Table - Reduction of data packet losses on updating of an address table, stored in a computer of a local network is provided. The address table comprises allocations of computer addresses, valid in the local network, to computer addresses valid in the Internet for transmission of data packets, whereby an address allocation stored in the address table is erased after expiry of a validity timer and the address allocation is firstly requested again and inserted in the address table when a data packet is transmitted to an address internet-valid address of a computer in the local network. During the updating of the address allocation, data packets for transmission are buffered in a buffer memory, the size of the buffer memory being configured corresponding to the expected load of the local network. The size of the buffer memory matches the expected load on the local network. | 10-09-2008 |
20080247399 | MODIFICATION OF A SWITCHING TABLE OF AN INTERNET PROTOCOL SWITCH - Methods for modifying a switching table of an Internet Protocol (IP) switch. The methods include: receiving a dynamic host configuration protocol (DHCP) option | 10-09-2008 |
20080259933 | Path Controller, Path Control Method, and Program Therefor - A path controller | 10-23-2008 |
20080285569 | Device for Session-Based Packet Switching - Whereas the network architecture for ATM-based access networks on the DSL forum has already been defined, work on Ethernet-based access networks is still in its infancy. The invention relates to a novel aggregation solution for use in Ethernet-based broadband access networks. | 11-20-2008 |
20080291920 | SYSTEM AND METHOD FOR MANAGING COMMUNICATIONS - A system and method for managing communications is disclosed. A system that incorporates teachings of the present disclosure may include, for example, a communication device having a controller element to transmit a packet along a logical tunnel established through an internet service provider, wherein the route of the packet is managed according to a MPLS label of the packet and a VRF routing table. Additional embodiments are disclosed. | 11-27-2008 |
20080298370 | ROUTER - Even when session control traffic such as SIP traffic to be unitarily subjected to QoS management by a manager of a session control network such as an SIP network, and loopback traffic to be freely subjected to QoS management by users coexist, QoS processing can be appropriately performed. The edge router checks a routing table and the address information of an SIP message to derive an SIP stream direction. The edge router timely selects a table that can be set by only SIP network managers, and a table that can be set by user network managers as well, determines QoS setting information by collating other SIP/SDP message information, and sets it in a QoS function unit. | 12-04-2008 |
20080298371 | RELAY APPARATUS CAPABLE OF PREVENTING MISTAKEN LEARNING OF MAC ADDRESS LEARNING TABLE - A relay apparatus includes a MAC (Media Access Control) address learning table for recording transfer destinations for frames. The relay apparatus is connected to other relay apparatuses to compose a network of a ring redundancy method. The relay apparatus includes a port move detecting circuit for detecting a port move which occurs in a case where a frame arrives from other than a path learned in the MAC address leaning table on a path changing on ring redundancy. | 12-04-2008 |
20090003351 | Path changeover method and device - Path changeover method and device are provide in which a communication interruption time caused by occurrence of a transmission failure is shortened. On a frame receiving side, address information of a frame received from a first physical port is stored in a table in association with the first physical port. When detecting that a frame stored with the same address information as the address information stored in the table is received at a second physical port, the frame received at the second physical port is captured and following frames received at the first physical port are discarded. | 01-01-2009 |
20090016355 | COMMUNICATION NETWORK INITIALIZATION USING GRAPH ISOMORPHISM - A communication system, such as a computer system, with a plurality of processing nodes coupled by communication links stores a database of abstract topologies that provides a node adjacency matrix and abstract routing between nodes. A breadth-first discovery of the actual communication fabric is performed starting from an arbitrary root node to discover the actual topography. A graph isomorphism algorithm finds a match between the discovered topology and one of the stored abstract topologies. The graph isomorphism algorithm provides a mapping between the ‘abstract’ node numbers and the discovered node numbers. That mapping may be used to rework the stored routing tables into the specific format needed. The computed routing tables are loaded into the fabric starting at the leaf nodes, working back towards the root node (i.e., start loading from the highest node number and work back to the lowest numbered node). | 01-15-2009 |
20090016356 | METHOD OF OPERATING A NETWORK - An Internet Protocol router device ( | 01-15-2009 |
20090046723 | DISTINGUISHING BETWEEN CONNECTIVITY VERIFICATION AVAILABILITY AND FORWARDING PROTOCOL FUNCTIONALITY IN A COMPUTER NETWORK - In one embodiment, a local network device may determine an inability to establish a connectivity verification protocol (e.g., Bidirectional Forwarding Detection, “BFD”) session to a remote network device, such as from unreturned control messages. In response, the local network device may send at least one connectivity verification protocol echo message to the remote network device destined to be returned to the local network device and forwarded using a forwarding protocol. In response to receiving or not receiving the echo message, the local network device may thus determine whether the forwarding protocol is functioning between the local and remote network devices. In this manner, the local network device may determine whether an inability to establish a connectivity verification protocol session is due to an inability to forward packets between the devices, or due to the connectivity verification protocol not working (or not being configured) on the remote network device. | 02-19-2009 |
20090046724 | METHOD FOR COMPRESSING ROUTE DATA IN A ROUTER - A method for a router having a routing table and a forwarding table. In an embodiment, the method includes creating an entry for use in the forwarding table, the entry corresponding to multiple entries of the routing table. The entry may correspond to a set of entries of the routing table which specify overlapping IP addresses and a same next hop router, in one example. In another example, the entry may be an aggregate entry corresponding to a set of entries of the routing table which specify the same next hop router. | 02-19-2009 |
20090067435 | SYSTEMS, METHODS AND COMPUTER PRODUCTS FOR A TCP/IP STACK TO NOTIFY AN APPLICATION OF A STATE CHANGE MADE TO ALL ROUTES OVER A SINGLE IPV4 INTERFACE - Systems, methods and computer products for a TCP/IP stack to notify an application of a state change made to all routes over a single IPV4 interface. Exemplary embodiments include a including creating a master socket to the TCP/IP stack, obtaining all IPV4 active and inactive home interfaces from the TCP/IP stack, building and maintaining a home interface hash table of the obtained home interfaces, obtaining all the IPV4 host and network routes from the TCP/IP stack, building and maintaining a route hash table of obtained host and network routes, determining that a route is active when the route's home interface is active, receiving a notification via the master socket from the TCP/IP stack in response to a state change occurring in a home interface, and changing a respective state entry of the home interface in the home interface hash table. | 03-12-2009 |
20090073987 | Methods and Systems for Network Address Translation Management - A method for network address translation (NAT) includes providing a first and a second NAT table. The method further includes receiving a network packet and classifying the network packet based on a type of network traffic. Additionally, an entry is added to the first NAT table based on the classification of the network packet. | 03-19-2009 |
20090080436 | Protection of Transit Links in a Network - A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled. | 03-26-2009 |
20090080437 | Service selection in a shared access network using virtual networks - The present invention discloses a method and architecture for enabling multiple services or service providers to share the facilities of an access network infrastructure that provides physical connectivity to subscribers. | 03-26-2009 |
20090092140 | METHOD AND APPARATUS FOR PROVIDING A HIERARCHICAL STRUCTURE FOR ROUTING - A method and apparatus for providing a hierarchical structure for routing over packet networks are disclosed. The method first receives one or more packets from at least one customer endpoint device with a Customer Edge (CE) functionality, wherein said one or more packets are destined for a destination node. The method locates a route for routing said one or more packets by consulting an interface specific routing table. The method then forwards said one or more packets towards said destination node using said route. | 04-09-2009 |
20090097489 | METHOD FOR TRACKING TRANSMISSION STATUS OF DATA TO ENTITIES SUCH AS PEERS IN A NETWORK - A method for tracking a transmission status of one or more data elements to one or more devices. In one example, the method includes providing a list including one or more devices and one or more data elements; processing the list to determine a data element of the one or more data elements to transmit to a device of one of the one or more devices; and upon successfully transmitting the data element to the device, adjusting the list so that the list indicates that the device has received the transmitted data element. In this manner, the status of whether a particular data element has been sent to a particular device can be easily derived from the list. | 04-16-2009 |
20090122800 | FRAME TRANSFER ROUTE CONFIRMATION METHOD, NODE, FRAME TRANSFER ROUTE CONFIRMATION PROGRAM AND FRAME TRANSFER ROUTE CONFIRMATION SYSTEM - The frame switching unit | 05-14-2009 |
20090141727 | Method and System for Infiniband Over Ethernet by Mapping an Ethernet Media Access Control (MAC) Address to an Infiniband Local Identifier (LID) - A method of providing a converged InfiniBand over Ethernet (IBOE) network. An IBOE switch receives a data packet. If the data packet is received by the IBOE switch from the InfiniBand network, a translation utility generates an Ethernet media access control (MAC) address corresponding to an InfiniBand Local Identifier (LID) of said data packet. The translation utility generates an Ethernet packet and encapsulates an InfiniBand link layer packet before sending the packet. If the data packet is received by the IBOE switch from the Ethernet network, the translation utility removes the Ethernet header from the packet and looks up a LID corresponding to the MAC address. The translation utility calculates an outbound port number and sends the packet. | 06-04-2009 |
20090141728 | METHOD AND SYSTEM FOR PROVIDING VISIBILITY OF ETHERNET COMPONENTS TO A SUBNET MANAGER IN A CONVERGED INFINIBAND OVER ETHERNET NETWORK - A method of providing visibility of Ethernet components to a subnet manager in a converged InfiniBand over Ethernet (IBOE) network. If a port of an IBOE gateway corresponds to one or more InfiniBand devices, the subnet manager sends fabric management packets (FMPs) to discover the InfiniBand network and assigns physical local identifiers (LIDs) to the InfiniBand devices. If a port of the IBOE gateway corresponds to one or more Ethernet devices, the subnet manager sends FMPs to discover the Ethernet network. The subnet manager adds the Ethernet Media Access Control (MAC) addresses of any responding devices to an LID routing table and assigns LIDs to the Ethernet devices. The subnet manager configures one or more virtual Host Channel Adapters (HCAs) corresponding to the one or more Ethernet MAC addresses in the LID routing table. | 06-04-2009 |
20090185568 | METHOD AND SYSTEM FOR PACKET CLASSIFICATION WITH REDUCED MEMORY SPACE AND ENHANCED ACCESS SPEED - A method and system for packet classification is proposed for applications such as firewalls, intrusion detection, policy-based routing, and network service differentiations, within network systems such as Internet or intranet/extranet systems. The proposed method and system is characterized by the use of protocol-oriented rule rearrangement, the probable bit vector (PBV) based on the aggregated bit vectors (ABV) and folded bit vectors (FBV), an ABV-FBV index table dataset whose data structure is based on a featured split full-tree schema, and a DCBV (Don't-Care Bit Vector) dataset for packet classification. The combination of these features allows the packet classification to be implemented with a reduced amount of memory and access time during operation. | 07-23-2009 |
20090185569 | Composite Transport Functions - A network comprising a first layer processor (LP) configured to distribute a plurality of component communications to a plurality of component connections using a distribution table comprising a plurality of component communication identifiers (CCIDs) and the component connection associated with each CCID, a second LP configured to collect the packets from the component connections, and a composite connection coupled to the first LP and the second LP, wherein the composite connection comprises a plurality of the component connections and is configured to transport the component communications using the component connections, and wherein the distribution table and composite connection are configured such that component communications associated with at least the same CCID of a component communication takes the same path from the first LP to the second LP as from the second LP to the first LP. | 07-23-2009 |
20090190596 | TRANSPORTING MULTI-BASIC SERVICE SET (BSS) FRAMES OVER WIRED MEDIUM PRESERVING BSS-ID - A method for retaining network address of a wireless client device as the device roams between different access points operably connected to a single gateway is described. An embodiment comprises maintaining a table in the gateway memory containing the unique identifier of the wireless client device sent with each data packet. In addition to, the unique identifier, an entry in the table in the gateway memory includes the communication pathway established between the gateway and the wireless client device. When forwarding a data packet from the WAN to the wireless client device, the gateway uses the table in the gateway memory to determine the correct destination path for the data packet instead of relying on the destination address attached to the data packet. | 07-30-2009 |
20090201933 | METHOD, DEVICE AND SYSTEM FOR SIGNALING TRANSFER - The embodiments of the present invention disclose a signaling transfer method and device for transferring signaling. The method includes: creating, by a signaling transfer device, address mapping table according to address information carried in a registration message upon receipt of the registration message; and determining a match with the address mapping table and transferring signaling. The device includes: a signaling reception element adapted to receive signaling including a registration message and a call message; an address mapping table creation element adapted to create address mapping table according to address information carried in the registration message; and a signaling transfer element adapted to transfer the signaling according to the address mapping table. | 08-13-2009 |
20090201934 | SPOOF CHECKING WITHIN A LABEL SWITCHING COMPUTER NETWORK - A label switching router (LSR) is described that spoof checks Multi-protocol Label Switching (MPLS) packets to prevent malicious or inadvertent injection of MPLS packets within a label switched path (LSP). The LSR ensures that MPLS packets received from an upstream label switching router (LSR) contain labels that were advertised to that upstream LSR. A software module associated with a signaling protocol, such as the Resource Reservation Protocol (RSVP), the Label Distribution Protocol (LDP), or the Border Gateway Protocol (BGP), is extended to utilize an MPLS forwarding table, and MPLS interface table, and a remote autonomous system table. A set of interfaces for which the label was advertised may be checked to determine whether an interface on which a packet was received is contained in the set of interfaces. The MPLS forwarding table may contain a spoof-check field used to specify one of several different types of spoof checks and to specify the set of interfaces. | 08-13-2009 |
20090207847 | RELAY DEVICE AND RELAY METHOD - A relay device includes response frame transmitting technique for transmitting a response frame with the result of the inquiry to the effect that the source address coincident with the destination address to be inquired has been registered in the learning table to the relay device from which the inquiry frame was transmitted in the case that the registration judging technique has judged that the source address coincident with the destination address to be inquired has been registered in the learning table, and frame relaying technique for relaying the received frame whose relay has been temporarily postponed via the receiving port for the response frame in the case that the response frame was received. | 08-20-2009 |
20090232144 | NETWORK INTERMEDIATE APPARATUS AND METHOD FOR UBIQUITOUS NETWORK AND UBIQUITOUS NETWORK SYSTEM USING THE INTERMEDIARY APPARATUS - Discloses is an ubiquitous network intermediate apparatus and intermediate method that supports various internet services in order that wired terminals can connect to the network without an additional network setting. An ubiquitous network intermediate apparatus according to the present invention comprises a terminal access device outputting a packet received from a terminal according to a source IP address of the packet to a preset virtual path, and outputting a response packet received through the virtual path to the terminal; and a home access device outputting the packet received from the terminal access device through the virtual path to a home router, and transmitting the response packet received from the home router to the terminal access device through the virtual path according to a destination IP address. | 09-17-2009 |
20090296714 | SCALABLE MULTIPROTOCOL LABEL SWITCHING BASED VIRTUAL PRIVATE NETWORKS AND METHODS TO IMPLEMENT THE SAME - Example scalable multi-protocol label switching (MPLS) based virtual private networks (VPNs) and methods to implement the same are disclosed. A disclosed example spoke provider edge (PE) router for an MPLS-based VPN includes a truncated virtual routing and forwarding (VRF) table containing a first value referencing a hub PE router and a second value referencing a first customer edge (CE) router coupled to the VPN via the PE router, and a forwarding module to forward a packet received from the first CE router to the hub PE router when the packet contains an address referencing a second CE router coupled to the VPN via a second spoke PE router. | 12-03-2009 |
20090296715 | METHOD AND SYSTEM FOR PROGRAMMABLE DATA DEPENDANT NETWORK ROUTING - A method and system for routing fibre channel frames using a fibre channel switch element is provided. The switch element includes, a look up table that is indexed by domain, area, a virtual storage area number and/or AL_PA values of frames entering the fibre channel switch element; and logic for generating a column select signal that is used to select a column from the look up table for frame routing information The switch element also includes logic for validating a frame route by performing word depth match. A register is used to load look up table entries and column entries are selected based on the column select signal. The method includes, indexing a look up table with plural fibre channel frame header values; selecting a table value for routing a fibre channel frame based on a column select signal; and routing the frame if a route is valid. | 12-03-2009 |
20090304003 | Global Virtual VPN - A method, apparatus and article of manufacture for building next generation improved global virtual private networks over the Internet. The method comprises of building two layers on top of the public infrastructure ( | 12-10-2009 |
20090304004 | Regional Virtual VPN - A method, apparatus and article of manufacture for building next generation improved regional virtual private networks over the Internet. The method comprises of building two layers on top of the public infrastructure ( | 12-10-2009 |
20090323696 | METHOD OF PROVIDING A SUCCESSOR LIST - The invention concerns a method of providing a successor list (L) for routing in a peer-to-peer overlay network (N), and a network node and a computer program product to execute this method. The peer-to-peer overlay network (N) comprises a plurality of nodes ( | 12-31-2009 |
20100002707 | DYNAMIC UPDATE OF ROUTE TABLE - A method and apparatus for dynamically modifying routing information in an interconnect architecture without quiescence is herein described. Each agent/node holds routing information regarding target agents/nodes in an interconnect architecture, which may include routing preferences. When a node is to be hot removed, it generates port disable messages to neighbors. The neighbors disable a port the disable message is received on and generates a completion message back to the not to be removed. The node to be removed continues to route messages until it receives a completion; at which time it disables a corresponding node. When all nodes are disabled the device may be removed. Other nodes in the interconnect architecture learn of an agent removal through use of return cycles when messages reach dead ends during attempted routing of cycles. Furthermore, hot addition of a node includes broadcasting of an enable message to enable nodes for routing to the added node. | 01-07-2010 |
20100008367 | METHOD OF RELAYING TRAFFIC FROM A SOURCE TO A TARGETED DESTINATION IN A COMMUNICATIONS NETWORK AND CORRESPONDING EQUIPMENT - The present invention discloses a method of relaying traffic from a source application ( | 01-14-2010 |
20100020806 | Scalable Commodity Data Center Network Architecture - In one aspect, there is provided a method. The method may include receiving a packet at a switch coupled to a plurality of switches. The switch may determine, from a first level table comprising a plurality of prefixes, a prefix matching a first portion of a destination address of the received packet. The switch may also determine, from a second level table comprising a plurality of suffixes, a suffix matching a second portion of a destination address of the received packet, when the matching prefix of the first level table is associated with the second level table. The switch may forward, based on the first level table and the second level table, the received packet to an output port of the switch. In some implementations, the plurality of switches are configured as a fat-tree network. Moreover, in some implementations, the subject matter described herein provides a data center communication fabric that provides scalable communication bandwidth with significant fault tolerance using a plurality of smaller individual switches of substantially the same size and capability. Related systems, apparatus, methods, and/or articles are also described. | 01-28-2010 |
20100027549 | METHOD AND APPARATUS FOR PROVIDING VIRTUAL PRIVATE NETWORK IDENTIFIER - A method and apparatus for providing for providing a Virtual Private Network (VPN) identifier on a packet network are disclosed. For example the method configures a provider edge (PE) router and a customer edge (CE) router with a set of link local labels for each virtual private network (VPN), wherein said set of link local labels is used to identify a VPN membership. The method also generates a master virtual route forwarding (VRF) table on the PE router for routes that are allowed into an interface to the CE router. | 02-04-2010 |
20100040066 | NETWORK ADDRESS LOOKUP BASED ON BLOOM FILTERS - In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table. | 02-18-2010 |
20100046523 | WIDE AREA NETWORK OPTIMIZATION PROXY ROUTING PROTOCOL - In an example embodiment disclosed herein, Wide Area Network optimization modules coupled to peers are configured to maintain peer routing tables. The peer routing table (PRT) is used by the Wide Area Network optimization module to determine the peer for a given destination, such as an Internet Protocol “IP” destination. Each peer is responsible for advertising to other peers which networks the peer is able to reach. This information is advertised when a tunnel is first created and subsequently whenever necessary. Initially, a peer sends out a list of entries corresponding to its directly connected networks, with the exception of the network connected to the interface on which the peer is advertising (e.g. the network used for the tunnel). This enables other peers on the network to populate their PRT entries. | 02-25-2010 |
20100054258 | SWITCH, OPERATION METHOD THEREOF AND METHOD FOR UPDATING FORWARDING TABLE - A switch, an operation method thereof, and a method for updating a forwarding table thereof are provided. The method for updating the forwarding table includes receiving a packet, and determining whether the packet is one of a Join type packet and a Leave type packet for determining to adopt a first VLAN table or a second VLAN table. In the first VLAN table, a first apparatus and a second apparatus are defined in different VLANs, and in the second VLAN table, the first apparatus and the second apparatus are defined in a same VLAN. When it is determined that the packet is one of the Join type packet and the Leave type packet, the second VLAN table is adopted for updating the forwarding table for simplifying the content of the forwarding table. Further, an efficiency of the switch can be improved by using the updated forwarding table. | 03-04-2010 |
20100080233 | Demand-based distribution of internet protocol forwarding information within a router - Systems and methods are described that reduce the amount of forwarding table state on components within routers. This is performed by having a router line card generate a prefix-request message to its central processor which contains a full routing table. Line cards only populate their forwarding tables for packets needed to transmit. By being only concerned with information of packets that are traversing each line card, the amount of required memory and processing required may be reduced for a complete forwarding table. | 04-01-2010 |
20100080234 | Anycast-based internet protocol redirection to alleviate partial routing tables - Systems and methods are described that instruct routers having constrained hardware/memory to redirect all outbound traffic to a helper router. The helper router contains a full routing table that can forward any packet to its destination. In a large service provider network, helper routers may be distributed at multiple locations across the network. Since packets must detour through the helper router, the distributed helper routers minimize latency. | 04-01-2010 |
20100080235 | Forwarding Apparatus, Forwarding Method, and Computer Program Product - An extranet direct route allowing extranet forwarding to a directly linked device is written in a layer 2-layer 3-integrated forwarding table. The procedure of introducing a layer 3 address-to-layer 2 address correspondence relation table entry into the layer 2-layer 3-integrated forwarding table searches the layer 2-layer 3-integrated forwarding table with a layer 3 address of the correspondence relation table entry and a layer 3 interface as search keys to retrieve any forwarding entry relating to an extranet direct route as a forwarding destination. The procedure subsequently extracts a VRF of each retrieved forwarding entry and introduces the correspondence relation table entry for the extracted VRF into the layer 2-layer 3-integrated forwarding table. | 04-01-2010 |
20100085974 | COMMUNICATION DEVICE AND COMMUNICATION METHOD - A communication device includes: a transmission label table storage that stores a transmission label table that holds pseudo wire labels for each header information of Ethernet (standardized by IEEE 802.3 committee) frames; and an encapsulation unit that deletes the header information from the Ethernet (standardized by IEEE 802.3 committee) frame, adds a pseudo wire label and an MPLS tunnel label to the Ethernet (standardized by IEEE 802.3 committee) frame and transmits a packet to an MPLS network via a pseudo wire, when the header information of the received Ethernet (standardized by IEEE 802.3 committee) frame agrees with the header information held in the transmission label table. | 04-08-2010 |
20100098089 | PACKET TRANSFER DEVICE AND METHOD - Conventional Packet transfer technology relaying data through the network system needs to designate a relay communication line designated by the network system, together with relaying while taking into account the degree of importance or degree of priority of a packet. Accordingly, there is implemented, in a network system having a plurality of quality levels or communication lines, a device capable of dynamically controlling packet transfers in response to the quality or the state of the communication lines. The packet transfer device possesses a first table in which events that may occur on the occasion of transmission and reception processing are defined and a second table in which the processing executed in case the concerned defined event occurs is defined and, in case a defined event occurs, the second table is looked up and the packet transfer routes of the routing table are modified dynamically. | 04-22-2010 |
20100135305 | Recursively Partitioned Static IP Router Tables - A recursively partitioned static router-table, the data structure incorporating a first-level partition including subtries and an auxiliary trie. A node of the subtrie includes a path Q(N) from the root R of a trie T to a root N of the subtrie, a stride s for a next-level partition, a mask that characterizes a next-level perfect hash function, and a pointer to the hash table for the next-level partition. At least one of the trie T, the first-level partition, the auxiliary trie, and the next-level partition is represented by a base structure selected from the group consisting of MBT and HSST. | 06-03-2010 |
20100135306 | Apparatus and method for processing contents using routing table - A routing apparatus includes: a routing table management unit for generating a routing table by receiving interest information of a user of a mobile node, and for broadcasting the routing table through the mobile ad hoc network; an effectiveness calculation unit for calculating effectiveness values for respective paths, included in a routing table broadcasted by some other external node, based on both the interest information of the user of the mobile node and interest information of users of destination nodes of the respective paths when the routing table is received from the other external node; a storing unit for storing the generated routing table; and a routing path setting unit for setting a routing path on the basis of the routing table stored in the storage unit. The routing table management unit updates the routing table using the effectiveness values for respective paths calculated by the effectiveness calculation unit. | 06-03-2010 |
20100158016 | SYSTEM AND METHOD OF FAST ADAPTIVE TCAM SORTING FOR IP LONGEST PREFIX MATCHING - A system and method are provided for sorting IP routing table entries in a TCAM for longest IP prefix matching LPM of destination IP addresses. The IP routing table is divided into logical blocks, for each block an associated routing entry IP prefix length. Each block is of a respective size whose proportion of the total size of the routing table is determined by the associated IP prefix length. The blocks are ordered so that the TCAM returns an LPM when queried. Starting block sizes can be initialized to proportions which reflect actual expected numbers by proportion of routing entries by IP prefix length. The blocks also grow and shrink as entries are added and deleted so as to more closely mirror real-world populations of expected entries having the IP prefix length in question. | 06-24-2010 |
20100226373 | TRACKING FRAGMENTED DATA FLOWS - A device may receive a fragment of a fragmented data unit, determine a flow identifier that identifies a data flow with which the fragment is associated, and create a flow entry, based on the flow identifier, to store information associated with the data flow. The device may also determine a fragment key associated with the fragment, store a pointer to the flow entry based on the fragment key, correlate the fragment and another fragment, associated with the data flow, based on the fragment key and the pointer to the flow entry, and accumulate statistics associated with the fragment and the other fragment after correlating the fragment and the other fragment. | 09-09-2010 |
20100284409 | AUTONOMOUS SYSTEM BOUNDARY ROUTER DEVICE, AND METHOD FOR ACQUIRING VIRTUAL PRIVATE NETWORK LABEL - A method for acquiring a virtual private network (VPN) label is provided, in which the VPN is based on a multi-protocol label switching (MPLS) network. The method includes: acquiring VPN routing information; parsing the VPN routing information to obtain a VPN identifier, an upper-level router device identifier, and a receiving label; and acquiring a forwarding label according to the VPN identifier, the upper-level router device identifier, and the receiving label. The method is applied to an autonomous system boundary router (ASBR) device. | 11-11-2010 |
20110142054 | METHODS, APPARATUS AND ARTICLES OF MANUFACTURE TO MANIPULATE PACKET ROUTING - Example methods, apparatus and articles of manufacture to manipulate packet routing are disclosed. A disclosed example method includes extracting a destination address from a first packet, querying a route table based on the destination address to obtain a first label associated an egress router, querying the route table based on the destination address to obtain a second label associated with an interface of the egress router, forming a second packet from the first packet, the second packet including the first and second labels, and routing the second packet to the egress router based on the first label. | 06-16-2011 |
20110176551 | Information Handling System Data Center Bridging Features with Defined Application Environments - Information handling system network traffic is managed by populating a DCBX client framework with application network parameters associated with predetermined applications. Network devices, such as information handling system clients and servers, retrieve a TLV from a switch to obtain application network parameters for an application and apply the parameters so that the application executing on the device tags network communications with the associated parameters, such as bandwidth, loss less behavior, priority, latency, through put and CPU utilization. | 07-21-2011 |
20110194562 | Systems and Methods for Communication of Management Traffic Over Link Aggregation Group Interface for a Network Element with Distributed Architecture - According to one embodiment, a network element may include one or more network interfaces and a master control unit communicatively coupled to the one or more network interfaces. The one or more network interfaces may include in the aggregate, a plurality of physical ports configured as member ports of a link aggregation group. The master control unit may be configured to maintain a routing table, such routing table including information regarding which of the plurality of physical ports of the link aggregation group is designated as an active port for management traffic egressing via the link aggregation group, wherein the active port carries a communication channel for the management traffic segregated from carrier traffic, and communicate the routing table to each of the one or more network interfaces. | 08-11-2011 |
20110228785 | AUTOMATIC ROUTE TAGGING OF BGP NEXT-HOP ROUTES IN IGP - In one embodiment, a router in a routing domain exchanges routing information with one or more other routers located external to the routing domain using an exterior gateway protocol (EGP). The router exchanges routing information with one or more other routers located internal to the routing domain using an interior gateway protocol (IGP). The router detects a route to be advertised by the IGP is also used as a next-hop attribute of a route advertised by the EGP. In response, the router tags the route advertised by the IGP as an important route for convergence to indicate that the tagged route is to be processed before other routes that have not been tagged during convergence processing. The tagged route is advertised within the routing domain using the IGP. | 09-22-2011 |
20140146821 | METHOD AND APPARATUS FOR PROTOCOL DATA UNIT SYNCHRONIZATION IN AN IS-IS SYSTEM - A method and apparatus for effectuating synchronization of local LSPs and remote LSPs in an IS-IS router that includes an inter-process communication module disposed between an active router processor (RP) module and standby router processor (RP) module. Both remote LSP update(s) received by an active IS-IS process and local LSP update(s) generated by the active IS-IS process running on the IS-IS router are synchronized to corresponding database portions associated with a standby IS-IS process of the IS-IS router using respective raw LSPs. | 05-29-2014 |
370395320 | Employing particular searching function (e.g., hashing, alternate, re-routing) | 30 |
20080267193 | TECHNIQUE FOR ENABLING NETWORK STATISTICS ON SOFTWARE PARTITIONS - A computer implemented method, data processing system, and computer program product for enabling network statistics to be collected per software partition. When an incoming data packet is received at the Internet Protocol (IP) layer of an operating system, the IP address in the incoming data packet is identified. The IP address in the incoming data packet is then compared against IP addresses stored in a hash table, wherein the hash table maps each IP address in the hash table to a software partition of the operating system. If an IP address in the hash table matches the IP address in the data packet, the software partition mapped to the located IP address in the hash table is identified. Network statistics collected for the incoming data packet are then associated with the software partition. | 10-30-2008 |
20080273539 | SYSTEM FOR PERFORMING A PACKET HEADER LOOKUP - A system for performing a lookup for a packet in a computer network are disclosed. The packet includes a header. The system includes a parser, a lookup engine coupled with the parser, and a processor coupled with the lookup engine. The parser parses the packet for the header prior to receipt of the packet being completed. The lookup engine performs a lookup for the header and returns a resultant. In one aspect, the lookup includes performing a local lookup of a cache that includes resultants of previous lookups. The processor processes the resultant. | 11-06-2008 |
20090003352 | System and method for selecting a multicast IP address - The disclosed embodiments relate to a system and method for selecting a multicast IP address. More specifically, there is provided a method comprising selecting a first IP address from a plurality of IP addresses, hashing the first IP address to create a first hash value corresponding to the first IP address, determining whether the first hash value corresponds to a second IP address that is in use, and allocating the first IP address if the first hash value does not correspond to the second IP address that is in use. | 01-01-2009 |
20090028160 | Method And Apparatus For Detecting Malicious Routers From Packet Payload - The method, apparatus and system of detecting whether a router is compromised and configured to place malicious packets onto the network are disclosed. In one embodiment, a method for detecting a malicious router includes performing hash on a current ingress packet received via the network packet payload to generate ingress packet hash values. Further, includes performing hash on current egress packet that is associated with the current ingress packet to generate egress packet hash values. The generated ingress packet hash values and the egress packet hash values are then compared. Then the router is checked to determine whether it is potentially compromised and configured to place the malicious packets based on the outcome of the comparison. | 01-29-2009 |
20090046725 | Method for Processing Atm Cells and a Device Having Atm Cell Processing Capabilities - A method and a communication device for processing ATM cells. The communication device includes an input interface adapted to receive an ATM cell that is associated with a PHY value and includes a pair of VCI and VPI fields. The communication device is characterized by comprising a search unit, adapted to search, within a group of memory entries that belong to a memory unit, for a pair of VCI and VPI fields that have values that match the values of the VCI and VPI fields of the received ATM cell, if the received VCI field and VPI fields belong to a first predefined group of VCI and VPI fields. The communication device further includes a processor, connected to the search unit, wherein the processor is adapted to determine a channel identifier of the received ATM cell in response to a result of the search and in response to a PHY value associated with the received ATM cell. | 02-19-2009 |
20090129394 | Method and device for fragmented packet routing in virtualized environments - A method and device for routing fragmented data frames is provided. A data frame may be fragmented into a plurality of fragments, each fragment including a packet identifier and a fragment offset. The first fragment may further include a port number associated with a target partition of a plurality of partitions. If the fragment is a first fragment as determined from the fragment offset, the packet identifier and target partition is stored at a location in a hash table, the location calculated by using the packet identifier of the fragment as a hash key. Other embodiments are described and claimed. | 05-21-2009 |
20090190597 | DATA ITEM INTERVAL IDENTIFIER LOOKUP METHOD AND SYSTEM - A data item interval identifier lookup method and system is proposed, which is designed for integration to an information processing system for finding which predefined interval the value of an input data item, such as an IP (Internet Protocol) address, belongs. The proposed method and system is characterized by the use of a multi-stage lookup-table data structure having a number of cascaded lookup tables constructed by partitioning the data format of the input data item into a number of segments, each being mapped to one stage of lookup table data structure whose key-value relationships are predefined based on a predefined interval-and-identifier definition table. In operation, the values of the partitioned segments are sequentially used as lookup keys to search through the multi-stage lookup-table data structure until the corresponding interval identifier is found. This feature allows the implementation to have low memory requirement and enhanced system performance. | 07-30-2009 |
20090196296 | Data verification by challenge - An embodiment of the invention provides an apparatus and method for data verification by challenge. The apparatus and method perform acts including: sending a hash value of a data piece in a sender; if the hash value matches a stored hash value in a receiver, then sending a challenge from the receiver to the sender; sending a sample data set from the data piece in the sender, wherein the sample data set is determined by a window that is identified by the challenge; comparing the sample data set with a data set that is overlapped by the window for a stored data piece in the receiver; and performing a response based on the comparison of the sample data set and the stored data set that is overlapped by the window for the stored data piece. | 08-06-2009 |
20090196297 | INDUCING SYMMETRY VIA MULTI TOPOLOGY ROUTING - In one embodiment, a technique for selecting a topology, in a multi-topology routing network, based on a source-destination pair of a packet is provided. The packet may be routed on a preferred path of the selected topology. By selecting the same topology for the source-destination pair even if the source and destination addresses are swapped, upstream and downstream traffic may be routed in a symmetrical manner. For some embodiments, a topology may be selected using a hash value that is generated using an algorithm that is commutative with respect to the source and destination addresses. | 08-06-2009 |
20090201935 | SYSTEM AND METHOD FOR PARSING AND ALLOCATING A PLURALITY OF PACKETS TO PROCESSOR CORE THREADS - An apparatus and method are provided for allocating a plurality of packets to different processor threads. In operation, a plurality of packets are parsed to gather packet information. Additionally, a parse operation is performed utilizing the packet information to generate a key, and a hash algorithm is performed on this key to produce a hash. Further, the packets are allocated to different processor threads, utilizing the hash or the key. | 08-13-2009 |
20090238189 | METHOD AND SYSTEM FOR CLASSIFYING NETWORK TRAFFIC - A system includes a physical NIC associated with the computer and including receive rings for storing network traffic addressed to the VNIC, where the receive rings include a local receive ring for storing local traffic and a forwarding receive ring for storing forwarding traffic. The physical NIC further includes a hardware classifier configured to register a local Internet Protocol (IP) address associated with the VNIC in a lookup table, receive a packet including a destination IP address, classify the packet as local traffic or forwarding traffic using the lookup table, and store the packet in the local receive ring or the forwarding receive ring based on the type. The VNIC is configured to retrieve the packet from the receive ring, and process the packet in a type-specific manner based on the receive ring where the packet was stored, where the type-specific manner is different for local traffic and forwarding traffic. | 09-24-2009 |
20090274154 | Double-hash lookup mechanism for searching addresses in a network device - A hash function is applied to a set of data to generate a hash. A first subset of the hash is used to lookup an entry in a lookup table for a forwarding database. A second subset of the hash is used to identify, within the entry, data comprising an offset. The offset is applied to a location identified in the forwarding database by the first subset of the hash to determine an entry in the forwarding database. Optionally, the lookup mechanism is used in conjunction with one or more other forwarding databases. A method of updating the forwarding database within the double hash lookup framework is also described. | 11-05-2009 |
20090296716 | METHOD AND SYSTEM FOR PROGRAMMABLE DATA DEPENDANT NETWORK ROUTING - A method and system for routing fibre channel frames using a fibre channel switch element is provided. The switch element includes, a hashing module whose output is used to select the column from a look up table to route frames. The method includes, indexing a look up table using domain, area, virtual storage area network identifier, a hashing module output and/or AL_PA values; selecting a column from the look up table based on a column select signal; and routing a frame if a route is valid. The hashing module takes a fibre channel header to generate a pseudo random value used for selecting a column from the look up table. The hashing module uses same field values in an exchange to generate the pseudo random value. A hash function is used on a frame's OX_ID, D_ID, S_ID, and/or RX_ID to route fibre channel frames. | 12-03-2009 |
20090296717 | VLAN PROTOCOL - A switch controller includes a plurality of ports, a hash table, and a hash table control unit. The plurality of ports includes at least one bus port associated with ports connected to other switch controllers. The hash table stores MAC addresses and VLAN ids of ports within a network. The hash table control unit hashes a MAC address and a VLAN id of a packet to a first hash table location. | 12-03-2009 |
20090304005 | ROUTING TABLE LOOKUP ALGORITHM EMPLOYING SEARCH KEY HAVING DESTINATION ADDRESS AND INTERFACE COMPONENT - A routing table lookup algorithm is described that, for a first outbound packet, performs a first route lookup into the routing table with a first search key that includes the first packet's destination address and a first network interface identifier, and, for a second outbound packet, performs a second route lookup into the routing table with a second search key that includes the second outbound packet's destination address but does not include any network interface identifier. | 12-10-2009 |
20090304006 | ROUTING TABLE BUILD ALGORITHM FOR A ROUTING TABLE THAT USES A SEARCH KEY CONSTRUCTED FROM PACKET DESTINATION ADDRESS AND OUTBOUND INTERFACE - A method is described that involves, in view of a first default entry for a first subnet that is reachable through a first network service, where the first default entry has a numeric destination value, and in view of a second default entry for a second subnet that is reachable through a second network service, wherein the second default entry has the numeric destination value, sorting the first and second default entries by deciding that the first network service is ranked higher than the second network service. The method further involves configuring the first default entry within a routing table to have the numeric destination and not an interface component within the first default entry's search term, and, configuring the second default entry within the routing table to have the numeric destination and the second network service's interface component within the second default entry's search term. | 12-10-2009 |
20100020807 | COMMUNICATION NODE, COMMUNICATION METHOD, AND COMPUTER PROGRAM - A communication node includes: a routing information storing unit configured to store, as routing information, node information indicating a succeeding node and a preceding node in a ring network using a distributed hash table; and a routing information updating unit configured to update the node information, wherein when the succeeding node becomes inaccessible, the routing information updating unit acquires node information from one predetermined node accessible on the network at all times, determines, based on the acquired node information, whether the node that has supplied the node information satisfies a determination criterion for becoming its succeeding node, and designates the node that has supplied the node information as its succeeding node if the determination criterion is satisfied, while acquires node information from the preceding node indicated by the acquired node information if the determination criterion is not satisfied, and determines whether the node that has supplied the node information satisfies the determination criterion. | 01-28-2010 |
20100040067 | HASH FUNCTIONS FOR APPLICATIONS SUCH AS NETWORK ADDRESS LOOKUP - In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter. | 02-18-2010 |
20100061377 | FLEXIBLE AND EXTENSIBLE RECEIVE SIDE SCALING - In an embodiment, a method is provided. The method of this embodiment provides in response to receiving a packet, looking up a packet characteristic in one of at least one protocol table to determine one or more fields of the packet to use as a hash value, applying a hash function to the hash value to obtain a hash result, and using the hash result to determine one of a plurality of processors on which to process the packet. | 03-11-2010 |
20100142536 | UNICAST TRUNKING IN A NETWORK DEVICE - A network device for selecting a port from a trunk group to transmit a unicast packet on the selected port. The network device includes at least one trunk group including a plurality of physical ports. The network device also includes a table with a plurality of entries. Each entry is associated with one trunk group and includes a plurality of fields that are associated with ports in the trunk group. Each entry also includes a hash field that is used to select bits from predefined fields of an incoming unicast packet to obtain an index bit for accessing one of the plurality of fields. The network device further includes transmitting means for transmitting the unicast packet to a port associated with an accessed one of the plurality of fields. | 06-10-2010 |
20100226374 | HIERARCHICAL FLOODING AMONG PEERING OVERLAY NETWORKS - In a tiered system of networks capable of processing distributed hash table (DHT) Put and Get messages, if a sending network of a Put or Get is at a tier below a subject tier at which a subject network receiving the message is located, the message is forwarded to networks at tiers below the subject tier. On the other hand, if the sending network is at a tier equal to or above the subject tier, the message is forwarded to all networks in the system other than the sending network. | 09-09-2010 |
20100254391 | TECHNIQUE FOR GENERATING HASH-TUPLE INDEPENDENT OF PRECEDENCE ORDER OF APPLIED RULES - Techniques have been developed to facilitate evaluation of match and hash rule entries in ways that allow an implementation to decouple (i) the order in which match rules are applied to a first subset of packet header fields from (ii) the ordering of a second subset of packet header fields over which a non-commutative hash is computed. In short, the set and ordering of fields evaluated in accordance with a precedence order of rules need not correspond to the set or ordering of fields over which a hash is computed in a communications controller. | 10-07-2010 |
20100322250 | SYSTEMS AND METHODS FOR DISTRIBUTED HASH TABLE IN A MULTI-CORE SYSTEM - The present invention is directed towards systems and methods for using a distributed hash table to maintain the same configuration and resource persistency across a plurality of cores in a multi-core system. The distributed hash table includes a plurality of partitions, each partition being owned by a respective core of the multi-core system. A core may establish resources in the partition it owns. A core may request other cores to establish resources in the partitions they own and send resource information to the core. The core may locally cache the resource information. | 12-23-2010 |
20110013638 | NODE BASED PATH SELECTION RANDOMIZATION - Methods and apparatus for randomizing selection of a next-hop path/link in a network are disclosed. An example method includes randomly selecting one or more path-selection randomization options to be applied to data packets processed in the network device. The example method further includes receiving a data packet and applying, by the network device, the one or more path-selection randomization operations to the data packet. The example method also includes determining a next-hop path for the data packet based on the one or more path-selection randomization operations and transmitting the data packet to a next-hop network device using the determined next-hop path. | 01-20-2011 |
20110013639 | FLOW BASED PATH SELECTION RANDOMIZATION USING PARALLEL HASH FUNCTIONS - Methods and apparatus for randomizing selection of a next-hop path/link in a network are disclosed. An example method includes receiving, at the network device, a data packet. The example method further includes generating a first hash key based on the data packet and generating a first hash value from the first hash key using a first hash function. The example method also includes generating a second hash key based on the data packet and generating a second hash value from the second hash key using a second hash function. The method still further includes combining the first hash value and the second hash value to produce a combined hash value and selecting a next-hop path based on the combined hash value. | 01-20-2011 |
20110200050 | Method and system for common group action filtering in telecom network environments - A routing apparatus comprises memory including a common group identifier correlated to a plurality of values each derived using a specified network parameter, memory including a common group action correlated to the common group identifier, a parse action module configured for accessing the common group identifier correlating memory and for associating the common group identifier with a packet configured with the specified network parameter, and a common group action module configured for accessing the common group action correlating memory and for determining the common group action be applied to the packet. Determining the common group action to be applied to the packet includes selecting the common group action dependent upon the common group identifier. | 08-18-2011 |
20110249676 | Method and System for Forwarding and Switching Traffic in a Network Element - A method for forwarding a packet may include generating, by a first hash function module, a first hash value based on data included within the packet. The method may also include generating, by a second hash function module, a second hash value based on data included within the packet. The method may additionally include determining, by a first hash region integral to a memory and associated with the first hash function module, whether an index location of the first hash region corresponding to the first hash value includes an entry. Moreover, the method may include determining, by a second hash region integral to a memory and associated with the second hash function module, whether an index location of the second hash region corresponding to the second hash includes an entry. The method may further include, in response to a determination that at least one of the index location of the first hash region corresponding to the first hash value and the index location of the second hash region corresponding to the second hash value includes an entry, forwarding the packet based on forwarding information included within the entry. | 10-13-2011 |
20110255544 | SYSTEM AND METHOD FOR AN EXACT MATCH SEARCH USING POINTER BASED PIPELINED MULTIBIT TRIE TRAVERSAL TECHNIQUE - A method and system for finding an exact match for an N-bit wide address. A system for finding an exact match for an N-bit wide address in every clock cycle includes a label extraction module and one or more pipeline blocks. The label extraction module extracts K bits from the N-bit wide address. The extracted K bits are used by pipeline block | 10-20-2011 |
20120189013 | FLEXIBLE AND EXTENSIBLE RECEIVE SIDE SCALING - In an embodiment, a method is provided. The method of this embodiment provides in response to receiving a packet, looking up a packet characteristic in one of at least one protocol table to determine one or more fields of the packet to use as a hash value, applying a hash function to the hash value to obtain a hash result, and using the hash result to determine one of a plurality of processors on which to process the packet. | 07-26-2012 |
20140105215 | CONVERTING ADDRESSES FOR NODES OF A DATA CENTER NETWORK INTO COMPACT IDENTIFIERS FOR DETERMINING FLOW KEYS FOR RECEIVED DATA PACKETS - A network switch handles a data packet by determining a plurality of address items. An identifier is determined that is singularly associated with each address item in the set, the identifier having fewer bits than the associated address item. A flow key for the packet using (i) at least some of the plurality of fields, and (ii) the identifier associated with each address item in the set, and not the associated address item. | 04-17-2014 |