Abstract: One embodiment is directed to transmitting encoded data over a broadcast medium to improve network throughput. A sending node may identify a first packet to be transmitted to a first network node and a second packet to be transmitted to a second network node. The sending node may determine whether the first network node stores the second packet and whether the second network node stores the first packet. If the sending node determines that the first network node stores the second packet and the second network node stores the first packet, it may code together the first and second packets to generate an encoded packet and may transmit the encoded packet over the broadcast medium. Thus, the first packet may be transmitted to the first network node and the second packet may be transmitted to the second node in a single transmission.

Abstract: Hosts or end-systems residing at the edges of a network gather data about the traffic they transmit into and receive from the network. The network's routing protocol (typically a link-state protocol such as OSPF) is monitored and routing data or packets are used to recover the network's current status and topology. This data can be collected, fused, and maintained and a platform, preferably distributed, can be provided to query the data, thus enabling a variety of network management applications.

Abstract: Provided is a method for retransmitting data based on antenna scheduling in a MIMO system to which a spatial multiplexing technique is applied. The method includes the steps of: (a) at a transmitter side, modulating an input packet into transmittable data to transmit to a receiver side; (b) at the receiver side, estimating channel values from the packet transmitted from the transmitter side, and selecting transmitting and receiving antennas for transmitting the next packet from the estimated channel values; (c) detecting whether an error is present in the packet or not, and transmitting a feedback signal to the transmitter side, the feedback signal including information on whether or not to transmit the packet and a list of the selected transmitting antennas; and (d) at the transmitter side, retransmitting the transmitted packet or transmitting the next packet through the transmitting antennas designated by the receiver side depending on the feedback signal.

Abstract: A switch matrix for selectively connecting at least one of N signal inputs to at least one of M signal outputs, N and M being integers greater than two, includes a cluster of N input switches arranged about each of the M signal outputs resulting in at least M clusters of N input switches, each input switch having a switch input and a switch output, the switch outputs being connected to respective signal outputs, the clusters and the input switches in the clusters being arranged to permit adjacent switch inputs of adjacent clusters to be connected to form input switch nodes; and a steering switch for each of the signal inputs. The steering switch selectably connects a signal input to an input switch node, wherein the combination of the steering switches and the input switches are operable to connect a desired signal input to a desired signal output.

Abstract: A signal processing method in a bridge-based RAS backbone network system is provided, in which an MN within a network periodically transmits to an HLR a route-update message for registration updating, if the MN is in active mode and transmits to the HLR a paging-update message having a transmission period longer than that transmission period of the route-update message, for registration updating, if the MN is in idle mode, each of bridges and the HLR stores location information about the MN in a soft state with an age set for the location information in a routing cache according to the route-update message received from the MN, and each of BSBs, SCBs, and an SIB selected from a plurality of SIBs stores location information about the MN in a soft state with an age set for the location information according to the paging-update message received from the MN.

Abstract: A packet switch includes individual route tables for ports of the packet switch. Each route table is associated with a port and individually maps a destination identifier of a data packet received at the port to another port in the packet switch. In some embodiments, the packet switch routes a data packet to an intermediate device based on a destination identifier in the data packet. The intermediate device services the data packet and sends the data packet, which includes the same destination identifier, back to the packet switch. In turn, the packet switch routes the data packet to a destination device based on the destination identifier in the data packet. The destination device terminates the data packet and may further service the data packet. In this way, the packet switch routes the data packet to both the intermediate device and the destination device based on the same destination identifier.

Abstract: A multi-chassis router allows an administrator to deliver commands from a single interface. Additionally, the multi-chassis router presents a software image consistent with that of a standalone router and uses commands and configurations consistent with those used by a standalone router. The multi-chassis router automatically distributes, processes and responds to administrator commands a single unit, minimizing time required to administer the multi-chassis router. In effect, an administrator does not need to account for the multiple chassis configuration, and an administrator familiar with the control and commands for a standalone router can use that knowledge to effectively control the operation of the multi-chassis router.

Abstract: A method and system for profile-marking and scheduling of packets are disclosed. Using a dual-rate scheduler, the profile state of a packet being scheduled for transmission by a flow traffic descriptor is determined based on the traffic rate of the flow traffic descriptor, which is associated with the queue that the packet belongs to. The profile state of the packet is marked prior to the transmission of the packet.

Abstract: A method includes receiving a Real-Time Transport Protocol (RTP) packet at a first gateway and translating the RTP packet into a H.221 frame. The H.221 frame includes a H.263-compressed video bitstream. The H.221 frame may also include a H.221 Bit-Rate Allocation Signal (BAS) message to communicate RFC2190-compliant fragmentation boundary information containing Macroblock (MB) boundary to a second gateway, if there is no picture start code (PSC) or Group of Block start code (GBSC) at a start portion of the RTP packet. The method further includes transmitting the H.221 frame from the first gateway to the second gateway; and fragmenting the H.263 video bitstream contained in the H.221 frame at a PSC, a GBSC, or a Macroblock (MB) boundary contained in the H.221 BAS fragmentation message.

Abstract: An apparatus and method for receiving data in a communication system are provided. The method includes identifying first codewords, which have been used in transmission of data by a transmitter, in the data received from the transmitter, setting third codewords by adding second codewords to the identified first codewords, calculating correlation values of orthogonal vectors corresponding to the third codewords and detecting information included in the data based on the calculated correlation values. Accordingly, feedback information may be better received and detected.

