Abstract: An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g.

Abstract: An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g.

Abstract: An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g.

Abstract: An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g.

Abstract: An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g.

Abstract: An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g.

Abstract: An intelligent traffic redirection system performs global load balancing for Web sites located at mirrored data centers. The system relies on a network map that is generated continuously for the user-base of the entire Internet. Instead of probing each local name server (or other host) that is connectable to the mirrored data centers, the network map identifies connectivity with respect to a much smaller set of proxy points, called “core” (or “common”) points. A core point then becomes representative of a set of local name servers (or other hosts) that, from a data center's perspective, share the point. Once core points are identified, a systematic methodology is used to estimate predicted actual download times to a given core point from each of the mirrored data centers. Preferably, ICMP (or so-called “ping” packets) are used to measure roundtrip time (RTT) and latency between a data center and a core point.

Abstract: The present invention pertains to an optical shutter comprising an photon-absorbing layer and a surface layer in a transparent state on at least one side of the photon-absorbing layer, wherein the optical shutter is characterized by the absorption of photons to change the photon-absorbing layer to an opaque state and to change the surface layer to a reflective state. The optical shutter is reversibly imageable between these transparent and reflective states. The optical shutter may comprise a metallized layer on at least one side of the photon-absorbing layer. Preferably, the optical shutter comprises an organic free radical compound, such as a salt of an aminium radical cation, in the photon-absorbing layer. Also provided are optical switch devices and optical buffers comprising such optical shutters and methods of switching an optical signal utilizing such optical shutters and switch devices.

Abstract: The present invention pertains to an optical shutter comprising an organic free radical compound, wherein the optical shutter is reversibly imageable to switch between a non-reflective and transparent state and a reflective state. This switching may be induced by the absorption of photons, the application of an electric current, or thermally. Preferably, the organic free radical compound is a salt of an aminium radical cation. Also provided are optical switch devices and optical buffers comprising such optical shutters, methods of switching an optical signal utilizing such optical shutters and switch devices, and methods of storing an optical signal utilizing such optical buffers.

Abstract: The present invention pertains to an optical shutter comprising an photon-absorbing layer and a surface layer in a transparent state on at least one side of the photon-absorbing layer, wherein the optical shutter is characterized by the absorption of photons to change the photon-absorbing layer to an opaque state and to change the surface layer to a reflective state. The optical shutter is reversibly imageable between these transparent and reflective states. The optical shutter may comprise a metallized layer on at least one side of the photon-absorbing layer. Preferably, the optical shutter comprises an organic free radical compound, such as a salt of an aminium radical cation, in the photon-absorbing layer. Also provided are optical switch devices and optical buffers comprising such optical shutters and methods of switching an optical signal utilizing such optical shutters and switch devices.

Abstract: The present invention pertains to an optical shutter comprising a photon-absorbing layer and a surface layer in a transparent state on at least one side of the photon-absorbing layer, wherein the optical shutter is characterized by the absorption of photons to change the photon-absorbing layer to an opaque state and to change the surface layer to a reflective state. The optical shutter is reversibly imageable between these transparent and reflective states. The optical shutter may comprise a metallized layer on at least one side of the photon-absorbing layer. Preferably, the optical shutter comprises an organic free radical compound, such as a salt of an aminium radical cation, in the photon-absorbing layer. Also provided are optical switch devices and optical buffers comprising such optical shutters and methods of switching an optical signal utilizing such optical shutters and switch devices.

Abstract: When a network element receives a request for an increase in bandwidth via a resource management (RM) cell, the network element determines the rate that it can support. If the rate that the network element can support is less than the requested rate, rather than simply rejecting the requested rate, the network element overwrites the rate encoded in the appropriate field in the arriving RM cell with a lower rate than requested. If the network element can support the requested rate, the rate encoded in the RM cell is left unchanged and the RM cell is transmitted to the network along the connection.

Abstract: When a network element receives a request for an increase in bandwidth via a resource management (RM) cell, the network element determines the rate that it can support. If the rate that the network element can support is less than the requested rate, rather than simply rejecting the requested rate, the network element overwrites the rate encoded in the appropriate field in the arriving RM cell with a lower rate than requested. If the network element can support the requested rate, the rate encoded in the RM cell is left unchanged and the RM cell is transmitted to the network along the connection.

