Abstract: An example method involves rerouting data from a logical circuit to a logical failover circuit when the logical circuit fails based on an exceeded quality of service parameter. The logical failover circuit is selected based on a committed bit rate, a variable bit rate, or an unspecified bit rate. The example method also involves rerouting data from a first set of switches to a second set of switches in the absence of a failure associated with the logical circuit. The logical circuit comprises variable communication paths, and the second set of switches are to form a route associated with the variable communication paths that is not predefined and that is dynamically defined at a time of automatic rerouting while maintaining the logical circuit through the second set of switches.

Abstract: Discovery of services between devices is provided prior to establishing a connection between devices, including wireless-enabled devices or devices that are communicatively coupled to wireless access points or other wireless communication devices. Discovering services prior to establishing a connection may facilitate finding a desired service. The services that may be discovered may be, for example, print services, camera services, PDA services or any other suitable services. Services may be discovered using 802.11, Bluetooth, UWB or any other suitable wireless technology. An information element is used to wirelessly convey information related to a service and/or information related to service discovery.

Abstract: In one embodiment, a node determines an intention to transmit a diversely forwarded packet through a computer network, and as such, transmits a first version of the packet having a packet identifier (ID) and a first distinguisher value to a first next-hop node, and transmits a second version of the packet having the same packet ID and a second distinguisher value different from the first distinguisher value to a second next-hop node different from the first next-hop node. In another embodiment, a next-hop node that receives the packet determines whether any previously received packet at the next-hop node had a same packet ID and a different distinguisher value. In response to determining that no previously received packet has the same packet ID and different distinguisher value, the next-hop node stores the packet ID and the distinguisher value, and forwards the packet to a selected next-hop node.

Abstract: The embodiment discloses a connection oriented packet network using an MPLS-type label switching technology. The network uses a very fast hardware-oriented self-routing protocol that can expose a path right-of-way and program a connection between a calling and called party at wire speed. The embodiment requires no provisioning and is well suited for mobile and ad-hoc networks. The system and method taught can be applied to other data networks where performance guarantees are important.

Abstract: A network element can include a proxy element that is configured to receive a request from a source node to establish a Transmission Control Protocol (TCP) connection from a first network address of the source node through a Packet Data Network Gateway (PDN GW) to a destination node for an IP flow. The proxy element applies an IP flow offloading policy function to determine that the requested TCP connection for the IP flow should bypass the PDN GW. The proxy element responds to the determination by communicating to the destination node a request for TCP connection with a second network address substituted for the first network address of the source node to establish the TCP connection for the IP flow from the source node to the destination node through a broadband network without passing through the PDN GW.

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

Abstract: During connection establishments for a protocol with bidirectional identifiers, connection data is allocated, the locally selected identifier is a pointer to the allocated connection data, and a mathematical transformation is applied to the pointer. The pointer and a result of the mathematical transformation are included in a first and second portion of the connection establishment packets respectively. Upon receipt of a data packet for that protocol, a first and second portion of the data packet (which correspond to the first and second portion of the connection establishment packets) are extracted. The same mathematical transformation used during connection establishment is applied to the data extracted from the first portion of the data packet. The result of that mathematical transformation is compared with the data extracted from the second portion of the data packet.

Abstract: A method is described that entails assigning a source network address to an outbound packet, associating the outbound packet with a network service and identifying a first network interface associated with the network service. The method further entails inquiring into and confirming that the first network interface is associated with the source network address. The method further entails 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, the routing function providing the outbound packet's next hop address. The method further entails transmitting the outbound packet to a node identified by the next hop address from the network interface.

Abstract: An example method involves rerouting a logical circuit from a first set of switches to a second set of switches to communicate data between network devices without breaking the logical circuit. The logical circuit includes variable communication paths, and the second set of switches are to form a route associated with the variable communication paths that is not predefined and that is dynamically defined at a time of automatic rerouting. The example method also involves detecting a failure of the logical circuit based on at least one of a committed information rate or a committed burst size having been exceeded. In addition, the data is rerouted from the logical circuit to a logical failover circuit in the data network in response to detecting the failure of the logical circuit. The logical failover circuit includes an alternative communication path to communicate the data.

