Abstract: Discard precedence priority of packets carrying an encoded video stream in a packet network is determined based on priority information included in the encoded video stream. A video streamer segments an encoded video stream and encapsulates the segment in an Internet Protocol (IP) packet. Priority information associated with the IP packet is determined based on at least one priority indicator associated with the segment that was included in the encoded video stream. Alternately, priority information associated with an Ethernet frame is determined based on at least one priority indicator associated with the segment that was included in the encoded video stream.

Abstract: Discard precedence priority of packets carrying an encoded video stream in a packet network is determined based on priority information included in the encoded video stream. A video streamer segments an encoded video stream and encapsulates the segment in an Internet Protocol (IP) packet. Priority information associated with the IP packet is determined based on at least one priority indicator associated with the segment that was included in the encoded video stream. Alternately, priority information associated with an Ethernet frame is determined based on at least one priority indicator associated with the segment that was included in the encoded video stream.

Abstract: A generalized virtual router is disclosed. A routing and switching apparatus includes a switching fabric and a matrix of switching and routing elements. At least some of the elements are interconnected by the switching fabric. A router control provides control for the switching fabric. The apparatus has both cross-connect and routing functionality.

Abstract: A network resource is allocated to a data path by determining if a sufficient amount of the network resource is available in a network path to accommodate the data path, and obtaining a cost associated with using the network resource available in the network path for the data path. It is decided whether to allocate the network resource in the network path to the data path based on the amount of the network resource and the cost associated with using the network resource. One representative example of the data path is a label switched path (LSP) on a multiprotocol label switching (MPLS) network.

Abstract: A method and apparatus for scheduling the transfer of data bursts in a network comprising electronic edge nodes interconnected by bufferless core nodes are disclosed. Each edge node comprises a source node and a sink node, and each core node comprises several bufferless space switches operated in parallel. Each source node is connected to at least one core node by an upstream link that includes multiple upstream channels. Each core node is connected to at least one sink node by a downstream link that includes multiple downstream channels. Any of the space switches can have either an electronic fabric or a photonic fabric. Each space switch has a master controller, and one of the master controllers in a core node is designed to function as a core-node controller in addition to its function as a master controller. Each master controller has a burst scheduler operable to compute a schedule for the transfer of data bursts, received from source nodes, to destination sink nodes.

Abstract: A method and apparatus are provided for low latency loss-free burst switching. Burst schedules are initiated by controllers of bufferless core nodes and distributed to respective edge nodes. In a composite-star network, the burst schedules are initiated by any of a plurality of bufferless core nodes and distributed to respective edge nodes. Burst formation takes place at source nodes and a burst size is determined according to an allocated bitrate of a burst stream to which the burst belongs. An allocated bitrate of a burst stream may be modified according to observed usage of scheduled bursts of a burst stream. A method of control-burst exchange between each of a plurality of edge nodes and each of a plurality of bufferless core nodes enables burst scheduling, time coordination, and loss-free burst switching. Both the payload bursts and control bursts are carried by optical channels connecting the edge nodes and the core nodes.

Abstract: In a router, externally received messages addressed to an active line card are bridged to a protection line card. Each line card in the router is programmed to respond to such externally received messages by directing them to the protection line card associated with the active line card as well as to the active line card. The protection line card is configured with inbound and outbound path tables that are the clones of the inbound and outbound path tables of its corresponding active line card. Bridging is accomplished by revising descriptors stored in a plurality of line cards to indicate an association between an active one of the line cards and its protection line card. Received messages are addressed using the revised descriptors to the active line card and also to its protection line card. Upon failure of an active line card, its physical interface can be disabled once its protection line card has clones of the inbound and outbound path tables and bridging has been set up.

Abstract: A generalized virtual router is disclosed. A routing and switching apparatus includes a switching fabric and a matrix of switching and routing elements. At least some of the elements are interconnected by the switching fabric. A router control provides control for the switching fabric. The apparatus has both cross-connect and routing functionality.