Abstract: The present invention pertains to an optical shutter comprising an organic free radical compound, wherein the optical shutter is reversibly imageable to switch between a non-reflective and transparent state and a reflective state. This switching may be induced by the absorption of photons, the application of an electric current, or thermally. Preferably, the organic free radical compound is a salt of an aminium radical cation. Also provided are optical switch devices and optical buffers comprising such optical shutters, methods of switching an optical signal utilizing such optical shutters and switch devices, and methods of storing an optical signal utilizing such optical buffers.

Abstract: An intelligent traffic redirection system performs global load balancing for Web sites located at mirrored data centers. The system relies on a network map that is generated continuously for the user-base of the entire Internet. Instead of probing each local name server (or other host) that is connectable to the mirrored data centers, the network map identifies connectivity with respect to a much smaller set of proxy points, called “core” (or “common”) points. A core point then becomes representative of a set of local name servers (or other hosts) that, from a data center's perspective, share the point. Once core points are identified, a systematic methodology is used to estimate predicted actual download times to a given core point from each of the mirrored data centers. Preferably, ICMP (or so-called “ping” packets) are used to measure roundtrip time (RTT) and latency between a data center and a core point.

Abstract: The present invention pertains to an optical shutter comprising an photon-absorbing layer and a surface layer in a transparent state on at least one side of the photon-absorbing layer, wherein the optical shutter is characterized by the absorption of photons to change the photon-absorbing layer to an opaque state and to change the surface layer to a reflective state. The optical shutter is reversibly imageable between these transparent and reflective states. The optical shutter may comprise a metallized layer on at least one side of the photon-absorbing layer. Preferably, the optical shutter comprises an organic free radical compound, such as a salt of an aminium radical cation, in the photon-absorbing layer. Also provided are optical switch devices and optical buffers comprising such optical shutters and methods of switching an optical signal utilizing such optical shutters and switch devices.

Abstract: Acknowledgment of acceptance of a request for bandwidth for a block transfer connection is delayed at the public network side of a boundary between a public network and a private destination network. As a result, each network element within the private destination network can either reject or reduce the requested rate encoded in a resource management (RM) cell to a level that the network element can grant. An acknowledgment RM cell is only then issued from the private destination network, which indicates either acceptance, rejection, or acceptance at a lower rate. When the source of the connection receives the acknowledgment RM cell from the private destination network, it begins to transmit at a rate that the private destination network and destination end system can support.

Abstract: A method for dimensioning link bandwidth for elastic-data traffic for a link in a communications network, in which a number of connections N having elastic-data traffic flowing over a bottlenecked link in a communications network is determined. A transfer rate ?f for each connection is determined for the condition that the communications network is not a constraining resource for the connection. A per-connection bandwidth objective b is determined for elastic-data traffic flowing over the link. Lastly, a link bandwidth B for the link is dimensioned for the elastic-data traffic flowing over the link based on either a mean performance criterion or a tail performance criterion using the determined number of connections N, the determined transfer rate for each connection and the determined per-connection bandwidth objective b.

Abstract: A method is provided for admitting new requests for service in a shared resource having a capacity. The new request has service priority levels associated therewith. In one embodiment of the invention, for example, the shared resource may be a packet communications network and the service request may be a request to admit a new connection. The method proceeds as follows. First, for each service priority level on said shared resource, a total effective bandwidth is generated which is represented by a sum of individual effective bandwidths of previously admitted requests for service. Subsequent to receiving a new request for service having a specified priority of service level, a plurality of effective bandwidths are accessed for the new request. The plurality of effective bandwidths are respectively associated with the specified service priority level and service priority levels therebelow.

Abstract: A fair and efficient admission scheme enables sharing of a common resource among N traffic classes, such that each class is guaranteed (on a suitable long-term basis) a contracted minimum use of the resource, and each class can go beyond the contract when extra resource capacity becomes temporarily available. The scheme operates in an open loop mode, and thus does not require information describing the current status of the resource. For the purposes of description, one form of the invention is best described in terms of "tokens" and "token banks" with finite sizes. Our scheme uses one token bank per class (bank `i`, i= 1, . . . ,N), plus one spare bank. Class `i` is preassigned a rate, rate(i), i=1, . . . ,N, that represents the "guaranteed throughput" or contracted admission rate for class `i`. Tokens are sent to bank `i` at rate(i). Tokens that find a full bank are sent to the spare bank. When the spare bank is also full, the token is lost. Every admitted arrival consumes a token.