 Method and system for restricting access to the private key of a user in a public key infrastructure |
| An aspect of one object of the present invention is to provide an improved encryption/decryption ... |
|
| Circuit and method for testing a disk drive head assembly without probing |
| OF THE INVENTION FIG. 1 represents a block diagram of the present invention preamplifier test ... |
|
| Parallel test circuit for semiconductor memory device |
| OF THE PREFERRED EMBODIMENT Reference will now be made in detail to the preferred embodiment of ... |
|
| I/O module for a serial multiplex data system with a programmable communication module selector |
| It is therefore the principal object of the present invention to provide a data link module for use ... |
|
| Test-facilitating circuit for information processing devices |
| Therefore, it is an object of the present invention to provide a test-facilitating circuit for ... |
|
| Integrated test circuit |
| In accordance with the present invention, a boundary scan test system is provided which ... |
|
| Transparently gathering a chips multiple internal states via scan path and a trigger |
| According to the present invention, a scan path is used to capture data of miscellaneous logic ... |
|
| Method and apparatus for dynamically testing electrical interconnect |
| A new type of hardware emulation system is disclosed and claimed which reduces hardware cost by ... |
|
|
Method and system for minimizing the connection set up time in high speed packet switching networks
| Details |
Inventors: Bertin, Olivier; Brun, Gerard; Galand, Claude; Maurel, Olivier; Nicolas, Laurent;
Assignee: Cisco Technology, Inc. (San Jose, CA)
Primary Examiner: Rao; Seema S
Assistant Examiner:
Attorney, Agent or Firm: Cesari and McKenna, LLP, Johnston; A. Sidney
The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. A path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request. |
|
DETAILED DESCRIPTION The present invention is directed to packet switching communication networks comprising a plurality of nodes interconnected with transmission links.
The object of the present invention is to minimize in access nodes the connection set up delay, and in particular the time to select an optimal path throughout the network between the access node and a destination node.
Each node in the network comprises one or more communication adapters for receiving and transmitting data packets, a Route Controller for allocating, controlling, and managing network resources, a Topology Database for storing the network configuration and traffic characteristics, updated by means of network control messages, and a Routing Database, updated simultaneously with the Topology Database, for storing the selected or computed paths with their characteristics.
For each connection request, the claimed method and system involves the steps of: for each connection request, selecting a pre-calculated path satisfying said connection request in the routing database, if no pre-calculated path satisfying the connection request is already stored in the routing database, calculating a path satisfying said connection request and storing said path within the routing database.
In absence of connection request, the method and system involves the further steps of: re-calculating the paths stored in the routing database periodically or in response to pre-determined events such as traffic variations, network configuration changes .
.
.
calculating, for each pre-calculated path stored in the routing database, at least one alternate path with the same origin node and the same destination node.
calculating paths from the origin node to all possible destination nodes.
removing pre-calculated paths from the routing database after a predetermined period of time without being selected.
|
|
I/O Systems 
