Abstract: In one aspect, a computer-implemented method includes generating a workload using at least one schema defined by combinations of ranges of each of at least two attributes. The computer-implemented method also includes receiving a request to provide content. The computer-implemented method further includes provisioning the content based upon the workload.

Abstract: A network and a method for transmitting processes in a network are disclosed, where a randomized coding approach is provided. Network nodes transmit on each outgoing link a linear combination of incoming signals, specified by independently and randomly chosen code coefficients from a finite field. The approach allows robust, distributed transmission and compression of information in networks and is advantageous over routing-based approaches.

Abstract: In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided.

Abstract: A FAWNA that allows high-speed mobile connectivity by leveraging the speed of optical networks. Specifically, SIMO FAWNA, which comprises a SIMO wireless channel interfaced with a fiber channel through wireless-to-optical interfaces. Received wireless signal at each interface are sampled and quantized prior to transmission. The capacity of the FAWNA approaches the capacity of the architecture exponentially with fiber capacity. It is also shown that for a given fiber capacity, there is an optimal method of operating wireless bandwidth and number of interfaces. An optimal method to divide the fiber capacity among the interfaces is shown, which ensures that each interface is allocated a rate so that noise is dominated by front end noise rather than by quantization distortion. A method is also presented in which, rather than dynamically changing rate allocation based on channel state, a less complex, fixed rate allocation may be adopted with very small loss in performance.

Abstract: A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets.

Abstract: A method, apparatus and computer program product for feedback-based online network coding is presented. In one embodiment, a transmitting node determines a linear combination of packets to transmit from a transmit queue. The transmitting node transmits the linear combination of packets. The transmitting node determines whether a packet can be removed from the transmit queue, wherein when a determination is made that a packet can be removed from the transmit queue then removing the packet from the transmit queue, and when a determination is made that a packet cannot be removed from the transmit queue then refraining from removing the packet from the transmit queue.

Abstract: A system for simultaneously transmitting and receiving multiple data messages on a unidirectional ring having a plurality of nodes coupled thereto is described. This technique utilizes a medium access (MAC) protocol for a multi-gigabit-per-second local-area optical wavelength division multiplexed (WDM) network that is particularly well suited for high-performance computing environments that need a network that provides quality of service and the ability to enforce service level agreements. The protocol uses an asynchronous, unslotted, tokenless, and collision-free access scheme that is arbitrated by a centralized scheduler. The embodiment is based on a folded-bus unidirectional ring that is passively optically tapped by the nodes to both transmit data onto the network and to receive data from the network.

Abstract: A fiber-optic networking system that can survive a break in the fiber and restore full connectivity to all nodes in the network. The network can detect the presence of a cut in the fiber, locate the cut, recover from the cut, and restore the communication capacity that was available before the cut. The network is also capable of automatically determining the existence and identity of the nodes in the network, the distance of the node from the headend, and the executing procedures to handle both planned and unplanned (i.e., during a fault) removal of nodes from the network.

Abstract: A method and computer program product for performing minimum cost routing with network coding is presented. The method and system model a network as a directed graph. A cost per unit flow is associated with each link of the directed graph. A link capacity is associated with each link of the directed graph. A network code is then computed that sets up a routing connection that achieves an optimal cost using the cost per unit flow for each link of the directed graph and using the link capacity for each link of the directed graph.

Abstract: A fiber-optic networking system that can survive a break in the fiber and restore full connectivity to all nodes in the network. The network can detect the presence of a cut in the fiber, locate the cut, recover from the cut, and restore the communication capacity that was available before the cut. The network is also capable of automatically determining the existence and identity of the nodes in the network, the distance of the node from the headend, and the executing procedures to handle both planned and unplanned (i.e., during a fault) removal of nodes from the network.

Abstract: A FAWNA that allows high-speed mobile connectivity by leveraging the speed of optical networks. Specifically, SIMO FAWNA, which comprises a SIMO wireless channel interfaced with a fiber channel through wireless-to-optical interfaces. Received wireless signal at each interface are sampled and quantized prior to transmission. The capacity of the FAWNA approaches the capacity of the architecture exponentially with fiber capacity. It is also shown that for a given fiber capacity, there is an optimal method of operating wireless bandwidth and number of interfaces. An optimal method to divide the fiber capacity among the interfaces is shown, which ensures that each interface is allocated a rate so that noise is dominated by front end noise rather than by quantization distortion. A method is also presented in which, rather than dynamically changing rate allocation based on channel state, a less complex, fixed rate allocation may be adopted with very small loss in performance.