Abstract: 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 the first hash value and generating a second hash value from the second hash key using a second hash function. The example method still further includes selecting a next-hop path based on the second hash value.

Abstract: Discovery of services between devices is provided prior to establishing a connection between devices, including wireless-enabled devices or devices that are communicatively coupled to wireless access points or other wireless communication devices. Discovering services prior to establishing a connection may facilitate finding a desired service. The services that may be discovered may be, for example, print services, camera services, PDA services or any other suitable services. Services may be discovered using 802.11, UWB or any other suitable wireless technology. As one example, particular services may be requested. As another example, services that are provided by a device may be advertised.

Abstract: A method of assigning a priority to a document in a content-routed network including a plurality of routers interconnected by links, involves matching rules against the content of a received document to assign a priority, mapping the priority onto an egress link, and mapping the egress links onto the interconnect network between content routers to achieve end-to-end quality of service.

Abstract: The present disclosure provides an apparatus and method for packet classification using a Bloom filter and includes determining a matching length of how long each field value of one or more fields in an input packet coincides with a field value of the corresponding field stored in a rule set by performing a field-by-field search on the fields in the input packet, and generating a tuple list made up of a combination of one or more of the matching length for the respective fields; selecting particular tuples existing in the rule set from the tuple list; filtering each of the selected tuples by using the Bloom filter; and searching for a best matching rule as a search pool exclusively within the tuples with the positive result of the filtering. According to the present disclosure, the object tuples to search can be substantially relieved to improve the searching performance.

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

Abstract: Method and system for a first network device and a second network device is provided. The first network device and the second network device communicate with each other via a plurality of network links. A network packet field for applying a hashing technique for selecting one of the network links to transmit the network packet is negotiated between the first network device and the second network device. The hashing technique is identified for selecting the selected network link. The first network device and the second network device, prior to applying the hashing technique exchange hashing parameters.

Abstract: A network comprising a switch configured to learn a source address (SA) for a source node with a source port that receives a frame comprising the SA if the SA is not previously learned on another port and to subsequently forward any frame comprising a destination address (DA) for a destination node that matches the learned SA on the source port associated with the SA. A network comprising a switch configured to flood a frame received on a receiving port if the frame comprises a DA that is not previously learned on a source port and to distinguish the flooded frame from other forwarded frames by labeling the flooded frame, wherein the frame is flooded on a plurality of ports. A method comprising disabling a plurality of filtering database (FDB) entries that correspond to a plurality of addresses that are associated with a port, and sending the addresses in a control frame.

Abstract: Embodiments described herein achieve even traffic load-balancing among physical ports in a port channel with 2N ports of a networking switch. Embodiments may derive an upper limit of hash values given all the possible number of ports within a port channel. Based on the determined upper limit of hash values, embodiments provide the steps to evenly distribute hash values among ports in a port channel when adding or deleting a port to achieve even traffic load-balancing among ports in a port channel all the time.

Abstract: In one embodiment, ports of a network device are assigned to virtual service domains (VSDs). The ports are coupled to a virtual Ethernet module (VEM) of the network device. Each VSD is associated with one or more virtual service engines (VSEs) in a particular order. Each VSE is configured to apply a particular service to traffic traversing the VSE. Traffic received at a virtual Ethernet module (VEM) of the network device that is destined for a particular VSD, and is received on a port that has not been assigned to the particular VSD, is forwarded to the particular VSD via the one or more VSEs associated with the particular VSD such that the traffic traverses the one or more VSEs in the particular order.

