초록 ▼

A system for routing data packets in a packet network. Packets are classified as either type-1 or type-2. Each type is routed to its destination on a smallest-delay path. However, each type can experience a different time delay between nodes in the network. Thus, the smallest-delay path for a type-1

A system for routing data packets in a packet network. Packets are classified as either type-1 or type-2. Each type is routed to its destination on a smallest-delay path. However, each type can experience a different time delay between nodes in the network. Thus, the smallest-delay path for a type-1 packet may be different from that for a type-2 packet, even if the origin and destination of both types are the same. Further, these time delays can change. The invention monitors the changes, and continually identifies the smallest-delay paths for the packets.

대표청구항 ▼

[ What is claimed is:] [6.]6. A method of operating a computer network, which comprises nodes, at least some of which maintain access to both(1) a first table for type-1 packets, and(2) a second table for type-2 packets, both tables being of the next-hop routing type, comprising the following steps:

[ What is claimed is:] [6.]6. A method of operating a computer network, which comprises nodes, at least some of which maintain access to both(1) a first table for type-1 packets, and(2) a second table for type-2 packets, both tables being of the next-hop routing type, comprising the following steps:a) receiving, at nodes, data packets, each bearing a tag identifying it as type-1 or type-2;b) routing the type-1 packets along respective paths which result in an average transit time T1;c) routing the type-2 packets along respective paths which result in an average transit time T2, which exceeds T1,d) measuring average delay time, ADT, of packets across links, and updating the first routing table using measured ADT; ande) measuring utilization of links, and updating the second routing table using measured utilization.