WO2001027786A1

WO2001027786A1 - Internal outbound routing based on private peer availability

Info

Publication number: WO2001027786A1
Application number: PCT/US1999/023820
Authority: WO
Inventors: Maxon Duncan; Edward Roberts
Original assignee: Mindarrow Systems, Inc.
Priority date: 1999-10-12
Filing date: 1999-10-12
Publication date: 2001-04-19
Also published as: AU6515399A

Abstract

Methods and devices for route selection via private peer connection are described herein. More specifically, one such method comprises providing a source network (1) coupled to a destination network (INTERNET) by a plurality of routes (52, 53, 54), wherein a first route of the plurality of routes comprises a private peer connection between the source network and the destination network and a second route of the plurality of routes comprises a network (62, 63, 64) other than the source network or the destination network; selecting a route from the source network to the destination network by choosing the route comprising the private peer connection; and sending a message via the selected route.

Description

INTERNAL OUTBOUND ROUTING BASED ON PRIVATE PEER AVAILABILITY

Field of The Invention The field of the invention is computer networks.

Background of The Invention

The Internet is essentially a network of interconnected sub-networks (subnets) such that Internet traffic is essentially data flowing between the subnets. If one is looking at the names/addresses assigned to networks and machines on the Internet, one sees an orderly structure in the form of an inverted tree. However, when one looks at possibly routes of data flow among the subnets, one sees a tangled mass of interconnected subnets with many subnets having direct connections to ^•'peer^" subnets in addition to direct connections to "parent" or "backbone^" networks.

When a subnet is connected to the Internet it is typically connected to a network access point (NAP) either directly or via an Internet Service Provider's (ISP) network. A NAP is an exchange point for Internet traffic through which an Internet Service Provider (ISPs) or other entity connects its networks to a large backbone provider so as to obtain connectivity with and through the backbone provider's networks and other networks connected to the backbone provider.

In addition to being connected to all the other subnets of the Internet through the NAP, a given subnet might have one or more direct connections to a peer subnet. The exchanging of Internet traffic between subnets is generally referred to as "peering", and the agreements which are entered into between any two peer subnets as "private peering agreements". It is likely that any direct connection between two peer subnets is subject to a peering agreement.

Access to a NAP often requires entering into a multi-lateral peering agreement. A multi-lateral peering agreement is generally aimed at improving the general connectivity of the Internet by providing additional routes for data flow between subnets. In a multi-lateral peering agreement one typically agrees to allow Internet traffic to flow through one^'s network between any directly connected peer networks and between the NAP and any directly connected peer networks. As a result of the various peering agreements and the interconnection of subnets obtained through them, there are typically multiple routes between any given source and destination. Route selection is typically accomplished via low level protocols and "quasi- static" routing tables. Routing tables are "quasi-static" in the sense that they only change when the topography of the network changes, or when manually modified by an operator. Such tables are typically used to implement "cost based" routing in that each link in a table has an assigned cost and route selection is done so as to minimize the cost.

A problem with typical routing methods is that they fail to take current load conditions into account. A "least cost" route may continue to be chosen even though the amount of traffic flowing through it already exceeds the capacity of the route to transfer the data in a timely fashion. Thus, there is a continuing need for methods and apparatus to improve routing.

Summary of the Invention

Methods and devices for route selection via private peer connection are described herein. More specifically, one such method comprises providing a source network coupled to a destination network by a plurality of routes, wherein a first route of the plurality of routes comprises a private peer connection between the source network and the destination network, and a second route of the plurality of routes comprises a network other than the source network or the destination network; selecting a route from the source network to the destination network by choosing the route comprising the private peer connection; and sending a message via the selected route.

Brief Description of The Drawings

Fig. 1 is a schematic view of a network embodying the invention.

Fig. 2 is a diagram of a procedure embodying the invention.

Detailed Description

Referring first to figure 1, a WAN 1 comprises a master subnet (10) and multiple remote subnets (20, 30 and 40), with the remote subnets (20. 30 and 40) having one or more connections to the Internet via a NAP (52, 53. and 54) as well as one or more private peer connections to peer networks (62, 63, and 64). Data flowing from the master subnet (10) to a peer network (62, 63, or 64) can thus flow from the master subnet to a remote subnet and then either though a NAP and the Internet to the peer network (62, 63, or 64) or from the remote subnet directly to the peer network via a private peer connection.

