Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
1998-12-29
2002-11-26
Kizou, Hassan (Department: 2662)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S400000, C370S449000
Reexamination Certificate
active
06487172
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to the field of data packet delivery across a network and, more specifically, to a bidding algorithm that solicits bids for routing the data packets across the network.
2. Background of the Related Art
The basic practice of exchanging data packets over a communication link is generally known in the art. However, there is an ongoing discussion in the industry for the best way to route packetized data, such as for IP telephony or telephone calls, within the border gateways. The current Border Gateway Protocol (BPG) will have difficulty in routing E.164 calls among the autonomous systems (such as ISPs and large organizations), primarily because the E.164 address spaces are geographically based and separate from the IP address spaces. Hence, there is contention among the autonomous systems for routing the E.164 calls.
The prior art practice requires the use of long and complicated routing tables which list the various links necessary to reach the destination. The use of the table may incur significant delay in looking for an address entry. The delay may be acceptable for text data, but inadequate for voice data over the network. Further, on top of this routing table is a complicated policy layer that sets the conditions and policies for exchanging the data packets between the two destinations, which typically introduces further complexity and delay.
Additionally, when multiple autonomous systems are present, who can provide multiple pathways to the destination, there currently is a lack of adequate contention resolution among the autonomous systems for delivering the packets. Accordingly, it is appreciated that some means of providing for an open contention resolving mechanism at the border gateways would allow for competition among the autonomous systems and may reduce the delay encountered at the border gateway. The present invention describes a contention resolution mechanism based on a bidding algorithm for determining the most desirable route for the transfer of a data packet.
SUMMARY OF THE INVENTION
The present invention describes a method and apparatus for selecting a route to a destination for a data packet. A broadcast is initiated for a request for a bid to transfer the data packet on a network where there are more than one path to the destination. Then, at least one bid is received in response to the broadcast, in which the bid includes a routing metric associated with the transfer of the packet to the destination through a particular path. A desired path to the destination is selected, based on the received routing metric(s).
REFERENCES:
patent: 5245607 (1993-09-01), Caram
patent: 5331635 (1994-07-01), Ota
patent: 5398012 (1995-03-01), Derby et al.
patent: 5719861 (1998-02-01), Okanoue
patent: 6047322 (2000-04-01), Vaid et al.
patent: 6246669 (2001-06-01), Chevalier et al.
patent: 6292832 (2001-09-01), Shah et al.
patent: 2001/0038634 (2001-11-01), Dally et al.
patent: 2002/0041593 (2002-04-01), Leuca et al.
patent: 2002/0049762 (2002-04-01), Shah et al.
patent: 0568737 (1992-05-01), None
patent: 0 599 764 (1994-06-01), None
Blakely , Sokoloff, Taylor & Zafman LLP
Kizou Hassan
Nortel Networks Limited
Yin Lu
LandOfFree
Packet network route selection method and apparatus using a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Packet network route selection method and apparatus using a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet network route selection method and apparatus using a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2933951