Method and apparatus for providing forwarding and replication services on a dynamically addressed network

• US 20020028656A1
• Filed: 02/01/2001
• Published: 03/07/2002
• Est. Priority Date: 02/02/2000
• Status: Abandoned Application

• Current Assignee: Trustees Of Columbia University In The City Of New York (Columbia University)
• Original Assignee: Trustees Of Columbia University In The City Of New York (Columbia University)
• Inventors: Yemini, Yechiam, Florissi, Danilo, Grossberg, Michael D.
• Application Number:
  US09/775,349
• Publication Number:
  US 20020028656A1
• Time in Patent Office: Days
• US Class Current: 455/41.2
• CPC Class Codes: H04L 41/5003 Managing SLA; Interaction between SLA and QoS
• CPC Class Codes: H04L 41/5009 Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
• CPC Class Codes: H04L 41/5019 Ensuring fulfilment of SLA
• CPC Class Codes: H04L 41/5022 by giving priorities, e.g. assigning classes of service
• CPC Class Codes: H04L 41/5029 Service quality level-based billing, e.g. dependent on measured service level customer is charged more or less
• CPC Class Codes: H04L 41/5041 characterised by the time relationship between creation and deployment of a service
• CPC Class Codes: H04L 41/509 wherein the managed service relates to media content delivery, e.g. audio, video or TV
• CPC Class Codes: H04L 43/0852 Delays
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/126 minimising geographical or physical path length
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• CPC Class Codes: H04L 45/507 Label distribution
• CPC Class Codes: H04L 45/62 Wavelength based optical switching H04Q11/0062
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/50 : Address allocation

Abstract

DART dynamically assigns addresses to Nodes according to their relative location within the network. When a Node joins or moves the network, or a Link or Node fails addresses are dynamically updated. If some Nodes are mobile (either clients or servers) the ability to route to and from the mobile Node persists. Link failures, caused by movement, or otherwise, can be similarly accommodated.

Claims

1. A network comprising a plurality of Nodes interconnected by Links, wherein:

(a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;

(b) each coordinate label is unique to the Node to which it is assigned;

(c) a path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node; and

(d) a pair of said Nodes that are connected by said Links stores the set of one or more coordinate labels corresponding to the other Node of said pair of Nodes.

2. The network of claim 1 wherein each Node of said pair of Nodes reroutes any data intended for the other Node of said pair of Nodes in the event said other Node of said pair of Nodes moves or fails.

3. A network comprising a plurality of Nodes interconnected by Links, wherein:

(a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;

(b) each coordinate label is unique to the Node to which it is assigned;

(c) a path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node; and

(d) at least one of said plurality of Nodes is automatically replicated to create at least one mirror Node.

4. The network of claim 3 where said at least one mirror Node is mobile.

5. The network of claim 3 where said replicated Node is mobile.

6. The network of claim 3 where said replicated Node is a part of the World Wide Web.

7. The method of claim 3 wherein a packet is routed to a closest Node of said plurality of mirror Nodes.

8. A network comprising a plurality of Nodes interconnected by Links, wherein:

(a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;

(b) each coordinate label is unique to the Node to which it is assigned;

(c) a path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node; and

(d) at least one of said plurality of Nodes automatically creates at least one cache and redirects a data request to said at least one cache.

9. The network of claim 8 where said at least one cache is mobile.

10. The network of claim 8 where said at least one cache contains a load from a mobile Node.

11. A network comprising a plurality of Nodes interconnected by Links, wherein:

(a) each Node is assigned a set of one or more coordinate labels, each representing a path comprising one or more Links or other Nodes;

(b) each coordinate label is unique to the Node to which it is assigned;

(c) a path between a first Node and a second Node being determined from one of said coordinate labels associated with said first Node and one of said coordinate labels associated with said second Node; and

(d) at least one of said plurality of Nodes is a mobile Node.

12. The network of claim 11 where said mobile Node is a PDA.

13. The network of claim 11 where said mobile Node is a cellular telephone.

14. The network of claim 11 where said mobile Node is a laptop computer.

15. The network of claim 11 where said mobile Node is a router located on a vehicle.

17. The method of claim 16 wherein at said one second Node, rerouting data intended for said second Node adjacent to said one second Node in the event said second Node adjacent to said one second Node Nodes moves or fails.

19. The Node of claim 18 wherein said Node reroutes any data intended for said adjacent Node in the event said adjacent Node is moved to a different location.

20. The Node of claim 18 wherein said Node reroutes any data intended for said adjacent Node in the event said adjacent Node is unable to receive said packet.

16. A method for determining a path from a source Node to a destination Node in a network comprising a plurality of Nodes interconnected by Links, said Nodes including a first Node, and a plurality of second Nodes, said second Nodes including said source Node and destination Node, said method comprising the steps of:

(a) assigning to each of said second Nodes, including said source Node and said destination Node, one or more coordinate labels, each coordinate label assigned to a second Node representing a path through said network from said second Node to said first Node;

(b) determining a path from said source Node to said destination Node by combining one coordinate label of said source Node and one coordinate label of said destination Node; and

(c) at one of said second Nodes, storing one or more coordinate labels of a second Node adjacent to said one second Node.

18. A Node for use in a network, said network comprising a plurality of Nodes connected by Links, wherein:

(a) said Node for use in said network has one or more coordinate labels assigned thereto, each coordinate label representing a path from said Node to a particular other Node of said network, each of said coordinate labels being unique to said Node; and

(b) said Node stores one or more coordinate labels corresponding to an adjacent Node.