Abstract: A method and apparatus for a communications network that executes a medium access control (MAC) protocol that permits multiple access to a shared medium or shared switching fabric. The MAC protocol uses a bandwidth allocator to regulate access to the network by sending a permission message to a node, allowing it to transmit to a specific set of nodes for a specific length of time. The medium and switching fabric can carry one or more protocols, each of varying framing format and native bitrate. The switching fabric provides a connection-oriented bufferless data transport service that preserves frame ordering. An illustrative embodiment uses a slotted master/slave time-division multiplexed access (TDMA) scheme to allow flexible provisioning of network bandwidth.

Abstract: A multiple switch architecture is presented. The architecture includes two or more switches on a ring wherein interconnection between the switches allows one switch to generate control and scheduling commands to the other switch.

Abstract: A method and computer program product for performing minimum cost routing with network coding is presented. The method and system model a network as a directed graph. A cost per unit flow is associated with each link of the directed graph. A link capacity is associated with each link of the directed graph. A network code is then computed that sets up a routing connection that achieves an optimal cost using the cost per unit flow for each link of the directed graph and using the link capacity for each link of the directed graph.

Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is detrmined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

Abstract: A method, apparatus and computer program product for providing rapid information dissemination using network coding is presented. A coded message including a payload and a code vector, is transmitted from a first node of the network to a second node of the network. The information thus stored can also be retrieved by collecting code vectors from at least one node and viewing the collected code vectors as a matrix. A determination is made regarding whether a dimension of the matrix is equal to a predefined number. When the dimension of the matrix equals the predefined number, the information is retrieved using the collection of code vectors in the matrix.

Abstract: A network and a method for transmitting processes in a network are disclosed, where a randomized coding approach is provided. Network nodes transmit on each outgoing link a linear combination of incoming signals, specified by independently and randomly chosen code coefficients from a finite field. The approach allows robust, distributed transmission and compression of information in networks and is advantageous over routing-based approaches.

Abstract: The present invention describes a system for providing quality of service (QoS) features in communications switching devices and routers. The QoS provided by this system need not be intrinsic to the communication protocols being transported through the network. Preferred embodiments also generate statistics with the granularity of the QoS. The system can be implemented in a single application-specific integrated circuit (ASIC), in a chassis-based switch or router, or in a more general distributed architecture. The system architecture is a virtual output queued (VOQed) crossbar. The administrator establishes policies for port pairs within the switch, and optionally with finer granularity. Frames are directed to unique VOQs based on both policy and protocol criteria. Policies are implemented by means of a scheduling engine that allocates time slices (minimum units of crossbar access).

Abstract: A Bi-directional Link Self-healing Network (BLSN) for implementing bi-directional link automatic protection switching (APS) for an arbitrary edge or node redundant network and a technique for implementing APS recovery in response to an edge or node failure in a network is described. The BLSN technique does not require permanent allocation of spare capacity for each connection and allows sharing of capacity among many network connections by allocating capacity for use only in the event of a failure. The described technique allows loopback protection to be performed over node or edge redundant networks and operates such that the remains connected after the failure of a node or an edge in the network. The technique makes use of connected directed subgraphs of the network. Also described are techniques for generating the directed subgraphs on node and edge redundant networks having an arbitrary network topology.

Abstract: Apparatus and techniques for detecting malfunctions, anomalies and attacks upon optical devices of a transparent all-optical network, including amplified links and optical nodes, of the network. A portion of an input signal of the optical device and a portion of an output signal from the optical device are coupled to an optical processing unit and a an optical to electrical signal converter. The electrical output signal of the converter is coupled to an electronic processing unit which generates a difference signal which is a function of the input and output signal portions for comparison to a predetermined set of parameters. The result of the comparison is an alarm signal indicative of the occurrence of a malfunction. Also described is an optical comparator capable of generating the difference signal which is indicative of perturbations in the optical device.