Abstract: A method may include receiving a packet; identifying the packet as a multicast packet for sending to a plurality of destination nodes; selecting a first forwarding table or a second forwarding table for sending the packet to each of the plurality of destination nodes, wherein the first forwarding table includes first port information associated with a first destination and second port information associated with a second destination, and wherein the second forwarding table includes third port information associated with the second destination; sending the packet to the first destination using the first port; and sending the packet to the second destination using the second port when the first forwarding table is selected and sending the packet to the second destination using the third port when the second forwarding table is selected.

Abstract: The exemplary embodiments described herein relate to systems and methods for optimizing the aging and learning processes. One embodiment relates to a system comprising a shared memory, a plurality of forwarding cores in communication with the shared memory, wherein each forwarding core includes a local memory, and an arbitrator core in communication with the forwarding cores and the shared memory, wherein the arbitrator core receives forwarding information from a plurality of forwarding cores, wherein each of the forwarding cores includes a local memory storing local forwarding tables, synchronizes the forwarding information from each of the local forwarding tables to generate a temporary working table, sorts the temporary working table into a predetermined array, generates a master forwarding table from the temporary working table, and distributes the master forwarding table to each of the forwarding cores.

Abstract: Network packets may be transmitted from packet sources to packet destinations through a network of switches. The switches may have corresponding flow tables that control how the packets are forwarded through the switches. A controller server may generate network switch forwarding paths for the network packets by modifying the flow tables with entries based on attributes of the network packets and network topology information. The controller server may forward selected packets directly to packet destinations instead of generating the network switch forwarding paths. To determine which packets to directly forward, the controller server may calculate cost metrics associated with the network switch forwarding paths and associated with forwarding network packets directly to packet destinations.

Abstract: A method includes establishing a bi-directional pseudowire (BPW) between a first provider edge (PE) router and a second PE router that are forwarders for a multi-homed VPLS customer site associated with a VPLS domain. The first PE router has a designated forwarder status and the second PE router has a backup forwarder status relative to the VPLS customer site. The BPW is established as an auxiliary standby BPW external to the VPLS domain. The method also includes detecting a change in topology of the network with the first PE router, wherein the change in topology affects connectivity by the first PE router to the VPLS customer site associated with the VPLS domain, and, upon detecting the change in topology, utilizing the BPW as an active interface within the VPLS domain for forwarding network traffic to the VPLS customer site.

Abstract: 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.

Abstract: The present invention relates to providing virtual private network (VPN) services between two or more Autonomic Systems (AS). An aggregation edge router (ASBR) is provided in two or more autonomous systems (Asx,Asy). The aggregation edge routers are configured such that routing peering between the two or more autonomous systems is done between the aggregation edge routers in these autonomous systems. Each aggregation edge router is a routing peer of other edge routers (PE) in its own autonomous system. The Multi-Protocol Label Switching (MPLS) network is used between the different autonomous systems.

Abstract: An object of the invention is to improve the reliability of a wireless control network management system. Gateway devices for relaying data communication between a monitoring/controlling host connected thereto via a wired network and a plurality of wireless nodes connected thereto via wireless circuit and constituting a wireless network, wherein the gateway device comprises wireless communication means for sending data from the host to at least any one of the wireless nodes, and redirect means for causing the wireless communication means to send the data to one of the wireless nodes and to transfer the data to the other gateway device connected to the wired network.

Abstract: A system to manage data congestion in a computer network may include network devices to route data packets throughout the network. The system may also include a source node that sends data packets to any of the network devices. The system may further include a routing table at each network device that is updated by the source node, and the route the data packets are sent by any network device is based upon each respective routing table.

Abstract: An embodiment is a technique to perform network-based traffic recognition and packet classification. A port identifier in a transport layer header of a packet having a packet type associated with a priority level is extracted. The packet is transmitted from or to an application according to a network protocol in a multi-hop mesh network having a local node and a remote node. The packet is classified into the packet type using one of a pre-defined port list, a dynamic port table, and an application header of the application.

