Abstract: A method and system for directing data transfers between applications residing on different computers or devices using a simplified flow control protocol. The protocol eliminates the need for and use of flow control modes and supports all possible data transfer mechanisms. The protocol also allows source and sink applications to independently set their own local memory threshold over which data transfers are made using remote direct memory access (RDMA) or zero-copy transfers. Through adjusting its threshold value or size, a sink or receiving application or component adapts its behavior to the behavior of a sending or source application or component.

Abstract: A method and system for directing data transfers between applications residing on different computers or devices using a simplified flow control protocol. The protocol eliminates the need for and use of flow control modes and supports all possible data transfer mechanisms. The protocol also allows source and sink applications to independently set their own local memory threshold over which data transfers are made using remote direct memory access (RDMA) or zero-copy transfers. Through adjusting its threshold value or size, a sink or receiving application or component adapts its behavior to the behavior of a sending or source application or component.

Abstract: An optical network scheduling device (10) including a plurality of schedulers (16) each corresponding to a respective channel in the optical burst switch network and configured to maintain a transmission schedule for the respective channel; and a controller (12) configured to receive a burst transmission request and to select at least one of the schedulers as a selected scheduler schedule a burst transmission.

Abstract: Methods and systems for fast packet forwarding include traversing a trie data structure stored in on-chip memory based on bits in an input address. The bits in the input address result in a predetermined location in the data structure. The number of bits that have a first value and that are located before the determined location is calculated. The calculated number of bits corresponds to an offset in a second memory device of an address to which the packet having the input address is to be forwarded. The address can be extracted using a single access to an off-chip memory device.

Abstract: Methods and systems for using binary searches for variable length network address prefix lookups are disclosed. Variable length prefixes are stored in a network address forwarding table. Each prefix corresponds to an entry in the forwarding table. The entries correspond to nodes in a binary tree. Each entry in the forwarding table includes path information regarding parent nodes of each entry in the binary tree. When a lookup is performed in the routing table, bits in the path information are used to determine the longest parent node prefix that matches the address being searched. The longest parent node prefix corresponds to the longest matching prefix.

Abstract: Optical burst switch network system and method with Just-in-Time (JIT) signaling and advanced data transmission and memory access and management. The system and method allow concurrent data transmission having arbitrary signal types, such as analog and digital signal types, in which the JIT signaling allows for subsequent simultaneous transmission of optical signals that do not require electro-optical conversion. The system includes an optical signal bus having a passive star coupler. A plurality of network adapters that are in optical communication with the optical signal bus and in network communication with network terminal devices are provided. The network adapters include receivers, transmitters and control logic that allows for bi-directional movement of data signals as bursts between the terminal equipment and the network system. The transmitter and receiver may be fixed or tunable.

Abstract: Methods and systems for using binary searches for variable length network address prefix lookups are disclosed. Variable length prefixes are stored in a network address forwarding table. Each prefix corresponds to an entry in the forwarding table. The entries correspond to nodes in a binary tree. Each entry in the forwarding table includes path information regarding parent nodes of each entry in the binary tree. When a lookup is performed in the routing table, bits in the path information are used to determine the longest parent node prefix that matches the address being searched. The longest parent node prefix corresponds to the longest matching prefix.

Abstract: Methods and systems for fast packet forwarding include traversing a trie data structure stored in on-chip memory based on bits in an input address. The bits in the input address result in a predetermined location in the data structure. The number of bits that have a first value and that are located before the determined location is calculated. The calculated number of bits corresponds to an offset in a second memory device of an address to which the packet having the input address is to be forwarded. The address can be extracted using a single access to an off-chip memory device.