Abstract: A transmission information transfer apparatus includes: an FDB that manages IP addresses in association with a plurality of respective input/output sections; an IP packet recognition section that determines whether input transmission information includes an IP address indicating the destination of the input transmission information; an FDB reference section and output port determination section that determine, in the case where the input transmission information includes an IP address, whether the IP address included in the input transmission information and predetermined IP address associated with any one of the plurality of input/output sections different from an input/output section coincides with one another; and an output port determination section that sets, in the case where it has been determined that the IP address included in the input transmission information as the destination of the input transmission information and the predetermined IP address coincides with one another, any one of the pluralit

Abstract: A device may receive a data unit at a line interface of a network device, convey the data unit to a first component in the line interface, update a flow table in the first component based on the data unit, send a message to a second component in the network device, the message describing the update to the flow table, and forward the data unit from the first component to another line interface in the network device.

Abstract: A system for improving the reliability of transmission of multibroadcast data between a source of data and a plurality of customer receivers of the data via a telecommunications network. The system includes a supervision server adapted to provide each customer receiver with a list of at least one other receiver, said customer receiver being adapted to receive missing data from said the other customer receiver via a reliable peer-to-peer connection.

Abstract: A communication control device includes a plurality of receive buffers each storing therein received information that corresponds to all or a part of a received message or an argument of a receive function, a hash-value generating unit that generates a hash value from a receive key contained in the received message in accordance with a hash-value generation rule, a storing unit that stores the received information in a selected one of the receive buffers corresponding to the hash value, and an output unit that outputs the received information from one of the receive buffers corresponding to the hash value in response to a transmission request from a receiving unit that performs a receiving operation by determining a matching based on a receive key specified by the receive function.

Abstract: A network device including a port, a packet classifier, and a processor. The port is configured to communicate with a network. The packet classifier is configured to select a plurality of packets according to a packet classification rule. The packet classification rule describes a packet characteristic. The processor is configured to execute a program. The program is configured to perform comparisons between (i) a portion of each of the selected packets and (ii) one or more predetermined patterns. One of the predetermined patterns is added to the program without having to reboot the network device.

Abstract: A mechanism is provided for security screening image analysis simplification through object pattern identification. Popular consumer electronics and other items are scanned in a control system, which creates an electronic signature for each known object. The system may reduce the signature to a hash value and place each signature for each known object in a “known good” storage set. For example, popular mobile phones, laptop computers, digital cameras, and the like may be scanned for the known good signature database. At the time of scan, such as at an airport, objects in a bag may be rotated to a common axis alignment and transformed to the same signature or hash value to match against the known good signature database. If an item matches, the scanning system marks it as a known safe object.

Abstract: The present disclosure provides IP address lookup method and apparatus. In one embodiment of the disclosure, an IP address lookup apparatus stores node information generated for a binary search-on-levels architecture in a universal multi-hashing table prior to searching with an advance filtering by a universal Bloom filter minimizing the number of accesses to the universal multi-hashing table before executing the IP address lookup.

Abstract: A system and method for receiving, from one or more ingress routers, a first set of records including data corresponding to network traffic, receiving, from one or more egress routers, a second set of records including data corresponding to network traffic and creating a multicast traffic matrix using at least a portion of the data included in the first and second sets of records.

Abstract: A packet inspection device and method for use with a packet-retrievable network apparatus are provided. The packet inspection method includes: converting header information of a packet received into a hashing function value in presence of handshaking underway at the Transmission Control Protocol (TCP) layer and comparing the hashing function value by a hashing function unit of the pending processing module, storing the hashing function value in a memory unit, and performing packet state comparison and packet screening and then creating by the session processing module a transmission connection according to the packet screened and selected by the pending processing module upon determination that data stored in the memory unit match the hashing function value resulting from conversion by the hashing function unit, thereby expediting packet inspection, reducing occupied memory space, and cutting costs.