Although data can flow through a NAP to the Internet and thus through various 3^rd party networks to reach its destination, use of such a path or paths is not always desirable, even if such a path has the "least cost" in terms of delivery time, number of hops, capacity or some other factor. This is particularly true when large amounts of data are being transferred. In many instances it is preferable to choose a non-least-cost route for transferring data in order to avoid violating the terms of a peering agreement or simply to avoid negatively impacting the performance of a 3^rd parties network.

A preferred method of routing will take advantage of any private peer connections to transfer data such that if a private peer connection exists between the master subnet/source and a peer subnet/destination, a route through the private peer connection will be used even if an alternative route through a NAP or another private peer connection exists and the route would normally be more desirable due to some factor such as lower cost, higher bandwidth or shorter delivery time. Such a method would comprise providing a source network coupled to a destination network by a plurality of routes, wherein a first route of the plurality of routes comprises a private peer connection between the source network and the destination network and a second route of the plurality of routes comprises a network other than the source network or the destination network: selecting a route from the source network to the destination network by choosing the route comprising the private peer connection; and sending a message via the selected route.

It is contemplated that the first route will be selected over the second route even if network layer routing tables assign a higher cost to the first route than to the second route, the second route has a higher capacity than the first route, or the second route would deliver the message faster than the first route.

The disclosed network and method are contemplated as being particularly applicable wherein the peer subnets are large ISPs such as Prodigy™, AOL™ and Earthlink™ and large amounts of data are to be transferred between a master site/subnet and the peer subnets. Routing via private peer connection avoids negatively impacting 3^rd party networks and the Internet as a whole and limits the impact to parties having an existing contractual relationship and therefore some control over the amount of data being transferred.

Thus, specific embodiments and applications of methods and devices for network routing via private peer connections have been disclosed. It should be apparent, however, to those skilled in the art that many more modifications besides those already described are possible without departing from the inventive concepts herein. The inventive subject matter, therefore, is not to be restricted except in the spirit of the appended claims. Moreover, in interpreting both the specification and the claims, all terms should be interpreted in the broadest possible manner consistent with the context. In particular, the terms "comprises" and "comprising" should be interpreted as referring to elements, components, or steps in a non-exclusive manner, indicating that the referenced elements, components, or steps may be present, utilized, or combined with other elements, components, or steps that are not expressly referenced.

Claims

CLAIMSWhat is claimed is:

1. A method of routing comprising:

providing a source network coupled to a destination network by a plurality of routes, wherein a first route of the plurality of routes comprises a private peer connection between the source network and the destination network and a second route of the plurality of routes comprises a network other than the source network or the destination network;

selecting a route from the source network to the destination network by choosing the route comprising the private peer connection;

sending a message via the selected route.

2. The method of claim 1 wherein network layer routing tables assign a higher cost to the first route than to the second route.

3. The method of claim 1 wherein the second route has a higher capacity than the first route.

4. The method of claim 1 wherein the second route would deliver the message faster than the first route.

AMENDED CLAIMS

[received by the International Bureau on 21 March 2000 (21 03 00), original claim 1 amended, remaining claims unchanged (1 page)]

What is claimed is

A method of routing comprising prov iding a source network coupled to a destination network b\ a pluralitv of routes, wherein a first route ot the pluralitv ot routes comprises a pri ate peer connection between the source network and the destination netw ork and a second route of the pluralitv of routes comprises a network other than the source network or the destination network. determining that the private peer connection exists. an outbound gate vav selecting a route trom the source network to the destination network bv choosing the route comprising the priv ate peer connection without taking into consideration relativ e deli er, times betw een the first and second routes. sending a message v ia the selected route

The method of claim 1 w herein nct v oik lav ei routing tables assign a h hu ost to the first route than to the second route

The method of claim 1 wherein the second route has a higher capacitv than the first route

The method of claim 1 wherein the second route would deliv er the message taster than the first route