Google llc (20240137308). Virtual Channel Balancing In Ring-Based Topologies simplified abstract

From WikiPatents
Revision as of 04:24, 26 April 2024 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Virtual Channel Balancing In Ring-Based Topologies

Organization Name

google llc

Inventor(s)

Brian Patrick Towles of Chapel Hill NC (US)

Hojat Parta of Los Angeles CA (US)

Virtual Channel Balancing In Ring-Based Topologies - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240137308 titled 'Virtual Channel Balancing In Ring-Based Topologies

Simplified Explanation

The patent application describes systems and methods for routing data packets in a ring network. Here are some key points to explain the innovation:

  • Data packets are transmitted to a destination node and may be received by a first structure at a first node.
  • The first node determines the number of hops the data packet will traverse to reach the destination node.
  • If the number of hops is greater than a threshold value, the data packet is transmitted to a dimension queuing structure for a first virtual channel within a second node.
  • If the number of hops is equal to or less than the threshold value, the data packet is transmitted to a dimension queuing structure for a second virtual channel or a turn queuing structure within the second node.
      1. Potential Applications

- This technology can be applied in telecommunications networks to efficiently route data packets in a ring network. - It can also be used in industrial automation systems for real-time data transmission.

      1. Problems Solved

- Efficient routing of data packets in a ring network. - Minimizing latency and optimizing network performance.

      1. Benefits

- Improved network efficiency and performance. - Reduced data packet transmission delays. - Enhanced reliability of data packet routing.

      1. Potential Commercial Applications
        1. Optimizing Data Packet Routing in Ring Networks
      1. Possible Prior Art

There may be prior art related to routing algorithms in network systems that optimize data packet transmission paths.

      1. Unanswered Questions
        1. How does this technology compare to existing routing algorithms in terms of efficiency and performance?

This article does not provide a direct comparison with existing routing algorithms.

        1. Are there any limitations or constraints to implementing this technology in different network configurations?

The article does not address potential limitations or constraints in implementing this technology in various network setups.


Original Abstract Submitted

systems and method for routing data packets in ring network. a data packet being transmitted to a destination node may be received by a first structure at a first node. the first node may determine a number of hops the data packet will traverse as it is transmitted from the first node to the destination node and compare the determined number of hops to a threshold hop value to determine whether the number of hops is equal to or less than the threshold hop value. if the number of hops is greater than the threshold, the data packet may be transmitted to a dimension queuing structure for a first virtual channel within a second node, otherwise, the data packet may be transmitted to a dimension queuing structure for a second virtual channel or a turn queuing structure within the second node.