Abstract: A technology is disclosed for providing a connection status notifying method and the like that can infer that a new connection will become usable shortly based on a predetermined action, and give notification thereof. The technology includes a step at which a mobile node 1000 receives information stating that connection will be broken from a base station that is a current connection destination, a step at which the mobile node starts a predetermined process with a base station that is a new connection destination, and a step at which the mobile node generates a predetermined notification message and transmits the generated predetermined notification message when the predetermined process is judged to be completed, the predetermined notification message being used to give notification to a predetermined component part within the mobile node or to another communication node that a connected state is established with the base station of the new connection destination at an early stage.

Abstract: A redundant communication system includes a first control device which calculates a control command value of an electric power device, and outputs first and second command signals; a second control device which controls the electric power device on the basis of one of the first and second control command values; and primary and secondary communication lines for respectively transmitting the first and second command signals to the second control device. The second control device comprises: a primary communication line abnormality determining unit which determines that the primary communication line is abnormal when a non-reception state or an abnormality state of the first command signal continues during a predetermined period; and a control command value switching unit which selects one of the first and second control command values in a switching manner and switches the selection from the first to the second control command value within the predetermined period.

Abstract: Systems and methods are described that manage routing information in an IP network using extensible indexing and use the indexing to control the network. The indexing and associated controls apply to any router within the routing domain.

Abstract: A method and system are provided for automatically rerouting logical circuit data from a physical circuit failure in a data network. When a failure in a logical circuit is detected, a label or services name associated with the logical circuit is automatically associated with a logical circuit identifier utilized for identifying the logical circuit in the 10 data network. Once the logical circuit is associated with the logical circuit identifier, the logical circuit data may be automatically rerouted to a “failover network,” thereby minimizing lost data until the failure in the logical circuit is resolved. The logical failover circuit may be an already existing logical circuit provisioned over a dedicated backup physical circuit in the data network.

Abstract: A method and system are provided for tracking the rerouting of logical circuit data in a data network. A disclosed example method involves updating reroute information in response to a dropped packet associated with a quality of service parameter having been exceeded. Transmitted data is rerouted to at least one logical failover circuit in the data network from at least one failed logical circuit associated with the exceeded quality of service parameter. The at least one logical failover circuit is selected based on a bit rate capability specified to be one of a committed bit rate, a variable bit rate, or an unspecified bit rate.

Abstract: In a communication network, links in a transmission path between source and destination terminals are sequentially switched to an operational state in response to a command or a group of commands for transmitting data prior to completion of assembling the data. Each node in the transmission path independently monitors transmission of data. After transmitting the data, the links are selectively switched to pre-determined power saving states.

Abstract: The present invention provides a network relay apparatus capable of assuring the prevention of occurrence of order reversion of packets within flows and shifting a packet distribution destination according to load information. The network relay apparatus includes: a packet distribution processor for distributing input packets to thereby achieve load dispersion of packet processing; a statistical information collector for regularly collecting load conditions of respective packet processors; and a distribution information holder for retaining information for specifying the packet distribution destinations upon distribution of the packets. Information about the load conditions of the respective packet processors are compiled and distributed to the packet processor smallest in load. Timing provided to change the packet distribution destination is assumed to be given when a processing waiting queue does not include a packet corresponding to its flow.

Abstract: A method for defining lists of neighboring cells of a cellular radiocommunications network, includes: obtaining a description of mobility paths followed by users of mobile communications terminals in a geographic area of interest; and including a first cell in the list of neighboring cells of a second cell in case, based on the mobility paths' description, to ascertain that there is a mobility path joining the first and the second cells.

Abstract: Internet Protocol address prefixes are hashed into hash tables allocated memory blocks on demand after collisions occur for both a first hash and a single rehash. The number of memory blocks allocated to each hash table is limited, with additional prefixes handled by an overflow content addressable memory. Each hash table contains only prefixes of a particular length, with different hash tables containing prefixes of different lengths. Only a subset of possible prefix lengths are accommodated by the hash tables, with a remainder of prefixes handled by the content addressable memory or a similar alternate address lookup facility.

