Abstract: Network resources allocated for particular application traffic are aware of the characteristics of L4+ content to be transmitted. One embodiment of the invention realizes network resource allocation in terms of three intelligent modules, gateway, provisioning and classification. A gateway module exerts network control functions in response to application requests for network resources. The network control functions include traffic path setup, bandwidth allocation and so on. Characteristics of the content are also specified in the received application network resource requests. Under request of the gateway module, a provisioning module allocates network resources such as bandwidth in optical networks and edge devices as well. An optical network resource allocation leads to a provisioning optical route.

Abstract: A method of determining where to place routing constraints known as cuts in a network to result in a no-loop network, and a method of implementing such constraints in a hierarchical network; to avoid deadlocks. The method of determining where to place cuts in a network to result in a no-loop network comprises an algorithm for numbering the nodes within the network which is used to determine where the cuts are to be placed. The method of implementing constraints in a hierarchical network to result in a no-loop network comprises an algorithm for independently determining cuts and meta-cuts for each peer group, and imposing the necessary routing constraints in the network.

Abstract: A bridge operates in either VLAN aware mode or VLAN unaware mode as specified by a user. A packet is received in a priority tagged format containing an associated VLAN identifier. The packet is processed according to a VLAN aware mode by setting said VLAN identifier equal an identifier associated with the incoming port on which said packet is received An address table is searched using a destination address and the VLAN identifier to determine a destination port. The packet is sent to the determined destination port.

Abstract: A method and apparatus for partial graceful restart in Border Gateway Protocol (BGP) are disclosed. A first BGP host detects that a first BGP session established between the first BGP host and a second BGP host has become unavailable. In a Forwarding Information Base (FIB) at the first BGP host, a first set of one or more routes to one or more address destinations is replaced with a second set of one or more routes to the one or more address destinations. The first set of one or more routes indicates that the one or more address destinations are reachable through the second BGP host. The second set of one or more routes indicates that the one or more address destinations are reachable through a third BGP host. The first BGP host receives a BGP OPEN message from the second BGP host to open a new BGP session between the first BGP host and the second BGP host. In response to receiving the BGP OPEN message, the first set of one or more routes is re-installed in the FIB at the first BGP host.

Abstract: In accordance with an embodiment of the present invention, a customer premises equipment (CPE) apparatus includes a first communications unit, a second communications unit, and a processing unit. The first communications unit is configured to receive an inbound message packet from a first communications channel. The inbound packet includes a destination address. The second communications unit is configured to send an outbound message packet on a second communications channel. The processing unit is configured to generate the outbound packet from the inbound packet where the outbound packet is modified to include a CPE device identifier if the destination address matches a predetermined registration server address. In one embodiment, this enables automatic CPE identification during subscriber registration process.

Abstract: Scheduling virtual upstream channels within one physical upstream channel is disclosed. The MAP messages of the virtual upstream channels that share the same physical upstream channel are synchronized together such that any one transmission opportunity for a given virtual upstream channel does not overlap with transmission opportunities of any other virtual channel. This includes converting all requests for tranmission opprotunities into a common unit and then scheduling these requests as appropriate.

Abstract: An internally-integrated type computer network switching unit is proposed, which is designed for internally integrated to a computer platform, such as a server, for providing the server with a network switching capability that allows the server to selectively switch between various connections to a number of network nodes for the purpose of establishing a LAN (Local Area Network); and which is characterized by that it is internally integrated to the internal circuitry of the server so that it can be implemented without having to utilize a dedicated set of microprocessor, memory, and operating system (OS), and can be directly controlled via the CPU and OS of the server. This feature allows the internally-integrated type computer network switching unit of the invention to represent a more cost-effective and highly expandable LAN solution for network applications.

Abstract: A method and system for sending a multimedia stream in IP multicast networks are provided. IGMP report data is collected by a plurality of routers. The routers report the IGMP report data to a netflow collection server. The netflow collection server collates the IGMP report data. The collated IGMP report data is forwarded to an encoder coordinator. The encoder coordinator adaptively computes an encoding rate of the multimedia stream. The encoded multimedia stream is sent to a plurality of receivers at the encoding rate.

Abstract: Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, mechanisms, and means for maintaining and using a data structure identifying for multiple addresses the reverse path forwarding information for a common intermediate node. A data structure includes an address lookup data structure for identifying leaf nodes of multiple leaf nodes corresponding to matching addresses. Each of the multiple leaf nodes includes a reverse path forwarding indirection link to a corresponding sub-data structure indicating reverse path forwarding information. Each of a particular set of leaf nodes having a same intermediate reachability node in a network includes a particular indirection link to a same particular sub-data structure indicating reverse path forwarding information. The intermediate reachability node may or may not be a gateway node to a different intranet.

