Patent application number | Description | Published |
20100189015 | Planning Routes and Allocating Identifiers to Routes in a Managed Frame-Forwarding Network - A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees. | 07-29-2010 |
20140270751 | Passive Optical Loopback - An optical communication device comprises an input/output configured to be coupled to an optical communications line, and a passive optical loopback module coupled to the input and configured to receive optical signals from the input/output, the loopback module being further configured to reflect incoming signals of a test wavelength to the input/output. | 09-18-2014 |
20140270767 | CROSS-CONNECT USING ETHERNET MULTIPLEXORS FOR A SIMPLE METRO ETHERNET NETWORK - A metro area network is provided that includes edge and core multiplexors each having a plurality of line ports and one or more uplink ports, a transport network carrying multiplexed traffic between the edge and core multiplexors. In a hard cross connect implementation utilizing source port tagging, a cross-connect device coupled to the core multiplexors provisions or maps communications path between the core multiplexors thereby providing preselected connectivity/mapping of two or more line ports of any of the edge multiplexors. In a soft cross connect implementation utilizing destination port tagging, a cross-connect device includes additional cross-connect multiplexors and functionality to control the destination port tagging performed in the edge, core and cross connect multiplexors thereby provisioning or mapping the desired communications path(s) between various endpoints. | 09-18-2014 |
Patent application number | Description | Published |
20100215045 | Method and Apparatus for Direct Frame Switching Using Frame Contained Destination Information - Frame contained destination information may be used by a switch to identify an appropriate output port for a given frame without performing a table access operation. This reduces the processing requirements of the switch to enable the switch to handle frames more efficiently. The frame contained destination information may be contained in the frame's local destination MAC addresses (DA) such that a portion of the DA directly indicates, for each switch that handles the frame, an output port for that switch. Different portions of the DA may be used by different switches, depending on where they are in the network hierarchy. Large switches may also use sub-fields within their allocated portion in the DA to identify internal switching components. A location resolution server may be provided to store and distribute IP and MAC addresses and respond to local ARP requests on the local domain. | 08-26-2010 |
20120155473 | METHOD AND APPARATUS FOR DIRECT FRAME SWITCHING USING FRAME CONTAINED DESTINATION INFORMATION - Frame contained destination information may be used by a switch to identify an appropriate output port for a given frame without performing a table access operation. This reduces the processing requirements of the switch to enable the switch to handle frames more efficiently. The frame contained destination information may be contained in the frame's local destination MAC addresses (DA) such that a portion of the DA directly indicates, for each switch that handles the frame, an output port for that switch. Different portions of the DA may be used by different switches, depending on where they are in the network hierarchy. Large switches may also use sub-fields within their allocated portion in the DA to identify internal switching components. A location resolution server may be provided to store and distribute IP and MAC addresses and respond to local ARP requests on the local domain. | 06-21-2012 |
20140204949 | METHOD AND APPARATUS FOR DIRECT FRAME SWITCHING USING FRAME CONTAINED DESTINATION INFORMATION - Frame contained destination information may be used by a switch to identify an appropriate output port for a given frame without performing a table access operation. This reduces the processing requirements of the switch to enable the switch to handle frames more efficiently. The frame contained destination information may be contained in the frame's local destination MAC addresses (DA) such that a portion of the DA directly indicates, for each switch that handles the frame, an output port for that switch. Different portions of the DA may be used by different switches, depending on where they are in the network hierarchy. Large switches may also use sub-fields within their allocated portion in the DA to identify internal switching components. A location resolution server may be provided to store and distribute IP and MAC addresses and respond to local ARP requests on the local domain. | 07-24-2014 |
Patent application number | Description | Published |
20120101987 | DISTRIBUTED DATABASE SYNCHRONIZATION - Systems and methods of fast synchronization failure detection in distributed databases are disclosed. An example of a method includes receiving a digest of a database stored at a sending node in a network, the digest broadcast by the sending node to N number of nodes in the network. The method also includes generating a digest of a database stored at a receiving node in the network. The method also includes comparing the generated digest to the received digest. The method also includes issuing a lost synchronization signal by the receiving node when the comparison indicates a change in the database stored at the sending node. | 04-26-2012 |
20120188990 | Method for aggregating media access control addresses using a summary media access control address(es) - In frame switched communication networks, information is forwarded from a source to a destination based on a destination address. In IEEE 802 networks these addresses are called Media Access Control (MAC) addresses. MAC addresses identify the source and destination station of each frame, however typically don't contain any subfields which identify the physical or logical location (or subnetwork) of the station. Such an address can be called a flat address. The entities of networks using IEEE 802 MAC addresses don't have methods for aggregating MAC addresses or for forwarding frames based on aggregates rather than station MAC addresses. The use of station MAC addresses for frame forwarding limits the scaling, lowers the efficiency, reduces the security and raises the cost of these networks. The method described here solves the MAC address aggregation problem by using a summary MAC address to represent an aggregate of summarized MAC addresses. | 07-26-2012 |
20140112137 | ROUTING ENCAPSULATED DATA PACKETS ONTO SELECTED VLANS - A system and method are provided to route packets in a data center network. Individual packets are encapsulated at an edge of the data center network, so that each encapsulated packet includes a set of header fields, such as a tenant identifier. For each encapsulated packet, a hash class is determined from the set of header fields. A routing virtual local area network (VLAN) is selected for the packet based on the tenant identifier and the hash class. | 04-24-2014 |
20150195209 | Congestion Notification in a Network - One example provides a network device including a queue to receive in profile frames and out of profile frames, a processor, and a memory communicatively coupled to the processor. The memory stores instructions causing the processor, after execution of the instructions by the processor, to determine whether a predetermined operating point of the queue has been exceeded, and in response to determining that the predetermined operating point of the queue has been exceeded, forward the in profile frames, sample the out of profile frames, and generate a congestion notification message for each sampled out of profile frame to be sent to a source of the out of profile frames to reduce the transmission rate of frames. | 07-09-2015 |
20150229575 | FLOW CONTROL IN A NETWORK - One example provides a network device including a queue to receive frames from a source, a processor, and a memory communicatively coupled to the processor. The memory stores instructions causing the processor, after execution of the instructions by the processor, to determine whether a flow control threshold of the queue has been exceeded, and in response to determining that the flow control threshold of the queue has been exceeded, generate a message to be sent to the source of the frame that exceeded the flow control threshold. The message includes a pause duration for which the source is to stop transmitting frames. | 08-13-2015 |
20150236955 | Congestion Notification in a Network - One example includes a network device. The network device includes a queue to receive frames from a source, a processor, and a memory coupled to the processor. The memory stores instructions causing the processor, after execution of the instructions by the processor, to deposit tokens into a first token bucket at a first rate, determine whether a frame length of a frame received by the queue is less than the tokens in the first token bucket, remove tokens from the first token bucket in response to the frame length being less than the tokens in the first token bucket, and generate a congestion notification message in response to the frame length not being less than the tokens in the first token bucket. Each token represents a unit of bytes of a predetermined size. | 08-20-2015 |