17957860. PATH ROUTING IN A MOBILE NETWORK simplified abstract (AT&T Intellectual Property I, L.P.)

From WikiPatents
Jump to navigation Jump to search

PATH ROUTING IN A MOBILE NETWORK

Organization Name

AT&T Intellectual Property I, L.P.

Inventor(s)

John B. Bartell of Milton GA (US)

Zhi Cui of Sugar Hill GA (US)

PATH ROUTING IN A MOBILE NETWORK - A simplified explanation of the abstract

This abstract first appeared for US patent application 17957860 titled 'PATH ROUTING IN A MOBILE NETWORK

Simplified Explanation

The patent application abstract describes a method for selecting the most efficient path for data packets to travel between a source node and a destination node in a network based on latency information.

  • The method involves obtaining information about two different paths between the source and destination nodes, each with different numbers of intermediate nodes and travel latencies.
  • The system then selects the path with the lowest total travel latency to ensure the fastest delivery of data packets.
  • By comparing the latency information of the two paths, the system can make an informed decision on which path to choose for optimal packet delivery speed.

Potential Applications

This technology could be applied in:

  • Network routing optimization
  • Real-time data transmission systems
  • Internet of Things (IoT) networks

Problems Solved

  • Minimizing data packet delivery time
  • Optimizing network performance
  • Efficient resource allocation in networks

Benefits

  • Faster data transmission
  • Improved network efficiency
  • Enhanced user experience in data-intensive applications

Potential Commercial Applications

Optimizing Data Transmission Paths for Faster Delivery

Possible Prior Art

One possible prior art could be the use of load balancing algorithms in network routing to optimize data transmission paths.

Unanswered Questions

How does this method handle network congestion?

The abstract does not mention how the system deals with network congestion, which could impact the efficiency of data packet delivery.

What is the scalability of this method for large networks?

It is not clear from the abstract how well this method scales for networks with a high number of nodes and complex topologies.


Original Abstract Submitted

Aspects of the subject disclosure may include, for example: obtaining first information identifying a first path between a source node located in a network and a destination node located in the network, wherein the first path comprises a first plurality of nodes including at least one first intermediate node between the source node and the destination node, and wherein the first information comprises first latency information that identifies a first travel latency that exists on the first path between the source node and the destination node; obtaining second information identifying a second path between the source node and the destination node, wherein the second path comprises a second plurality of nodes including at least the source node and the destination node, and wherein the second information comprises second latency information that identifies a second travel latency that exists on the second path between the source node and the destination node; and selecting as a selected path either the first path or the second path, the selecting being based upon the first travel latency and the second travel latency, wherein the selecting is such that the selected path is capable of carrying a packet from the source node to the destination node in less time than the one of the first path or the second path that is not selected. Other embodiments are disclosed.