Abstract: Aspects of a method and system for best-M CQI feedback together with PMI feedback may include generating a plurality of feedback messages, which may be communicated from a mobile station to a base station, wherein at least one of the generated plurality of feedback messages may be associated with each corresponding selected one of a plurality of Channel Quality Indicator (CQI) reporting units. The at least one of the generated feedback messages may comprise CQI information and Pre-coding Matrix Index (PMI) information, which may both be associated with the selected one of the plurality of CQI reporting units. At least one other of the generated plurality of feedback messages may comprise an aggregate CQI information, which is based on one or more of the plurality of CQI reporting units.

Abstract: Deep packet inspection is performed on packets in a network intrusion prevention system. A processing priority may be assigned to a packet based on characteristics such as the protocol type of the packet. Higher-priority packets may be processed before lower-priority packets or otherwise given preferential processing treatment. Deep packet inspection may be performed on the packet, and the processing priority of the packet may be changed based on the amount of time required to complete inspection of the packet. For example, the processing priority of the packet may be lowered if inspection of the packet takes longer than a predetermined time threshold. Furthermore, inspection of such packets may be suspended and either terminated or resumed at a subsequent time.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for semi-centralized routing. One of the methods includes receiving one or more routes and determining that a received route identifies a new set of paths different from each routing path group in a maintained set of routing path groups. A new routing path group is created that corresponds to the new set of paths. The new routing path group is assigned an identifier of the routing path group. The new routing path group is converted to a corresponding new flow path group. A flow path group that was converted from the routing path group is replaced on a network device with the converted new flow path group.

Abstract: An adjunct network device includes several ports, an uplink interface, and an adjunct forwarding engine coupled to the ports and the uplink interface. A first port is configured to receive a packet, which includes a destination address. The adjunct forwarding engine is configured to send the packet to the uplink interface if the destination address is not associated with any of the ports. The packet is sent to one of the ports if the destination address is associated with the one of the ports.

Abstract: A method to manage data congestion in a computer network may include network devices to route data packets throughout the network. The method may also include a source node that sends data packets to any of the network devices. The method may further include a routing table at each network device that is updated by the source node, and the route the data packets are sent by any network device is based upon each respective routing table.

Abstract: A message propagation scheme for a distributed virtual world is provided. In general, each of a number of peer servers hosts a cell of the virtual world, where the cell is also referred to herein as a virtual space. A peer server issues an advertisement/subscription (ad/sub) message, or message flow path setup message, identifying message types produced by the virtual objects in the virtual space hosted by the peer server and message types consumed by the virtual objects in the virtual space hosted by the peer server. Based on the ad/sub message, for each message type produced, message flow paths from the peer server to other peer servers hosting virtual objects that are consumers of the message type are identified. Likewise, for each message type consumed, message paths from other peer servers hosting virtual objects that are producers of the message type to the peer server are identified.

Abstract: The instant application describes a method for enabling an assisted dialing on a mobile device. The method includes steps of receiving, at a mobile device, a number; automatically identifying a reference country and one or more parameters associated with the reference country; and automatically determining whether the received number should be modified based on the one or more parameters associated with the reference country. The method also includes steps of automatically modifying the received number upon determining that the received number should be modified; and transmitting the modified number to a wireless network servicing the mobile device.

Abstract: Internet data such as Border Gateway Protocol routing information and traceroute measurements are processed to create realistic predictive models of the paths IP traffic is likely to take between any two points on the Internet, even when direct measurements of the paths is not feasible. The prediction includes three categories: topology (what paths may exist), weighting (which paths are more or less likely to be taken under varying operational circumstances), and performance (latency, loss, jitter, etc. across the predicted paths).

Abstract: 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.

