Abstract: A first controller in a distributed network obtains, concurrently with a second controller in the distributed network, a system requirement and a message from a logical bus. The first controller and the second controller are communicatively coupled to the logical bus, and the first controller is communicatively coupled to a first portion of the network components and the second controller is communicatively coupled to a second portion. A processor associated with the first controller solves, concurrently with the second controller, the system requirement and the solving includes applying a solver to generate new configurations of the network components. The new configurations generated by the first controller are identical to the new configurations generated by the second controller. The first controller extracts configurations relevant to the first portion of the network components and applies the configurations to the first portion of the network components.

Abstract: A first controller in a distributed network obtains, concurrently with a second controller in the distributed network, a system requirement and a message from a logical bus. The first controller and the second controller are communicatively coupled to the logical bus, and the first controller is communicatively coupled to a first portion of the network components and the second controller is communicatively coupled to a second portion. A processor associated with the first controller solves, concurrently with the second controller, the system requirement and the solving includes applying a solver to generate new configurations of the network components. The new configurations generated by the first controller are identical to the new configurations generated by the second controller. The first controller extracts configurations relevant to the first portion of the network components and applies the configurations to the first portion of the network components.

Abstract: An inventive system and method for intrusion-tolerant group management for a network is presented. The method comprises a client broadcasting a message request to controllers and validating the rekey messages received from the controllers, and controllers validating the client's broadcast message request and broadcasting proposals, collecting proposals, constructing threshold-signed proofs, updating the view umber, performing the client's message request, generating the rekey based on the valid proposals and transmitting the rekey to the client. Simultaneously, controllers send reconciliation messages to all controllers, based on which the membership state is updated. The client updates a shared key when a predetermined number of valid rekey messages are received. The controllers can communicate via a byzantine fault-tolerant agreement. The client can use its public key to decrypt the rekey and perform validation. The client's message request can be a join or a leave.

Abstract: The present invention relates to on-line admission-control decisions. Specifically, the invention concerns general delay bounds for both deterministic and statistical cases for Differentiated Services (DiffServ) networks. More specifically, a detailed method of calculation in each case is followed by simpler methods of calculation that are more appropriate for on-line admission-control decisions. Relatively involved occupancy bound calculations for various service classes take place only at the time of network configuration or reconfiguration. At the time of admission control only simple occupancy threshold compliance calculations need to be performed. Concrete illustrations are provided for deriving bounds for the EF and AF classes provided by DiffServ. These results are applicable to both layer-3 networks that support DiffServ and layer-2 networks that support the more restricted class of service functions.

Abstract: An inventive system and method for intrusion-tolerant group management for a network is presented. The method comprises a client broadcasting a message request to controllers and validating the rekey messages received from the controllers, and controllers validating the client's broadcast message request and broadcasting proposals, collecting proposals, constructing threshold-signed proofs, updating the view umber, performing the client's message request, generating the rekey based on the valid proposals and transmitting the rekey to the client. Simultaneously, controllers send reconciliation messages to all controllers, based on which the membership state is updated. The client updates a shared key when a predetermined number of valid rekey messages are received. The controllers can communicate via a byzantine fault-tolerant agreement. The client can use its public key to decrypt the rekey and perform validation. The client's message request can be a join or a leave.

Abstract: The present invention relates to on-line admission-control decisions. Specifically, the invention concerns general delay bounds for both deterministic and statistical cases for Differentiated Services (DiffServ) networks. More specifically, a detailed method of calculation in each case is followed by simpler methods of calculation that are more appropriate for on-line admission-control decisions. Relatively involved occupancy bound calculations for various service classes take place only at the time of network configuration or reconfiguration. At the time of admission control only simple occupancy threshold compliance calculations need to be performed. Concrete illustrations are provided for deriving bounds for the EF and AF classes provided by DiffServ. These results are applicable to both layer-3 networks that support DiffServ and layer-2 networks that support the more restricted class of service functions.

Abstract: A method for reconfiguring a telecommunications network comprising a plurality of reconfigurable cross-connect nodes interconnected by links when a failure event occurs is disclosed. The method comprises storing at each node a precomputed configuration table corresponding to each of a plurality of possible network topologies which can result from a plurality of possible failure events. After a specific failure event occurs, the network is flooded with messages so that each of the nodes is informed as to the specific existing topology of the network resulting from the specific failure event. The nodes are then reconfigurated in accordance with the precomputed configuration tables which correspond to the specific existing network topology.