Patent Grant
7639692
The present invention relates to a method for resolving hardware addresses into network addresses, which method comprising the steps of:
Such a method is known from the art and is described in the Request For Comments (RFC) 2390 entitled “Inverse Address Resolution Protocol”, published by the Internet Engineering Task Force (IETF) in September 1998.
RFC 2390 discloses a method that allows a sender device (or host or station) to request a network address (or protocol address or logical address) corresponding to a given hardware address (or physical address), and more specifically a method that allows a frame relay sender device to discover the network address of a target device associated with a frame relay Virtual Circuit (VC), being a Permanent Virtual Circuit (PVC) or a Switched Virtual Circuit (SVC), which virtual circuit being identified by a Data Link Connection Identifier (DLCI) that has local significance only, and that can be thought as the frame relay equivalent to a hardware address.
This method is referred to as Inverse Address Resolution Protocol (InARP), and allows discovery of adjacent node's network addresses.
InARP packets are typically encapsulated by means of an encapsulation method associated with the native data plane conveying the InARP packets. For example, InARP packets are encapsulated into frame relay frames using Network Level Protocol Identity (NLPID) and Sub Network Access Protocol (SNAP) encapsulation method.
It is an object of the present invention to provide a more efficient method for conveying InARP packets between the source node and the end node.
According to the invention, this object is achieved due to the fact that said method further comprises the steps of:
Instead of forwarding InARP requests in-band, that is to say by means of the data path established between the source node and the end node, InARP requests are sent through the control address space that is used for controlling the operation of the network.
A path identifier that has been used as a common reference during path establishment, and that has network-wide significance, is encoded into the request, which path identifier being further used at the end node for identifying a particular data path that terminates at that end node, and for returning a data network address associated with that data path.
An example of signaling protocol is Resource reSerVation Protocol—Traffic Engineering (RSVP-TE), which signaling protocol being used interalia for establishing a Label Switch Path (LSP) through a Generalized Multi Protocol Label Switching (GMPLS) based network.
A method according to the invention is advantageous in that a unified inverse address resolution scheme can be used over various underlying data link layers, without the need for customized encapsulation methods and corresponding encoding/decoding means.
A further embodiment of a method according to the invention is characterized in that said particular control network address is a control network address of an intermediate network node along said data path,
and in that said method further comprises the steps of, at said intermediate network node, deriving from said common path identifier a further control network address of a further next hop along said data path, and forwarding said request to said further next hop with as destination network address said further control network address.
In this embodiment, the InARP request is sent from the source node to an intermediate network node along the data path, and typically to the intermediate network node with which an adjacency has been set up in the control plane for establishing the data path.
The InARP request may also be sent to a further network node along the data path, provided its control network address is known at the source node.
At any intermediate node along the data path, processing of an InARP request consists in looking at the path identifier, and in using that path identifier to derive the network address of a next hop (or next intermediate network node) further along the data path whereto forward the InARP request. In RSVP-TE for example, this address corresponds to the so-called N-HOP address.
The same mechanism may apply in reverse direction for returning InARP responses.
This embodiment is advantageous in that it relies upon path state information maintained at each and every intermediate network node, which state information being used for retrieving the network address of a further network node whereto forward the InARP packets for them to reach their destination, namely the end node for InARP requests and the source node for InARP responses.
Another embodiment of a method according to the invention is characterized in that said particular control network address is a control network address of said end node.
In this alternative embodiment, the request is directly sent to the end node, provided its control network address is known at the source node. In RSVP-TE for example, this address corresponds to the so called tunnel end point address.
In this embodiment, the request may follow a route that is different from the route the data path follows.
Still another embodiment of a method according to the invention is characterized in that said request is encapsulated over a common network layer used throughout said data communication network.
The network layer is for instance an Internet Protocol (IP) layer.
This embodiment is further advantageous in that a common encapsulation method can be used irrespective of the signaling protocol suite being used, and irrespective of the type of data path being established.
The present invention also relates to a network node adapted to exchange signaling messages with further network nodes for establishing a data path through a data communication network, which signaling exchanges relying upon control network addresses for addressing said network node and said further network nodes through said data communication network, and comprising a communication unit adapted to receive a request originating from a source node whereby a particular hardware address associated with said data path is to be resolved into a network address.
A network node according to the invention is characterized in that said communication unit is further adapted to receive said request with as destination network address a particular control network address of said network node, and in that said network node further comprises a resolution unit coupled to said communication unit, and adapted to identify said data path from a common path identifier, which common path identifier being encoded by said source node into said request, to determine whether said data path terminates at said network node, and if so, to return to said source node a particular data network address associated with said data path.
A further embodiment of a network node according to the invention is characterized in that, in the event of said data path not terminating at said network node, said resolution unit is further adapted to derive from said common path identifier a further control network address of a further next hop along said data path,
and in that said communication unit is further adapted to forward said request to said further next hop with as destination network address said further control network address.
It is to be noticed that the term ‘comprising’, also used in the claims, should not be interpreted as being restricted to the means listed thereafter. Thus, the scope of the expression ‘a device comprising means A and B’ should not be limited to devices consisting only of components A and B. It means that with respect to the present invention, the relevant components of the device are A and B.
Similarly, it is to be noticed that the term ‘coupled’, also used in the claims, should not be interpreted as being restricted to direct connections only. Thus, the scope of the expression ‘a device A coupled to a device B’ should not be limited to devices or systems wherein an output of device A is directly connected to an input of device B, and/or vice-versa. It means that there exists a path between an output of A and an input of B, and/or vice-versa, which may be a path including other devices or means.
The above and other objects and features of the invention will become more apparent and the invention itself will be best understood by referring to the following description of an embodiment taken in conjunction with the accompanying drawings wherein:
There is seen in
The network nodes 11 to 16 may operate in any of the following switching domains:
A path 21 is established through the network 1 between the network node 11, further referred to as the source node, and the network node 16, further referred to as the end node, via the intermediate network nodes 12 to 15.
Examples of data paths established through a data communication network are:
In a preferred embodiment of the present invention, the network nodes 11 to 16 establish the path 21 by exchanging RSVP-TE signaling messages. The path 21 may traverse further intermediate network nodes (not shown) that are not involved in signaling exchanges.
An hardware address uniquely identifies a physical interface coupled to a network, or an aggregation of more than one such physical interfaces. Hardware addresses have local significance only and are substituted for while packets are traveling over the network. An hardware address may also identifies a virtual interface that is logically defined over one or more physical interfaces.
Examples of hardware addresses are:
A network address identifies a particular recipient of some network traffic, and has network-wide significance so as traffic can travel through the network towards a particular destination.
In a preferred embodiment of the present invention, the network addresses are IP addresses.
For a better insight of the invention, network addresses are further split into data network addresses and control network addresses.
Data network addresses are used for conveying network traffic (or payload traffic), as opposed to control network addresses that are used for operating the network, such as establishing a path, releasing a path, exchanging further path information, etc.
For operating a network, a node establishes control adjacencies with one or more network nodes, which control adjacencies making use of the aforementioned control network addresses for exchanging signaling messages (or control traffic).
Purposely, the network nodes 11 to 16 are assigned the control IP addresses IPC@1 to IPC@6 respectively.
There is seen in
The switching unit 121 is coupled to the physical ports 111 to 117, and to the communication unit 122. The resolution unit 123 is coupled to the communication unit 122 and to the local repository 124.
The physical ports 111 to 117 are adapted to receive and transmit physical signals, being an electrical signal, an optical signal, or a radio electro-magnetic signal.
The switching unit 121 is adapted to switch a signal (e.g., a wavelength), or a unit of data conveyed thereby (e.g., an IP packet, an MPLS packet, an ATM cell, a SDH container), from any ingress port towards any egress port. Switching is driven by a forwarding, routing, binding or cross-connect table.
The switching unit 121 is further adapted to switch IP packets towards the appropriate destinations. A destination IP address is decoded from an incoming IP packet, and the closest match is looked for in a routing table (not shown) to find out the particular (physical or logical) interface whereto forward that packet.
The network node 101 is assigned the control network address IPC@x, and as such IP packets bound to that IP address are routed towards an internal port, whereat they are further segregated and dispatched towards the appropriate applications.
In a preferred embodiment of the present invention, InARP packets are encapsulated over IP, and are distinguishable by means of a particular protocol value in the IP header.
The communication unit 122 is the recipient of IP packets bound to the network address IPC@x (see DA=IPC@x in
In a preferred embodiment of the present invention, the common path identifier is assumed to be the combination of the following information elements:
Please refer to RFC 3209, Awduche et al., December 2001, chapter 4.6., for further information about the exact meaning of those information elements and their encoding into RSVP message.
Any other logical identifier(s) that unambiguously identifies a particular LSP, and that has network-wide significance, could be used as well.
The local repository 124 holds path state information for each and every configured LSP, which path state information comprising the following information elements:
The resolution unit 123 is adapted to determine whether the network node 101 is the end node for a particular LSP by comparing the IPv4/v6 TUNNEL END POINT ADDRESS with its own control network address(es), presently by checking whether IPv4/v6 TUNNEL END POINT ADDRESS matches IPC@x value. A special flag indicating the outcome of this check is further held in the local repository 124 along each corresponding path entry.
An operation of the network node 101 follows.
2 LSPs are assumed to be established that involve the network node 101. A first LSP LSP1 traverse the network node 101 and terminates at a further network node, while a second LSP LSP2 terminates at the network node 101. The LSP LSP1 is identified by means of a first path identifier Path_Id1, while the LSP LSP2 is identified by means of a second path identifier Path_Id2.
The path identifiers Path_Id1 and Path_Id2 includes the aforementioned information elements.
A first InARP request InARP_Req1, which is bound to the destination address IPC@x, and includes Path_Id1 as path identifier, is received by the network node 101, and passed by the switching unit 121 to the communication 122.
The communication unit 122 decodes a path identifier from the InARP_req1, presently Path_Id1, and forwards the path identifier Path_Id1 to the resolution unit 123.
The resolution unit 123 interrogates the path state database in the local repository 124 with the path identifier Path_Id1, and determines whether the LSP identified by Path_Id1, presently LSP1, terminates at the node 101 by checking the corresponding flag.
Presently, the path LSP1 does not terminate at the node 101. Consequently, the resolution unit 123 reads the next hop address associated with the path identifier Path_Id1, presently IPC@y, and returns this piece of information to the communication unit 122.
The communication unit 122 encodes the control network address IPC@y as the destination IP address of the InARP request InARP_req1 (see DA=IPC@y in
A second InARP request InARP_Req2, which is bound to the destination address IPC@x, and includes Path_Id2 as path identifier, is received by the network node 101, and passed by the switching unit 121 to the communication 122.
The communication unit 122 decodes a path identifier from the InARP_req2, presently Path_Id2, and forwards the path identifier Path_Id2 to the resolution unit 123.
The resolution unit 123 interrogates the path state database in the local repository 124 with the path identifier Path_Id2, and determines whether the LSP identified by Path_Id2, presently LSP2, terminates at the node 101 by checking the corresponding flag.
Presently, the path LSP2 does terminate at the node 101. Consequently, the resolution unit 123 determines the data network address associated with the LSP identified by Path_Id1, presently IPD@z, and returns this piece of information to the communication unit 122.
The communication unit 122 encodes an InARP response InARP_res with as target network address the data network address IPD@z as (see TA=IPD@z in
It is to be noticed that control and data traffic may be handled by distinct switching units, and/or may go through distinct physical ports.
A further operation of the data communication system of
The source node 11 wants to resolve a particular hardware address associated with the path 21, the identifier of which is Path_Id, into a data network address, e.g. for establishing a Borger Gateway Protocol (BGP) peering relationship with another BGP speaker.
The source node encodes an InARP request InARP_req with as hardware address to resolve that particular hardware address, as common path identifier Path_Id, and as IP destination address the next hop address as retrieved from the path state database, presently IPC@2. The InARP request InARP_req is then send through the network 1 towards the network node 12 (see leftmost dashed arrow in
The network node 12 checks whether the path identified by Path_Id terminates at that node, which presently is not the case, then encodes the next hop's address as retrieved from its path stat database, presently IPC@3, as destination IP address of the InARP request InARP_req, and forwards the so-modified InARP_req to this next hop, which request thereby reaching the end node 16 (see further dashed arrows in
The end node 16 checks whether the path identified by Path_Id terminates at that node, which presently is the case, and encodes an InARP response with a particular data network address as target network address associated with the particular hardware address. The InARP response is either send to the previous hop, presently the network node 15, or directly to the source node 11 by reading its network address from the path state database.
There is seen in
Again, the InARP response is either send to the previous hop, presently the network node 15, or directly to the source node 11.
In still an alternative embodiment of the present invention, InARP packets are encapsulated over User Datagram Protocol (UDP), and are distinguishable by means of a particular UDP port number.
A final remark is that embodiments of the present invention are described above in terms of functional blocks. From the functional description of these blocks, given above, it will be apparent for a person skilled in the art of designing electronic devices how embodiments of these blocks can be manufactured with well-known electronic components. A detailed architecture of the contents of the functional blocks hence is not given.
While the principles of the invention have been described above in connection with specific apparatus, it is to be clearly understood that this description is made only by way of example and not as a limitation on the scope of the invention, as defined in the appended claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 05292084 | Oct 2005 | EP | regional |
| Number | Name | Date | Kind |
|---|---|---|---|
| 6189041 | Cox et al. | Feb 2001 | B1 |
| 6898200 | Luciani | May 2005 | B1 |
| 6925080 | Denecheau et al. | Aug 2005 | B2 |
| 7009983 | Mancour | Mar 2006 | B2 |
| 7039687 | Jamieson et al. | May 2006 | B1 |
| 20030088699 | Luciani et al. | May 2003 | A1 |
| 20040085997 | Mancour | May 2004 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20070076725 A1 | Apr 2007 | US |
