Abstract: Described are a Border Gateway Protocol (BGP) network device and method for distributing routing information to a plurality of BGP peers over a network. The BGP network device dynamically calculates a number of groups and a number of BGP peers in each group based on routing information to be distributed. A time interval is specified within which to generate an update message for each BGP peer in a select one of the groups. An update message is generated for each BGP peer in the select group during the time interval. Routes included in the update message for each BGP peer are based on an outbound routing policy for that BGP peer. The update messages are forwarded for transmission to the BGP peers in the select group after the time interval expires.

Abstract: Disclosed is a display device using a demultiplexer. The demultiplexer sequentially samples the data current that is time-divided and applied by a data driver, and holds it to the data lines. Since the demultiplexer is to sample the data currents corresponding to N data lines during one horizontal period when performing 1:N demultiplexing, the data current corresponding to one data line is sampled during the 1/N horizontal period. In the present invention, a signal line coupled between the demultiplexer and the data driver is precharged with the current before coupling a precharge circuit to a sample/hold circuit and sampling the data current. The precharge current is M times the data current where M is a real number greater than 1.

Abstract: A computer system to efficiently process packets received over a network operating in accordance with a layered protocol. The system includes logic that provides combined processing to determine whether a received packet complies with multiple requirements of the layered protocol. Combined processing determines compliance with requirements at more than one of the protocol layers of the layered protocol. If the combined processing does not verify compliance with all of the requirements of a protocol layer, those requirements may be verified in a layered fashion following the combined processing. In this way, greater efficiencies may be achieved through the combined processing of requirements from multiple protocol layers, but advantages of implementing a layered protocol in a modular fashion may still be retained.

Abstract: A method and apparatus for performing a constrained shortest path first (CSPF) computation is described. In one embodiment of the invention, the network element receives a request with one or more exclusion constraints or a path re-optimization request. The network element marks one or more attribute bits in a traffic engineering data structure based on the request. If an exclusion bit is set for a link, that link is skipped during CSPF computation. If a re-optimization bit is set for a link, the allocated bandwidth of the link is added to the advertised bandwidth of the link to form a re-optimization comparison value, which is used for a bandwidth comparison during path re-optimization.

Abstract: A method may include receiving a data unit and identifying a state of a memory storing data units. The method may include selecting a threshold value having a first threshold unit or a second threshold unit based on the state of the memory. The method may include comparing the threshold value to a queue state using the first threshold unit if the memory is in a first state. The method may include comparing the threshold value to the queue state using the second threshold unit if the memory is in a second state.

Abstract: A method, apparatus and system for communicating in a wireless mesh network may relate to a mesh point observing beacon transmissions of one or more neighboring mesh points and dynamically determining if and when to transmit its own beacon based on these observations. Determining when to transmit the beacon may be performed without time synchronization between the one or more neighboring mesh points and be dynamically selected based on the observed transmission time pattern of the neighboring mesh points. Various additional details and embodiments are also disclosed.

Abstract: The present invention provides methods for identifying high traffic origin-destination node pairs in a packet based network and for estimating the mean traffic between the high traffic origin-destination node pairs. High traffic origin-destination node pairs may be identified in accordance with the present invention by modeling the variance of traffic in a static routing environment and identifying the origin-destination node pairs with a high variance as high traffic origin-destination node pairs. For estimating purposes, traffic between low traffic origin-destination node pairs may be assumed to be a predetermined value, such as zero, to reduce the number of variables to estimate. Routing changes necessary to create a full rank routing matrix may be identified and applied to the network, and link utilization information collected under each routing scenario may be used to estimate the mean traffic between the high traffic origin-destination node pairs.

Abstract: A high-speed interface for implementation in a programmable device such as, e.g., a programmable logic device (“PLD”) is described. Multi-gigabit transceivers of the PLD provide transmit and receive lock signals and have inputs for reference transmit and receive clock signals. One of the multi-gigabit transceivers provides a first transmit clock signal, a first receive clock signal, and a second receive clock signal. A data rate converter fractionally multiplies a second transmit clock signal to provide the reference transmit clock signal. A skew synchronization block obtains respective transmit and receive lock signals from the multi-gigabit transceivers and provides respective receive and transmit synch adjustment signals to the multi-gigabit transceivers. Synchronous operation of the multi-gigabit transceivers in receive and transmit directions is adjusted with receive and transmit synch adjustment signals to maintain lane-to-lane skew for the high-speed interface within a target range.

Abstract: A transmitting device includes a first buffer for temporarily storing audio data, a second buffer for temporarily storing video data, a multiplexing unit for outputting audio data coming from the first buffer and video data coming from the second buffer onto a single signal channel, and a transmission buffer monitoring unit for monitoring the amount of first buffered data stored in the first buffer and, if the amount of the first buffered data exceeds a first threshold, instructing the second buffer to discard video data.