Abstract: An improved technique for distributing routing information that allows routes to be prioritized such that information associated with higher priority routes is sent in update messages ahead of information associated with lower priority routes, thereby enabling the higher priority routes to converge faster than the lower priority routes. In the preferred embodiment of the invention a route policy map that associates routes with priorities is defined. The policy map is then applied to the routes to prioritize the routes. Update messages are then generated using the priority information and the route information contained in the update messages is organized such that route information associated with higher priority routes is placed ahead of route information associated with lower priority routes.

Abstract: Methods, systems, and computer program products for providing voicemail routing information in a network that provides customized voicemail services are disclosed. According to one method, a voicemail routing query is received at an advanced voicemail routing node, where the query includes at least one parameter associated with a voicemail transaction. Based on at least one query parameter, voicemail routing information may be determined that identifies a voicemail server and a voicemail service from among a plurality of voicemail servers, where at least some of the voicemail servers provide different services. A voicemail routing query response may then be generated including the determined voicemail routing information.

Abstract: Adaptive packet routing is employed in a multiprocessor network configuration such as an InfiniBand switch architecture. Packets are routed from host to host through one or more switches. Upon receipt of a packet at a switch, the packet header is inspected to determine the destination host. A destination field in the header is used to index into a lookup table or other memory, which produces a route type and an output port grouping. Depending on the route type, one or more primary and secondary output port candidates are identified. An output port arbitration module chooses an output port from which to send a given packet, using congestion sensing inputs for the specified ports. A heuristic may include the congestion information that is provided to the arbitration module. Switching may be performed among minimal or non-minimal routes along each hop in the path, depending upon link and packet injection information.

Abstract: This invention first presents SRAM based pipeline IP lookup architectures including an SRAM based systolic array architecture that utilizes multi-pipeline parallelism idea and elaborates on it as the base architecture highlighting its advantages. In this base architecture a multitude of intersecting and different length pipelines are constructed on a two dimensional array of processing elements in a circular fashion. The architecture supports the use of any type of prefix tree instead of conventional binary prefix tree. The invention secondly proposes a novel use of an alternative and more advantageous prefix tree based on binomial spanning tree to achieve a substantial performance increase.

Abstract: A method for controlling advertising of routing data to neighbor routers is presented. A list of prefixes is maintained (301) and each prefix is associated (302) with an own indicator vector that contains a data item for each of the neighbor routers so that the data item indicates (304) whether the prefix concerned is to be advertised to the neighbor router concerned. For each neighbor router there is (303) a handling pointer pointing to the prefix that is relevant to the status of an advertising process related to this neighbor router, and the handling pointer is moved forward on the list of prefixes according as the prefixes are advertised to this neighbor router. As there is no need to maintain an own list of prefixes for each neighbor router separately, but only neighbor router-specific entries in the indicator vectors, savings can be achieved in the required memory space.

Abstract: A network device acting as a forwarding element within a software-defined network receives a representation of configurable flow table definitions and configurable logic for selecting between flow tables. The network device creates a flow table based on each of the configurable flow table definitions and installs the configurable logic for selecting between flow tables. The network device receives data to populate configurable key columns and action columns of the flow tables and populates the flow tables using that data. The network device then selects from forwarding decisions for packets according to the configurable logic for selecting between flow tables, the flow tables, and each packet's values in relevant header fields required by the configurable logic.

Abstract: A network device acts as a controller within a software-defined network. The network device receives a processing definition, which includes a representation of configurable definitions of protocols, configurable flow table definitions, and configurable logic for selecting between flow tables defined by the configurable flow table definitions. The network device translates the processing definition to create a parser configuration package, which is distributed to a plurality of forwarding elements. This distribution causes each forwarding element to create a flow table based on each of the configurable flow table definitions. The flow tables include one or more configurable key columns and a set of one or more action columns to store forwarding decisions. The network device transmits data to populate the configurable key columns and action columns of the flow tables created within each of the plurality of forwarding elements.

Abstract: A method and apparatus to route information over a network is described.

Abstract: 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.