Abstract: A method of transmitting data between a plurality of inter-connected elements. The method comprises receiving a message from a first element, said message comprising a routing key plus optionally a data payload. The routing key is processed to identify a plurality of said inter-connected elements, and data is transmitted to said identified plurality of inter-connected elements.

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

Abstract: In one embodiment, layer-2 (L2) ports of a network device may each be assigned to a particular virtual service domain (VSD). One or more virtual service engines (VSEs) may also be assigned in a particular order to each VSD, where each VSE is configured to apply a particular service to traffic traversing the VSE between ingress and egress service ports. Interconnecting the L2 ports and the ingress and egress service ports is an illustrative virtual Ethernet module (VEM), which directs traffic it receives according to rules as follows: a) into a destination VSD via the one or more correspondingly assigned VSEs in the particular order; b) out of a current VSD via the one or more correspondingly assigned VSEs in a reverse order from the particular order; or c) within a current VSD without redirection through a VSE.

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

Abstract: A system including first and second virtualized execution environments and a hypervisor for sending packets between virtualized execution environments. The first virtualized execution environment includes a first VNIC associated with a first hardware address (HA), a first proxy VNIC associated with a second HA, and a virtual switch. A Vswitch table for the virtual switch includes entries associating the first HA with the first VNIC and the second HA with the first proxy VNIC. The second virtualized execution environment includes a second proxy VNIC associated with the first HA. The virtual switch receives a first packet associated with the second HA. The virtual switch sends the first packet to the first proxy VNIC when Vswitch table entry associates the second HA with the first proxy VNIC. The first VNIC proxy sends the first packet from the first virtualized execution environment to the second virtualized execution environment using the hypervisor.

Abstract: In one embodiment, a method for telecommunications includes steps of receiving a first packet through a first port, and determining whether the first packet arrived over a protected path. If the first packet arrived over a protected path, the method also includes the steps of hashing a source address of the first packet, adding a first entry into a forwarding table, and adding a second entry into the forwarding table. The protected path is coupled to at least the first port and a second port. The first entry includes the result of hashing the packet, and an identification of the first port. The second entry includes the result of hashing the packet, and an identification of the second port.

Abstract: An information packet preclassification system and method are provided. The method receives a packet of information and differentiates the packet into segments. Using a decision tree with multiple levels, segments in the packet are compared to a node at a tree level, where each node includes a plurality of node reference segments and corresponding node comparison operators. The reference segment may be a different segment from the packet, or a predetermined segment value stored in memory. One, or more classification attributes are accessed in response to comparing segments, and the classification attributes are assigned to the packet. Then, the packet is processed in response to the classification attributes.

Abstract: A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees.

Abstract: A method and system for load balancing the distribution of a file or block of data to multiple recipients on a peer to peer network is disclosed.

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: A system, method, and router for routing data packets in an overlay network built over heterogeneous layer-3 domains. A link state overlay routing protocol enables an overlay router to route data packets based on flat identifiers and decides the best path to a destination taking into account a number of parameters such as round trip time. Scalability is provided by making routing decisions based on a network identifier rather than a single end-node identifier.

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

Abstract: Locations for deploying mesh nodes in a wireless network are determined based on a Terminal Steiner tree (TST). The TST that is formulated from an input graph and client locations in the wireless network is determined. The input graph includes signal strength values for pairs of mesh node-to-client location and mesh node-to-mesh node links and mesh node locations for deploying the mesh nodes are selected from the Steiner nodes in the TST.

Abstract: A radio system is installed in a building, wherein each terminal (T) communicates with neighboring terminals and can transmit telegrams. The terminals (T) are contained in devices or installed as separate mobile terminals. A routing table is created, in which each acceptable route from a source (Q) to a destination (Z) is entered. Connection from source to destination is evaluated with consideration of the number of hops from terminal to terminal within a route, and of the availability of unique individual sections (SES) that cannot be replaced by a parallel path.