Media.Player

Tree-Based Ordered Multicasting in Computer Networks

Technology Benefits

Improved resiliency, scalability, and efficiency of concurrent transmissions Allows for the integrated provision of reliability and ordering in the same topology and delivery process in contrast to other solutions that perform ordering in a separate delivery phase Permits ordered concurrent transmissions from rapidly changing sources on the same tree unlike other methods that are only suitable for single-source long-lived transmissions Supports ordered delivery to anonymous hosts and overlapping receiver groups in shared trees

Technology Application

Internet networks, especially for situations that require reliability and ordering of message transmissions

Detailed Technology Description

Scientists at the University of California, Santa Cruz have developed a novel solution for message ordering services integrated with a tree-based, concurrent, reliable multicast. In this system, ordering is performed on a tree, as opposed to a ring, which has been presented in previous reliable multicast protocols. An advantage to the tree configuration is that it supports ordering of messages from rapidly changing sources for overlapping receiver groups and anonymous hosts.

Application No.

7031308

Others

Additional Technologies by these Inventors

• Scalable Integrated Services Architecture for Computer Networks
• Scalable Multicast Routing Protocol for Wireless and Mobile Computer Networks
• Receiver Initiated Channel Hopping (RICH)
• Bandwidth Efficient Source Tracing (Best) for Wireless Networks
• On-Demand Loop-Free Multipath Routing
• Differentiating Congestion Vs. Random Loss: A Method For Improving TCP Performance Over Wireless Links
• Improving TCP Congestion Control over Networks with Heterogeneous Transmission Media
• Mpath: A Loop-Free Multipath Routing Algorithm
• Receiver Initiated Multiple Access for Ad Hoc Networks
• Group Coordination Protocol for Networked Multimedia Systems
• System and Method for Ad Hoc Network Access Employing the Distributed Election of a Shared Transmission Schedule
• HIDRA: Method for Hiding Mobility, Multiplexing, and Multi-Homing from Internet Applications

Tech ID/UC Case

10197/2000-384-0

Related Cases

2000-384-0

*Abstract

Multicast communication generalizes the unicast (information sent from one point to another point) and broadcast (information sent from one point to all points) communication models in computer networks to multipoint dissemination of messages. A source only needs to send packets once to the network interface to then be transparently replicated on their transmission paths to the receivers. This method is necessary  for high-volume data transfer applications such as distributed software updates, newscasts, on-demand video, and telecollaboration systems. However, when the multicasting concept is adapted and deployed with IP multicast protocols in the internet, those systems cannot provide reliable or order-preserving delivery of packets to a multicast group. As a result, there is no guarantee that all of the packets sent from a source to a group of receiving hosts are disseminated without error or that the consistency and coherence of the data has been preserved, which calls for a more reliable multicast system. 

*IP Issue Date

Apr 18, 2006

*Principal Investigator

Name: Hans Peter Dommel

Department:

Name: Jose Joaquin(JJ Garcia-Luna-Aceves

Department:

Country/Region

USA