Abstract: A method includes collecting route parameters from a first intermediate node and a second intermediate node that can be configured to communicatively couple a source node to the destination node, determining at least a first route through the first intermediate node and a second route through the second intermediate node, and determining which route among the first route and the second route is optimal according to one or more criteria.

Abstract: A method is described that involves associating an outbound packet with a first network interface and constructing a search key from an identifier of the first network interface and the outbound packet's destination address. The method further entails submitting the search key to a routing function where the routing function identifies the outbound packet's next hop address. The method also involves transmitting the outbound packet to a node identified by the next hop address from the first network interface.

Abstract: The present invention relates to the field of wireless communications technologies and discloses a method, an apparatus, and a system for setting up a Radio Bearer (RB) in order to enable end-to-end RB setup from a User Equipment (UE) to an evolved NodeB (eNB) in a relay network system. The method includes: receiving a first RB setup message sent by an eNB; performing RB setup preprocessing according to the first RB setup message; generating a second RB setup message according to a result of the RB setup preprocessing; and sending the second RB setup message to a UE, notifying the UE to set up an RB on an access link. The present invention is mainly applicable to the relay network system.

Abstract: In one embodiment, service routers may register their serviced VPNs with a service directory/broker (SDB), and edge routers may register their attached VPNs. The SDB may then return service headers, each corresponding to a particular VPN, and also returns an address of a service router corresponding to each service header to the edge routers. An edge router may then push an appropriate service header onto a received packet, and forward the packet to the corresponding service router, which forwards the packet based on a maintained VRF for a VPN according to the service header (e.g., thus the edge routers need only maintain limited/reduced VRFs). Also, services provided by the service routers may be distinguished using service headers accordingly. In this manner, the edge routers may forward packets requiring one or more desired services to service routers configured to perform such services.

Abstract: A method for operating a wireless mesh data network with multiple nodes, wherein data frames are transmitted from a source node via one or more intermediate nodes to a destination node, wherein the source node, the one or more intermediate nodes, and the destination node constitute network nodes of the data network, wherein during transmission of a data frame, at least some of the network nodes which receive the data frame, using a precursor list for the destination nodes which is assigned to the destination nodes of the data frame, check whether the network node sending the data frame is in the precursor list, and wherein in the case of a positive result, the data frame is transmitted to a further network node, and in the case of a negative result, the data frame is thrown out or processed by an error recovery routine.

Abstract: Mechanisms are provided to improve efficiency of systems operating on internet protocol (IP) over Infiniband (IB) networks. One mechanism includes multicasting a first ARP request from a source node, the first ARP request including an IP address of a source port of the source node, and performing load-balancing of host traffic across a plurality of ports of a plurality of nodes by sending a reply from a destination node corresponding to the IP address included in the first ARP request, the reply being sent over the source port to the source node.

Abstract: The present invention relates to a protocol accelerator module for a data transmission protocol level of a transceiver, particularly but not exclusively for rapid forwarding of data packets in wireless sensor networks using the time-division multiple access method according to the IEEE 802.15.4 standard. The invention also relates to a method of transceiver operation for rapid forwarding of data packets, likewise particularly, but not exclusively, in wireless sensor networks using the time-division multiple access method according to the IEEE 802.15.4 standard. The core of the invention is a reference table which stores references from identifiers of second transceivers to identifiers of third transceivers as well as references from specific messages to identifiers of third transceivers. A transceiver can check during reception of a data packet whether it is a data packet to be forwarded, and can take appropriate precautions for rapid sending of a data packet to be forwarded.

Abstract: A system is connected to an access point via a network, receives packet transmission information held by the access point, and extracts an address having a transfer destination which is radio interface from the packet transmission information. It is assumed that the terminal of the extracted address exists under the access point holing the packet transmission information. Thus, it is possible to realize connection relationship between a terminal and an access point at low cost and not depending on the vendor.