Abstract: A wireless communication system is disclosed, including a network; and a plurality of base transceiver stations (BTS) coupled to the network, wherein at least one of the base transceiver station (BTS) is adapted to receive a request to communicate with a mobile communication unit (MU) from the network; determine whether to establish a dedicated voice channel or a dedicated packet data channel with the mobile communication unit (MU) on the basis of the request: and if the dedicated voice channel is established, receive voice information from the network and send the voice information to the mobile communication unit (MU) by way of the dedicated voice channel; or if the packet data channel is established, receive packet data from the network, encode the packet data for joint detection, and send the encoded packet data to the mobile communication unit (MU) by way of the dedicated packet data channel.

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 packet classifier and a method for routing a data packet are provided. The packet classifier includes a content addressable memory, a translation table and a parameter memory. The method includes looking up a content addressable memory for a base address into a parameter memory using a header of the data packet. The base address is related to the routes under ECMP for forwarding the data packet. From among these addresses, using multiple headers of the data packet, an adjustment to the base address is computed. The adjustment specifies an actual address to the parameter memory corresponding to a selected route for forwarding the data packet. The parameter memory is then accessed using the actual address to obtain parameter values relevant to the selected route. The data packet is then forwarded according to the parameter values thus obtained.

Abstract: A content matching engine (CME) uses a content addressable memory (CAM) array that stores a plurality of strings in separate entries. The strings define one or more rules to be matched. The strings of each rule are linked, thereby providing a required order. The strings of each rule can be linked by per-entry counters associated with each string, or by a state machine. The strings in the CAM array are compared with a packet, which is shifted one symbol at a time (because the strings can start on any boundary). When the CAM detects a match, the CAM skips over the string that resulted in the match, thereby preventing erroneous matches. The CAM allows parallel matching to be performed for multiple rules. If the contents of a packet match all of the strings of a rule, in order, then the CME asserts a match/index signal that identifies the matched rule.

Abstract: Methods and systems are provided for provisioning and managing network-based virtual private networks (VPNs). According to one embodiment, virtual routers (VRs) distributed among service processing switches are provisioned by a service management system (SMS) to support network-based customer virtual private networks (VPNs) by generating a routing configuration based on (i) site reachability information for the service processing switches and (ii) a global customer routing profile for at least one customer. A custom routing profile is received by the SMS from a customer network management system (CNMS), the custom routing profile identifies one or more routing protocols to be used for one or more segments of a network-based customer VPN. The network-based customer VPN is reconfigured by the SMS generating appropriate routing configurations for VRs partitioned to the customer based on a subset of the site reachability information associated with sites of the customer and the custom routing profile.

Abstract: Streaming data is processed through one or more pipes of connected modules including mixers and/or splitters. The data is carried in composite physically allocated frames having virtual subframes associated with different ones of the splitters, mixers, and other transform modules. Nesting trees and pipe control tables represent the structure of the pipes. A frame allocator is assigned to a particular module in a pipe. Rather than issuing a control transaction to all modules when any one of them completes an operation upon its source data, a control manager requests a module to begin its operation only when all of its input subframes have become available. Frame control tables record when any module has completed an operation, and a pipe control table lists which modules provide data to which other modules.

Abstract: A packet communication apparatus comprising a node management processor for controlling the whole apparatus, network interfaces for transmitting and receiving packets to and from external networks, function enhancement modules for performing predetermined processes on the packets, and a switch for transferring the packets within the apparatus. The network interface includes a CPU and a memory, the memory stores a program executed by the CPU, the CPU processes the packet received from the external networks by executing the program, and the function enhancement module stores the program stored in the memory.

Abstract: A method for automatically discovering a bus system in a multipoint transport network (MTN) is described, which MTN is a two-dimensional arrangement of a plurality of nodes, wherein each node potentially can be logically connected with a plurality of adjacent nodes via a potential link connection. The method includes the steps of placing a first test signal in the GPF layer overhead by the GPF termination functions in order to first gain a relation between all GFP termination functions and the corresponding termination points; deriving the relations between all connection points of the MTN bus by using local knowledge about the status of the GFP adaptation functions, which needs a communication between all nodes of the MTN bus concerning the status of the GFP adaptation functions; and employing an adapted link management protocol (LMP) between all connection points of the MTN bus.

Abstract: A logical quality-of-service management method for peer-to-peer networks uses a special group service for QoS management within peer-groups. This group service determines and assigns a budget per time unit for each peer. Such time unit may be in the range of milliseconds or few seconds. It may also determine a group budget for the peer-group. While a peer uses bandwidth, i.e. while it sends or receives data, its budget is decreased. When a peer has exhausted its budget, it has to lower its priority for transferring or receiving data. Each peer is responsible for keeping its own budget. If a peer does not keep the conditions, other peers may have the right to deny the data transfer from that peer. The QoS service function is advertised in peer-group advertisement messages.

Abstract: Embodiments of the present invention provide a method and a node for discovering topology structure automatically in a Multi Protocol Label Switching (MPLS) ring network. The method includes: when receiving a topology discovering message, determining, by a node in the MPLS ring network, whether the topology discovering message is sent by the node; if yes, updating information of topology structure of the MPLS ring network stored in the node according to information of topology structure of the MPLS ring network carried by the topology discovering message; otherwise, appending information of topology structure of the node to the topology discovering message and forwarding the topology discovering message to a next node. Thus, the network topology may not depend on the topology of the physical layer network and the speed of discovering topology structure of the ring network is increased.