Abstract: A communication network is configured to implement time scale separated management and provisioning optimizations, for example, in a core optical network coupled to multiple data networks. Network management optimizations are performed at respective points in time separated by intervals of a first time scale, and network provisioning optimizations are performed at respective points in time separated by intervals of a second time scale, with the intervals of the second time scale being on average substantially longer than the intervals of the first time scale. Moreover, at least a given one of the intervals of the second time scale has a length which is determined based on results of performance of one or more of the network management optimizations. The core optical network may be configured utilizing information specified by the network management and network provisioning optimizations.

Abstract: A method of operating a packet network includes the step of selecting one of a plurality of candidate gateways to connect a multimedia communication session between the packet network and a TDM network. The packet network has a source node of the multimedia communication session, and the TDM network has a destination of the multimedia communication session. The candidate gateways interconnect the packet network and the TDM network. The selecting step includes comparing end-to-end congestions for bearer traffic between the source node and different candidate gateways of the plurality.

Abstract: An optical communications network architecture and associated method which employs time and wavelength-interleaving for homing between nodes/satellites and hubs and for grooming, while employing wavelength-division-multiplexed wavelength circuits between hubs without requiring cross-connects or routers therebetween.

Abstract: An optical communications network architecture and associated method which employs time and wavelength-interleaving for homing between nodes/satellites and hubs and for grooming, while employing wavelength-division-multiplexed wavelength circuits between hubs without requiring cross-connects or routers therebetween.

Abstract: A method includes transmitting a list of willingness-to-pays for optical data capacities to an optical network. The optical network has a set of gateway nodes connected directly to nodes of a data network. The optical network is configured to transmit data communications on a plurality of wavelength channels. Each willingness-to-pay represents a value for an optical data capacity between a corresponding pair of the gateway nodes of the optical network.

Abstract: A communication network is configured to implement time scale separated management and provisioning optimizations, for example, in a core optical network coupled to multiple data networks. Network management optimizations are performed at respective points in time separated by intervals of a first time scale, and network provisioning optimizations are performed at respective points in time separated by intervals of a second time scale, with the intervals of the second time scale being on average substantially longer than the intervals of the first time scale. Moreover, at least a given one of the intervals of the second time scale has a length which is determined based on results of performance of one or more of the network management optimizations. The core optical network maybe configured utilizing information specified by the network management and network provisioning optimizations.

Abstract: In a system and method of optical communication, optical signals are generated in multiple wavelength channels. Each optical signal is passively transported from an origination node of a network to a destination node. The destination node is determined by the signal wavelength. For at least some signals, the passive transport includes transport through a branch point of the network, such that the signal wavelength determines the output branch through which the signal is routed. In certain embodiments, signals are generated according to a schedule devised to substantially prevent the concurrent arrival, at the same destination node, of signals having the same wavelength but coming from different origination nodes.

Abstract: A method of operating a packet network includes the step of selecting one of a plurality of candidate gateways to connect a multimedia communication session between the packet network and a TDM network. The packet network has a source node of the multimedia communication session, and the TDM network has a destination of the multimedia communication session. The candidate gateways interconnect the packet network and the TDM network. The selecting step includes comparing end-to-end congestions for bearer traffic between the source node and different candidate gateways of the plurality.

Abstract: A method includes transmitting a list of willingness-to-pays for optical data capacities to an optical network. The optical network has a set of gateway nodes connected directly to nodes of a data network. The optical network is configured to transmit data communications on a plurality of wavelength channels. Each willingness-to-pay represents a value for an optical data capacity between a corresponding pair of the gateway nodes of the optical network.

Abstract: Disclosed are network management procedures that apply measurements of traffic load to achieve greater efficiency in the operation of the network. In a method for deciding whether to route an incoming call on a selected potential service route, the potential service route is treated preferentially if each of its links has available capacity that is more than sufficient by a specified margin. In a method for computing billing revenues, the non-compliance of the network service provider with contracted requirements for carried load causes a revenue penalty to be exacted for lost bandwidth.

Abstract: A method is provided for a dynamic optimization of network resource allocation on the part of a network service provider. In particular, the method of the invention provides an analytical framework for a determination by network service providers of an optimal resource allocation among links in a service provider's own network and links obtained from other network service providers. The analytical framework of the invention also incorporates, as a parameter, the provision of link capacity to other network service providers in the determination of an optimal resource allocation. In a preferred embodiment of the invention, such an optimal resource allocation is determined in respect to revenue maximization for the network service provider.

