18665159. Virtual Channel Balancing In Ring-Based Topologies simplified abstract (Google LLC)

From WikiPatents
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 18665159 titled 'Virtual Channel Balancing In Ring-Based Topologies

Simplified Explanation: The patent application describes a system and method for routing data packets in a ring network, where the number of hops a packet takes to reach its destination is optimized.

Key Features and Innovation:

  • Data packets are received by a first structure at a node, which then determines the number of hops needed to reach the destination.
  • The system compares the number of hops to a threshold value to decide whether to transmit the packet to a specific queuing structure within a node.
  • This method optimizes the routing of data packets in a ring network, improving efficiency and reducing latency.

Potential Applications: This technology can be applied in telecommunications networks, data centers, and other systems where efficient data packet routing is crucial.

Problems Solved: The system addresses the challenge of optimizing data packet routing in a ring network to improve overall network performance.

Benefits:

  • Reduced latency in data packet transmission.
  • Improved efficiency in routing data packets.
  • Enhanced network performance and reliability.

Commercial Applications: Optimizing data packet routing in telecommunications networks can lead to faster and more reliable communication services, benefiting both service providers and end-users.

Prior Art: Researchers can explore prior art related to data packet routing algorithms in ring networks to understand the evolution of this technology.

Frequently Updated Research: Stay updated on advancements in data packet routing algorithms and network optimization techniques to enhance the performance of ring networks.

Questions about Data Packet Routing in Ring Networks: 1. How does the system determine the number of hops a data packet will take in the network? 2. What are the potential challenges in implementing this routing method in large-scale networks?


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.