Abstract: A method of transmitting data from a sender to a number of recipients in a system with a multilayer protocol architecture, in which the data are divided for organizational purposes into data packets having header data and payload data, a transmitting and/or receiving unit and a communication system. The transmission of data in the form of a point-to-multipoint transmission over a general channel, in particular in a mobile radio system, is carried out by adding to packet data which are being sent to multicast groups control data for the identification of a specific multicast group.

Abstract: Methods and apparatuses for generating an OVSF code are disclosed. A proposed method for generating a current code chip of an OVSF code includes: determining a correlation factor between the current code chip and a preceding code chip of the OVSF code; and generating the current code chip according to the preceding code chip and the correlation factor.

Abstract: The present disclosure provides a system and method for detecting faults related to lines linked to provide network services. The method includes storing a synthetic value for the performance of a line, receiving a measured value of a performance parameter of the line measured at a customer end and comparing the synthetic value with the measured value to determine if a fault condition exists.

Abstract: A computer-readable storage element has code stored thereon that programs a processing device within a communication device to implement a method. The method includes: receiving a plurality of bursts and detecting a failure to receive a preceding header burst; extracting embedded data from the plurality of bursts; determining from the embedded data whether the plurality of bursts comprises valid voice bursts; and when the plurality of bursts comprises valid voice bursts, generating at least one header burst using the embedded data, and transmitting the at least one header burst and the voice bursts.

Abstract: An HDLC accelerator includes a deframer and framer to respectively accelerate the deframing and framing processes for PPP packets. The deframer includes an input interface unit, a detection unit, a conversion unit, and an output interface unit. The input interface unit receives a packet of data to be deframed. The detection unit evaluates each data byte to detect for special bytes (e.g., flag, escape, and invalid bytes). The conversion unit deframes the received data by removing flag and escape bytes, “un-escaping” the data byte following each escape byte, providing a header word for each flag byte, and checking each deframed packet based on a frame check sequence (FCS) value associated with the packet. The output interface unit provides deframed data and may further perform byte alignment in providing the deframed data. A state control unit provides control signals indicative of specific tasks to be performed for deframing.

Abstract: A multiplexer according to an embodiment of the present invention multiplexes a video ES and an audio ES to generate a transport stream TS, and includes a video buffer, an audio buffer, and a multiplexing unit. A multiplexing unit executes simulation of a buffer occupation necessary for a video ES upon decoding the TS, and controls multiplexing of the video ES not to cause overflow of a buffer based on the simulation result. In the simulation, a predetermined time ?t is divided by N ((main buffer leak rate/system clock frequency)×N (N is an integer)=integer), the remainder R is carried over to the next calculation, and a current main buffer leak data amount is calculated by integer arithmetic based on the integral quotient.

Abstract: Methods and apparatus for reducing the average delay associated with sending a packet from one environment to another via a store and forward buffer are disclosed. According to one aspect of the present invention, a method for processing transmission units received over a first network connection includes receiving a first transmission unit on the first network connection, storing the first transmission unit in a buffer, and determining when contents of the buffer meet a plurality of criteria. The method also includes sending a backpressure over the first network connection when it is determined that the contents of the buffer meet the plurality of criteria. In one embodiment, determining when the contents of the buffer meet a plurality of criteria includes determining when the contents of the buffer are of an amount that exceeds a threshold and determining when the contents of the buffer include at least one full packet.

Abstract: In some embodiments of the present invention, asynchronous network nodes and synchronous network nodes coexist on a shared media network.

Abstract: The synchronization of trunk failover between two FC-AL switches when a primary trunk failure occurs is disclosed. If primary trunk T1 should fail, S1 bypasses the cascade port and sends a MaRK (MRK) ordered set out over duplicate trunk T2 to switch S2. In response, S2 sends an acknowledgement MRK ordered set over T2 back to S1. S1 then reconfigures the switch to establish T2 as the primary trunk, and acts as a masters in the failover process and initiates LIP ordered sets which are communicated to all devices in the system to initialize them. Note that when S2 receives the MRK ordered set and acknowledges it by sending an acknowledgement MRK back to S1, it acts as a slave in the failover process and does not attempt to initiate LIPs, thereby eliminating the possibility of multiple Loop Initialization cycles and reducing the time in which data cannot be transmitted.

Abstract: A network device includes a memory and a packet forwarding engine. The memory stores a multicast list table, tag descriptor data and layer 2 (L2) encapsulation data. The packet forwarding engine receives a first pointer to an entry in the multicast list table, the entry including a second pointer to the tag descriptor data. The packet forwarding engine utilizes the second pointer to retrieve the tag descriptor data, the tag descriptor data including a third pointer to the encapsulation data. The packet forwarding engine constructs a packet header utilizing the retrieved encapsulation data and appends the packet header to a packet payload for forwarding out of the packet forwarding engine.

Abstract: A telecommunications system that supports the provision of video messaging to certain user devices, based on the calling line identifier or ANI associated with the user devices. Based on the CLID or the ANI, as well as user selected options, network configurations and status, and class-of-service characteristics, the telecommunications systems can revise the manner in which content is provided to the user equipment. Variations in the content provision include providing synchronized audio and video content, audio content only, video content only, video content with closed-captioning and closed-captioning only.