Abstract: Disclosed are network management procedures that apply measurements of traffic load to achieve greater efficiency in the operation of the network. In a method for deciding whether to route an incoming call on a selected potential service route, the potential service route is treated preferentially if each of its links has available capacity that is more than sufficient by a specified margin. In a method for computing billing revenues, the non-compliance of the network service provider with contracted requirements for carried load causes a revenue penalty to be exacted for lost bandwidth.

Abstract: In a traffic engineering technique, a determination is made as to whether any path of a number of predetermined paths meets requirements corresponding to a request. The predetermined paths are determined by substantially maximizing carried demand using at least traffic demand estimates and network topology information and by performing routing for the substantially maximized carried demand. If a given path meeting the requirements is found, a connection on the given path is created, if possible. The predetermined paths are determined through offline TE techniques referred to herein as offline design-based routing (DBR). The requirements for the path may include a destination address and a bandwidth. The offline DBR techniques can include uncertain static demand information or dynamic connections.

Abstract: In a system and method of optical communication, optical signals are generated in multiple wavelength channels. Each optical signal is passively transported from an origination node of a network to a destination node. The destination node is determined by the signal wavelength. For at least some signals, the passive transport includes transport through a branch point of the network, such that the signal wavelength determines the output branch through which the signal is routed. In certain embodiments, signals are generated according to a schedule devised to substantially prevent the concurrent arrival, at the same destination node, of signals having the same wavelength but coming from different origination nodes.

Abstract: The present invention relates to the use of Indian Green Mussel (Perna viridis) as a source of anti-HIV activity. More particularly, the present invention relates to the use of an extract of Indian Green Mussel (Perna viridis) as a source of anti-HIV activity in vitro.

Abstract: Generalized Processor Sharing (GPS) is a scheduling discipline which provides minimum service guarantees as well as fair resource sharing. The performance of GPS is governed by the scheduling weights associated with individual connections. The system discloses methods for GPS scheduling that handle an arbitrary number of connection classes and reservation-based weights and admission control techniques to achieve fairness among connection classes. The methods allow statistical multiplexing gains in the presence of multiple traffic and Quality of Service (QoS) classes of connections that share a common trunk. Also disclosed are several novel techniques to compute and adapt the weights.

Abstract: A method is described for solving traffic engineering problems in a network. In one aspect, the invention is used in a network that has at least one QoS service class and at least one class of service that is not a QoS class. Bandwidth is allocated to service routes in the QoS service class so as to optimize a figure of merit such as network revenue. Then a new allocation is made so as to minimize network usage without departing too far from the optimal value of the figure of merit. A residual network consists of that bandwidth that remains unallocated, on each link of the network. Bandwidth for non-QoS traffic is allocated to routes on the residual network. In a second aspect, the invention involves the use of optimization techniques to allocate bandwidth among service routes in one or more service classes in response to a set of demands in each class.

Abstract: A packet network employs routers that determine network routing based on quality of service (QoS) provisioning parameters and network topology information. QoS provisioning parameters are provided to each router from a network management database, and the network topology information is determined from a link state database of the router. The link state database may include network topology information collected by the router in accordance with the open shortest path protocol (OSPF). A network link, router, or other node failure initiates a new path-selection process. First, a temporary set of provisioning entries may be determined with a shortest path first (SPF) routing method. Then, the network packet flows may be classified into packet flows, real-time and non-real-time, and then as packet flows that require reserved bandwidth or that may be multiplexed.

Abstract: Disclosed are network management procedures that apply measurements of traffic load to achieve greater efficiency in the operation of the network. In a method for deciding whether to route an incoming call on a selected potential service route, the potential service route is treated preferentially if each of its links has available capacity that is more than sufficient by a specified margin. In a method for computing billing revenues, the non-compliance of the network service provider with contracted requirements for carried load causes a revenue penalty to be exacted for lost bandwidth.

Abstract: This Generalized Processor Sharing (GPS) is the basis for the packet scheduler of choice in IP routers and ATM switches of the future. The currently accepted approach for the design of GPS schedulers is based on deterministic QoS guarantees, which, it is generally accepted, is overly conservative and leads to limitations on capacity. To address this problem we develop a framework for GPS scheduling which is based on statistical QoS guarantees and statistical multiplexing. We give the design of GPS weights which maximize the coverage of operating points, and also the design of the connection admission control (CAC). The general framework is end-to-end, with two heterogeneous QoS classes coexisting with a third, best effort class. Each QoS class has a specified delay bound together with a bound on the probability of its violation. An important objective is to maximize the bandwidth available to best effort traffic while just satisfying the guarantees of the QoS classes.