Abstract: A device may include a control module configured to distribute sets of routing entries to line cards, each of the sets including a portion of a master table for looking up routes based on network addresses. In addition, the device may include a first one of the line cards configured to receive one of the sets of routing entries, store the received set of routing entries in a local table, receive a packet from a network, obtain a routing entry using the local table based on an address associated with the packet, and send the obtained packet to a second one of the line cards, the second line card associated with the routing entry. Further, the device may include the second line card configured to forward the packet toward the address in the network.

Abstract: Methods and apparatus to utilize route aggregation for exchanging routes in a communication network are disclosed.

Abstract: A method and apparatus for performing an Internet Protocol (IP) network lookup in a forwarding device including an internal processor memory storing a first next hop information table and membership query information, and an external processor memory storing a plurality of prefix-compressed trees and a second next hop information table is described. In another embodiment consistent with present invention, a method (and apparatus) for creating stored data structures representing network forwarding information used for network route lookup is described.

Abstract: In one embodiment, a routing table of a router is populated with a plurality of prefixes. One or more performance characteristics of the plurality of prefixes are monitored. The router determines that a need exists to split a selected prefix of the plurality of prefixes. The router determines one or more boundaries upon which to split the selected prefix based on the monitored performance characteristics. The router then injects one or more more-specific prefixes into the routing table, each more-specific prefix referring to a smaller subset of nodes than the selected prefix, to split the selected prefix on the one or more boundaries to create a plurality of split prefixes. The split prefixes are controlled to optimize distribution of traffic.

Abstract: An interconnect block for a data processing apparatus, said interconnect block being operable to provide data routes via which one or more initiator devices may access one or more recipient devices, said interconnect block comprising: a first and a second portion; said first portion comprising at least one initiator port for communicating with one of said initiator devices, and at least one recipient port for communicating with one of said recipient devices; said second portion comprising at least two recipient ports for communicating with at least two recipient devices, said second portion being connected to said first portion via at least two parallel connecting routes, said at least two recipient ports being connectable to said at least two parallel connecting routes; wherein in response to a request received from one of said initiator devices at said first portion to perform a transaction accessing one of said at least two recipients in communication with said second portion, said interconnect block is op

Abstract: Disclosed is a technique for surely supporting multihoming for a mobile terminal (mobile node) moving in a local mobility domain. A mobile node (MN) 11 connects via an IF 110 to a mobile access gateway (MAG) 102 that supports multihoming, and further attempts to connect via an IF 111 to a MAG 103 that does not support multihoming. Under these conditions, according to this technique, when the MN recognizes that the MAG 103 does not support multihoming, the MN notifies a local mobility domain that the MAG 103 does not support multihoming if connection with the MAG 103 is not yet established, and notifies the local mobility domain of information on a connection to a local mobility domain other than the MAG 103 (connection with the MAG 102) if the connection with the MAG 103 is already established.

Abstract: A method, apparatus and computer program product for performing location based load balancing of wireless access points and wireless switches is presented. A wireless controller (WC) receives an associate message from an Access Point (AP)/wireless switch (WS) at the WC. The WC then determines whether a preferred WC for the AP/WS is available. When the preferred WC is not available, then the WC determines if an alternate WC for the AP is available. When the alternate WC is not available, an administrator configured policy may be used that maps the AP to a specific WC. When the policy does exist then the AP is coupled to the WC according to the policy and when the policy does not exist then the WC parses the AP/WS location information for the AP/WS to determine an available geographically closest WC for the AP/WS and sends a message to the AP/WS relating to the available WC. The WC will also assign an available geographically closest WS to AP.

Abstract: An apparatus includes a memory configured to store multiple route descriptors as a tree, a communications interface configured to be in communication with an access switch, and a processor operatively coupled to the memory and the communications interface. Each route descriptor is a node within the tree, and includes a next hop destination associated with a next hop destination of a route associated with that route descriptor and a next hop indicator associated with a quantity of routes represented by that route descriptor. A first route descriptor has a first child route descriptor and a second child route descriptor. The processor is configured to define, at a first time, a value of the next hop destination of the first route descriptor and to send, at a second time after the first time, the value of the next hop destination of the first route descriptor to the access switch.

