IP Library Granted Patent US 7,031,308
Granted Patent B2
US 7,031,308 · App. 10/035,348 · Granted Apr 18, 2006

Tree-based ordered multicasting method

Assignee: The Regents of the University of California
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,031,308
App. No.
10/035,348
Granted
Apr 18, 2006
Kind
B2
Abstract

A method for performing end-to-end “tree-based ordered multicasting” (TOM) which ensures collective integrity and consistency of distributed operations, and which is applicable to distributed multiparty collaboration and other multipoint applications. The TOM protocol performs cascaded total ordering of messages among on-tree hosts en route from senders to receivers, and does not require the building of a separate propagation graph to compute ordering information. TOM elects sequencer nodes dynamically based on address extensions of the multicast tree. Message ordering is performed by multicasting a message from each source node to receivers, unicasting a control message from a source node across a primary node to an ordering node for the designated multicast group or transmission in the tree, determining a binding sequence number for the message and a multicast to the receiver group, and delivering messages at end hosts according to the agreed-upon sequence numbers.

Claims (35)

1. A concurrent, multicast communication method for transmitting data packets over a network of interconnected nodes, comprising:

multicasting a message from a source node to a receiver group;

unicasting a control message from a source node across a primary node to an ordering node for a designated multicast group or transmission, wherein said primary node aggregates messages from their subtrees and hence staggers the ordering process upward within the tree;

determining a binding sequence number for this message and a multicast to the receiver group; and

delivering messages at end hosts according to agreed-upon sequence numbers.

2. A method as recited in claim 1 :

wherein said messages are delivered in an order agreed-upon by all hosts.

3. A method as recited in claim 1 :

wherein each node i in an acknowledgment-free is labeled with a unique label l(i), which is the prefix of all children of i.

4. A method as recited in claim 1 :

wherein, for each set of messages destined to a particular multicast group, or set of hosts, an ordering node is elected by virtue of being the node having label that is the longest common prefix among all node labels in the receiver set.

5. A method as recited in claim 4 :

wherein each ordering node gathers sequence number bids set en route by primary nodes deciding on a globally valid number, and multicasts the respective message to the receiver set with a final and binding sequence number directive.

6. A concurrent, multicast communication method for transmitting data packets over a network of interconnected nodes, comprising:

multicasting a message from a source node to a receiver group;

unicasting a control message from a source node across a primary node to an ordering node for a designated multicast group or transmission, wherein said primary node aggregates messages from their subtrees and hence staggers the ordering process upward within the tree;

determining a binding sequence number for this message and a multicast to the receiver group; and

delivering messages at end hosts according to agreed-upon sequence numbers;

wherein said messages are delivered in an order agreed-upon by all hosts.

7. A method as recited in claim 6 :

wherein each node i in an acknowledgment-tree is labeled with a unique label l(i), which is the prefix of all children of i.

8. A method as recited in claim 6 :

wherein, for each set of messages destined to a particular multicast group, or set of hosts, an ordering node is elected by virtue of being the node having label that is the longest common prefix among all node labels in the receiver set.

9. A method as recited in claim 8 :

wherein each ordering node gathers sequence number bids set en route by primary nodes deciding on a globally valid number, and multicasts the respective message to the receiver set with a final and binding sequence number directive.

10. A method as recited in claim 8 :

wherein each node i in an acknowledgment-tree is labeled with a unique label 1 (i), which is the prefix of all children of i.

11. A concurrent, multicast communication method for transmitting data packets over a network of interconnected nodes, comprising:

multicasting a message from a source node to a receiver group;

unicasting a control message from a source node across a primary node to an ordering node for a designated multicast group or transmission, wherein said primary node aggregates messages from their subtrees and hence staggers the ordering process upward within the tree;

determining a binding sequence number for this message and a multicast to the receiver group;

delivering messages at end hosts according to agreed-upon sequence numbers;

wherein said messages are delivered in an order agreed-upon by all hosts;

wherein, for each set of messages destined to a particular multicast group, or set of hosts, an ordering node is elected by virtue of being the node having label that is the longest common prefix among all node labels in the receiver set; and

wherein each ordering node gathers sequence number bids set en route by primary nodes deciding on a globally valid number, and multicasts the respective message to the receiver set with a final and binding sequence number directive.

Assignments (2)
CONFIRMATORY LICENSE Recorded Aug 21, 2002
From: CALIFORNIA, UNIVERSITY OF
To: AIR FORCE, UNITED STATES
Reel/Frame 013226/0516 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 29, 2002
From: GARCIA-LUNA-ACEVES, JOSE JOAQUIN; DOMMEL, HANS-PETER
To: REGENTS OF THE UNIVERSITY OF CALIFORNIA, THE
Reel/Frame 012744/0489 →
Continuity (2)
Provisional Application 6024440500 · Oct 30, 2000
Related Publication 20020091846A1 · Jul 11, 2002