Abstract: A method and apparatus for frame-aware and pipelined hierarchical scheduling is described. In accordance with at least one embodiment of the invention, some or all schedulers of a communication node are associated with one or more storage devices that maintain values used by corresponding higher level schedulers to make scheduling decisions. Because of the nature of the scheduling decision flow and the potential to update registers in real-time, the scheduling arrangement can respond almost immediately to changes occurring at the input queues, which allows scheduling to be responsive to differing priorities of incoming cells. The nature of the scheduling decision flow also allows pipelined scheduling, in which scheduling of one or more additional cells can begin before scheduling of a first cell is completed.

Abstract: An apparatus defines interleave-processing segments to be interleaved in a backward direction relative to a flow direction of bit streams. The segments are defined every time the segments, ILVU-BR, -CR, -DR are successfully set for each of the respective bit streams, VOB-B-VOB-D. In setting the segments for each of the respective bit streams, the segment of one bit stream is set to follow the set segment of other bit stream. When an amount of data of the rest of the bit streams is insufficient to form the final segment, the rest data is distributed among the segments that have been already defined. The defined segments are arranged in the flow direction of the bit streams.

Abstract: Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.

Abstract: Providing packet forwarding to a connected customer computer that does not have a static Internet Protocol (IP) address. A service provider computer receives a packet for the connected customer computer. The service provider computer then determines a current IP address of the connected customer computer. A new packet containing the current IP address of the connected customer computer is then generated by the service provider computer. The service provider computer then transmits the new packet to the connected customer computer.

Abstract: Disclosed is a system and methods for accelerating network packet processing for devices configured to process network traffic at relatively high data rates. The system incorporates a hardware-accelerated packet processing module that handles in-sequence network packets and a software-based processing module that handles out-of-sequence and exception case network packets.

Abstract: A system and method are provided to prevent the formation of loops in a network. The network device includes a plurality of ports for receiving and forwarding network messages and a spanning tree protocol engine. The spanning tree protocol engine, in one embodiment, implements the Rapid Spanning Tree Protocol (RSTP) to transitions the ports among a plurality port states, including a discarding state, a learning state and a forwarding state. The network device further includes a loop guard engine that is in a communicating relationship with the spanning tree protocol engine and the ports. The loop guard engine monitors the receipt of bridge protocol data units (BPDUs) by the ports. If a given port stops receiving BPDUs, the loop guard engine prevents the spanning tree protocol engine from transitioning the given port to the forwarding state. Instead, the loop guard engine causes the port to transition to loop inconsistent state.

Abstract: A method for reducing signaling overhead in a multicarrier system with dynamic bit allocation per subcarrier and a corresponding transmitter/receiver device, are provided wherein an established bit allocation table (BAT) that is provided with an index (I) is stored in a BAT storage device (LUT). In order to reduce signaling overhead, only the corresponding index (I) of an existing bit allocation table is transmitted (S6).

Abstract: The invention, which applies to satellite digital communications systems in particular, relates to a device and a method of scheduling and sending data packets with a required level of protection from a common sender to a plurality of users sharing a common transmission channel. The method comprises the steps of: receiving a stream of input data packets; splitting the packets between a plurality of queues; extracting the leading packets therefrom using a first scheduling algorithm; storing each packet in a particular buffer as a function of the required level of protection; and extracting data blocks therefrom using a second scheduling algorithm. The packets are split between said queues in accordance with a geographical position criterion in respect of the user to whom each packet is addressed.

Abstract: Provided is a topology discovery method for an Ethernet network that can effectively discover a physical topology with respect to the Ethernet network of a mesh structure without developing and using a separate control protocol. The topology discovery method in an Ethernet network includes the steps of: acquiring an interface management information base (MIB) and a bridge MIB; defining and storing information for discovering a physical topology; discovering an edge bridge that divides a boundary between a bridge network and a host network; discovering the physical topology with respect to the bridge network by using the schema; discovering the connection relationship with the host network by using an address learning address forwarding table (AFT) with respect to the edge bridge included in the bridge network; and outputting the connection relationship of the bridge network and the host network as a graph.

Abstract: A method and system for interconnecting an Internet protocol version 4 (IPv4) network and an Internet protocol version 6 (IPv6) network are provided. The system for interconnecting an IPv4 network and an IPv6 network includes IPv4 nodes, IPv6 nodes, and apparatuses for transmitting IP packets between the IPv4 nodes and the IPv6 nodes, wherein the apparatuses for transmitting IP packets share processing state information of the IP packets, using a predetermined message, to distribute their load of processing the IP packets. The IPv4-IPv6 interconnection method involves appropriately arranging NAT-PT apparatuses depending on the size of the networks such that packet processing speed and performance are improved over the use of a single NAT-PT apparatus.

Abstract: A bridge node converts a MAC frame addressed to a station node into a RPR MAC frame and thus transmits it, and encapsulates a MAC frame addressed a station being located the outside of a ring and connected to other bridge node into the RPR MAC frame, and transmits it. The bridge node thereby receives a RPR MAC frame into which the MAC frame is encapsulated, and the station node receives the RPR MAC frame that the MAC frame is not encapsulated.