Abstract: A system comprising an access node (AN) coupled to a plurality of service providers (SPs) and a host and configured to forward a plurality of services between the SPs and the host using a plurality of first connections between the AN and the host and a plurality of second connections between the AN and the SPs, and a router gateway (RG) positioned between the host and the AN and coupled to the AN via an access line that comprises the first connections, wherein the AN translates a plurality of first identifiers for the first connections to a plurality of second identifiers for the second connections to route the services appropriately between the host and the SPs over the first connections and the corresponding second connections.

Abstract: A packet processor is described that performs keep alive message processing using a bifurcated aging table approach. The packet processor includes an aging table, a binding module and an aging daemon. The aging table includes a plurality of records corresponding to a plurality of network links supported by the packet processor. Each record in the aging table is used to track an aging status of a corresponding network link. The binding module associates a received message with a record in the aging table based on information in the received message. The aging daemon scans the aging table, updates the aging status of each network link, and determines that a network link has failed when the updated status for the respective network link exceeds a predetermined threshold.

Abstract: Techniques are described for identifying destinations in a virtual network by defining virtual entities such as a port profile as the destination for network policies, such as redirect or span to be a logical set of ports (i.e., ports belonging to a port-profile or a port group) where the members of the set of ports may be added/removed dynamically without requiring any changes to the network policy. Further, a network administrator (or other user) may predefine the destinations for a network policy even before some or all of the destinations are active on a given virtualized system. In such cases, the network policies may go into effect when the required entities become available.

Abstract: A routing system and method for flows within a network provides multicast flow transport for one or more groups. Transit routers comprising processing units that run overlay processes route one or more flows based on overlay group identifiers. Access nodes issue requests for overlay groups in order to receive flows from the transit routers. The overlay processes utilize a mapping service that maps overlay group identifiers to native multicast group identifiers. A control channel between the access nodes and transit routers is used for communicating access nodes requests, overlay group identifiers, and native multicast group identifiers.

Abstract: A wireless communication network includes a central node and a plurality of sub-nodes including relay nodes and terminal nodes. A method for adaptively selecting a route for communications in the network includes: generating a global routing table of the network based on a predetermined criterion, by the central node independently or in cooperation with a part of the relay nodes; generating a local routing table of each of the sub-nodes based on the global routing table, and informing the local routing tables to the respective sub-nodes to store the local routing tables in the respective sub-nodes, by the central node independently or in cooperation with a part of the relay nodes, the local routing table including paths from the corresponding sub-node to adjacent nodes; and adaptively selecting, by the sub-node, a path from the local routing table thereof for communications according to a predetermined rule.

Abstract: In order for a source node including a vehicle multihop protocol unicast apparatus to route data to a destination node, the source node broadcasts a location request message to neighbor node and receives a location response message from the neighbor nodes in response to the location request message. Therefore, the source node routes unicast data on the basis of the location information of the destination node included in the location response message. At this time, the source node uses a location based forwarder selecting algorithm in order to select a forwarder.

Abstract: A VPN apparatus is included in a VPN system with other VPN apparatuses to interconnect bases including first bases each having an access line and a second base having at least two access lines. The VPN apparatus comprises a first virtual VPN apparatus and a second virtual VPN apparatus. The first virtual VPN apparatus is connected to one of the first bases via an access line and carries out frame forwarding by using a first forwarding table for forwarding frames to be transmitted/received between two first bases or between one first base and one second base. The second virtual VPN apparatus is connected to the second base via one of the at least two access lines, carries out frame forwarding by using a second forwarding table for forwarding frames to be transmitted/received between at least two bases including the second base, and does not carry out forwarding frames to one of the other VPN apparatuses that is connected to the second base via another one of the at least two access lines.