Abstract: An example apparatus is provided and may comprise a housing, an electronic blade system, and a plurality of airflow management components. The housing may have an upper chamber and a lower chamber. The electronic blade system may be located between the upper chamber and the lower chamber. The plurality of airflow management components may be configured to be removable and to manage airflow in the housing.

Abstract: In one embodiment, techniques are provided to generate a Border Gateway Protocol-Link State (BGP-LS) advertisement message comprising information configured to indicate topological information associated with a Layer 0 (L0) network, where the topological information includes information for connectivity within the L0 network that is available to a Layer 3 (L3) network. The advertisement message is sent to a node in the L3 network. The message sent from the L0 network is received at the node in the L3 network. The topological information in the message is analyzed in order to determine connections available to the L3 network, yet within the L0 network. A connection request is sent from the node in the L3 network to the L0 network and connections between the nodes in L3 network are established using available connections in the L0 network.

Abstract: A system and method to automatically configure packet classification at a customer edge network device connecting a customer network to a service provider network. The method may comprise accessing the IP header of a packet received from the customer network to identify a customer service level classification of the packet. A memory may be accessed to retrieve service provider packet classification data identifying classes of service provided to the customer network. The packet classification of the service provider with the associated customer classification is associated and mapped, whereafter the Ethernet header of the packet may be populated with the mapped service provider packet classification.

Abstract: A method is described of constructing a transition route in a data communication network having as components nodes and links. Upon receipt of a transition notification identifying a first component a non-neighboring node constructs a transition route around the first component. In an embodiment, a node performs detecting the first component transition; issuing a transition notification identifying the first component and recognizable by nodes configured to construct a transition route around the first component; and upon expiry of a notification transition period, issuing a transition advertisement recognizable by all nodes on the network.

Abstract: A method, system, apparatus and machine-readable medium for transmitting a packet through a network to convey network topology is provided. The method includes the step of generating at least one link state protocol data unit (LSP) with a first identifier until reaching a maximum sequence number in a sequence assigned to a network device, represented by the first identifier. The method further includes the step of modifying the first identifier to produce a second identifier. The method also includes the step of generating at least one LSP with the second identifier, and with a sequence number that is less than or equal to the maximum sequence number in the sequence. The system for transmitting a packet through a network, to convey network topology, comprises the means for performing the above-mentioned method steps.

Abstract: In one embodiment, a CAM overflow structure holds flow indices in a CAM and each CAM entry is associated with an overflow count value (OCV) entry holding an OCV. If counter in an primary flow-counter bank (PFCB) overflows when updated, the CAM is searched and, if the index of the counter that overflowed is stored in the associated OCV entry, the OCV is incremented. The counter values in the PFCB are scanned according to specified criteria and transferred to a secondary flow-counter bank (SFCB) held in non-custom system RAM. When a counter value is transferred to the SFCB the corresponding OCV is appended to the counter value.

Abstract: In one embodiment, an apparatus and method are described for constructing a repair path in the event of non-availability of a routing domain component of a routing domain comprising, as components, links and nodes. The apparatus is arranged to receive respective network repair addresses from each of the far-side and near-side advertising node for use in the event of non-availability of a routing domain component between the advertising node. The apparatus is further arranged to advertise the near-side advertising node network repair address to one or more far-side nodes via a path external to the routing domain.

Abstract: A method and system are provided for achieving spatial diversity of a wireless communications network. The method comprises arranging antennas on a transmitting wireless station into a plurality of antenna subgroups, wherein each of the antenna subgroups forms a virtual antenna, creating a plurality of beamformed MIMO channels using the plurality of virtual antennas, wherein each of the beamformed MIMO channel comprises a plurality of sub-carriers and corresponds to a virtual antenna, dividing sub-carriers in each of the plurality of beamformed MIMO channels into at least a first and second cluster, distributing a first amount of transmitting power to the first cluster and a second amount of transmitting power to the second cluster, wherein the first amount of transmitting power is substantially larger than the second amount of transmitting power.

Abstract: There is provided a traffic placement method in a communications network, the communications network comprising a plurality of nodes, the nodes being connected to one another by links, the method comprising selecting a (possibly non-strict) subset from a given set of traffic flow demands and calculating a plurality of paths for the selected demands under consideration of a set of constraints using an algorithm hybridisation combining backtrack search with local consistency techniques (BT+CS) and guiding search by the use of one or more probe generators, that is, search techniques that solve a routing sub-problem or an arbitrary relaxation of the traffic placement problem. By using a hybrid algorithm that integrates other solvers (search techniques) into BT+CS through the use of probe generators, a more powerful search strategy can be achieved compared to BT+CS or the individual search techniques.

Abstract: The repetitive structure of a preamble signal is exploited to enhance timing synchronization performance and frame start detection performance under adverse channel conditions. Received values are cross-correlated in time against a known noise-free version of the preamble. The presence of peaks in the cross-correlation output indicates presence of a frame. The peak locations provide symbol timing. Further cross-correlation processing and/or non-linear processing can be used to enhance the signal to noise ratio of the peaks.

Abstract: Systems and methods for collaborating over the Internet (or an intranet) in which two or more parties, such as a user and an agent, can share dynamic content generated by a web site server. Collaboration can be accomplished on live, dynamic pages without imposing a proxy server between user browsers and the web servers. Mechanisms prevent multiple submissions, and filters can be provided to selectively filter versions of a page for different users.