IP Library Granted Patent US 12,634,241
Granted Patent B2
US 12,634,241 · App. 18/107,324 · Granted May 19, 2026

System and method for using dynamic thresholds with route isolation for heterogeneous traffic in shared memory packet buffers

Inventors: Ari Aravinthan (Mountain View, CA); Mike Jorda (Mountain View, CA); Shimon Muller (Mountain View, CA); Shrijeet Mukherjee (Mountain View, CA); Jay Peterson (Mountain View, CA); Gurjeet Singh (Mountain View, CA); Abhishek Jaiswal (Mountain View, CA)
Assignee: Enfabrica Corporation
H04L47/29H04L47/24H04L47/32H04L49/9036
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 12,634,241
App. No.
18/107,324
Granted
May 19, 2026
Kind
B2
Abstract

A system and method for managing shared memory packet buffers is disclosed. In some embodiments, the system is configured to receive and classify a packet as one of: network-network, network-host, host-network, or host-host; select a minimum guarantee space for the packet according to the classification thereof; if the selected minimum guarantee space is available, store the packet therein; otherwise, if a dedicated shared space is available, store the packet therein; otherwise, if a global shared space is available, store the packet therein; and otherwise, drop the packet.

Claims (74)

1 . A method for managing a shared memory for packet traffic, the method comprising:

receiving and classifying a packet as one of: network-network, network-host, host-network, or host-host;

selecting a minimum guarantee space for the packet according to the classification thereof;

in response to the selected minimum guarantee space being available, storing the packet therein;

in response to the selected minimum guarantee space being unavailable and a dedicated shared space being available, storing the packet in the dedicated shared space;

in response to the selected minimum guarantee space and the dedicated shared space being unavailable and a global shared space being available, storing the packet in the global shared space; and

in response to the selected minimum guarantee space, the dedicated shared space, and the global shared space being unavailable, dropping the packet.

2 . A method for managing shared memory packet buffers, the method comprising:

receiving ingress traffic of a traffic type at a server fabric adapter (SFA) communicatively coupled to an ingress entity;

determining, by the SFA, whether a minimum guarantee space of a shared buffer has been allocated for the ingress traffic; and

in response to determining the minimum guarantee space has been allocated for the ingress traffic, forwarding packets of the ingress traffic to the shared buffer in a particular sequence of (1) the minimum guarantee space, (2) a dedicated shared space, and (3) a global shared space, wherein the dedicated shared space is part of the shared buffer allocated to the traffic type after the minimum guarantee space and a headroom have been allocated, and the global shared space is a portion of the shared buffer after the dedicated shared space has been allocated.

3 . The method of claim 2 , wherein:

the ingress entity is one of a host or network entity,

the ingress traffic is one of lossy or lossless traffic, and

the traffic type includes one of network ingress to network egress, network ingress to host egress, host ingress to network egress, and host ingress to host egress.

4 . The method of claim 2 , wherein:

the minimum guarantee space is configured to be available to network ingress traffic or host ingress traffic,

the dedicated shared space is configured to be available only to a particular traffic type, and

the global shared space is configured to be available to all traffic types.

5 . The method of claim 2 , wherein the ingress traffic is lossy traffic, the method further comprising:

in response to determining the minimum guarantee space has not been allocated for the ingress traffic, forwarding the packets of the ingress traffic to the shared buffer in a sequence of (1) the dedicated shared space of the shared buffer allocated to the traffic type and (2) the global shared space of the shared buffer.

6 . The method of claim 2 , wherein forwarding the packets of the ingress traffic to the shared buffer in the particular sequence comprises:

computing a threshold for the ingress entity based on the global shared space and dedicated shared space available to the ingress entity;

determining occupancy of the shared buffer at the ingress entity;

comparing the determined occupancy with the computed threshold; and

taking action to reduce the occupancy of the shared buffer when the determined occupancy exceeds the computed threshold.

7 . The method of claim 6 , wherein the action includes one of discarding packets of the ingress traffic or triggering priority flow control.

8 . The method of claim 7 , further comprising implementing hysteresis by continuing the action until the occupancy reaches a level lower than the threshold.

9 . The method of claim 2 , wherein forwarding the packets of the ingress traffic to the shared buffer in the particular sequence comprises:

determining whether the minimum guarantee space allocated for the ingress traffic is full, wherein the ingress traffic is a host ingress or network ingress;

in response to determining the minimum guarantee space is not full, incrementing a counter associated with the minimum guarantee space and moving at least a portion of the ingress traffic to the minimum guarantee space; and

in response to determining the minimum guarantee space is full, determining whether the dedicated shared space for the ingress traffic is full, wherein the dedicated shared space is allocated based on the traffic type of the ingress traffic;

in response to determining the dedicated shared space is not full, incrementing a counter associated with the dedicated shared space and moving at least a portion of the ingress traffic to the dedicated shared space; and

in response to determining the dedicated shared space is full, incrementing a counter associated with the global shared space and moving at least a portion of the ingress traffic to the global shared space.

10 . The method of claim 2 , wherein the minimum guarantee space, the dedicated shared space, and the global shared space are carved out of the shared buffer through configuration.

11 . The method of claim 2 , further comprising:

receiving egress traffic of the traffic type at a second server fabric adapter (SFA) communicatively coupled to an egress entity, the egress traffic including the packets of the ingress traffic stored in the shared buffer;

determining, by the second SFA, whether the egress traffic occupies the global shared space of the shared buffer;

in response to determining the egress traffic occupies the global shared space, retrieving the egress traffic from the shared buffer in a particular sequence of (1) the global shared space, (2) the dedicated shared space of the shared buffer allocated to the traffic type, and (3) a minimum guarantee space allocated to the egress traffic; and

sending the retrieved traffic to the egress entity.

12 . A system for managing shared memory packet buffers, the system comprising:

a server fabric adapter (SFA) communicatively coupled to an ingress entity, the SFA configured to:

receive ingress traffic of a traffic type;

determine whether a minimum guarantee space of a shared buffer has been allocated for the ingress traffic; and

in response to determining the minimum guarantee space has been allocated for the ingress traffic, forward packets of the ingress traffic to the shared buffer in a particular sequence of (1) the minimum guarantee space, (2) a dedicated shared space, and (3) a global shared space, wherein the dedicated shared space is part of the shared buffer allocated to the traffic type after the minimum guarantee space and a headroom have been allocated, and the global shared space is a portion of the shared buffer after the dedicated shared space has been allocated.

13 . The system of claim 12 , wherein:

the ingress entity is one of a host or network entity,

the ingress traffic is one of lossy or lossless traffic, and

the traffic type includes one of network ingress to network egress, network ingress to host egress, host ingress to network egress, and host ingress to host egress.

14 . The system of claim 12 , wherein:

the minimum guarantee space is configured to be available to network ingress traffic or host ingress traffic,

the dedicated shared space is configured to be available only to a particular traffic type, and

the global shared space is configured to be available to all traffic types.

15 . The system of claim 12 , wherein the ingress traffic is lossy traffic, and the SFA is further configured to:

in response to determining the minimum guarantee space has not been allocated for the ingress traffic, forward the packets of the ingress traffic to the shared buffer in a sequence of (1) the dedicated shared space of the shared buffer allocated to the traffic type and (2) the global shared space of the shared buffer.

16 . The system of claim 12 , wherein to forward the packets of the ingress traffic to the shared buffer in the particular sequence, the SFA is further configured to:

compute a threshold for the ingress entity based on the global shared space and dedicated shared space available to the ingress entity;

determine occupancy of the shared buffer at the ingress entity;

compare the determined occupancy with the computed threshold; and

take action to reduce the occupancy of the shared buffer when the determined occupancy exceeds the computed threshold.

17 . The system of claim 16 , wherein the action includes one of discarding packets of the ingress traffic or triggering priority flow control.

18 . The system of claim 17 , wherein the SFA is further configured to implement hysteresis by continuing the action until the occupancy reaches a level lower than the threshold.

19 . The system of claim 12 , wherein to forward the packets of the ingress traffic to the shared buffer in the particular sequence, the SFA is further configured to:

determine whether the minimum guarantee space allocated for the ingress traffic is full, wherein the ingress traffic is a host ingress or network ingress;

in response to determining the minimum guarantee space is not full, increment a counter associated with the minimum guarantee space and move at least a portion of the ingress traffic to the minimum guarantee space; and

in response to determining the minimum guarantee space is full, determine whether the dedicated shared space for the ingress traffic is full, wherein the dedicated shared space is allocated based on the traffic type of the ingress traffic;

in response to determining the dedicated shared space is not full, increment a counter associated with the dedicated shared space and move at least a portion of the ingress traffic to the dedicated shared space; and

in response to determining the dedicated shared space is full, increment a counter associated with the global shared space and move at least a portion of the ingress traffic to the global shared space.

20 . The system of claim 12 , further comprising:

a second SFA communicatively coupled to an egress entity, the second SFA configured to:

receive egress traffic of the traffic type, the egress traffic including the packets of the ingress traffic stored in the shared buffer;

determine whether the egress traffic occupies the global shared space of the shared buffer;

in response to determining the egress traffic occupies the global shared space, retrieve the egress traffic from the shared buffer in a particular sequence of (1) the global shared space, (2) the dedicated shared space of the shared buffer allocated to the traffic type, and (3) a minimum guarantee space allocated to the egress traffic; and

send the retrieved traffic to the egress entity.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 30, 2025
From: ARAVINTHAN, ARI; JORDA, MIKE; MULLER, SHIMON; MUKHERJEE, SHRIJEET; PETERSON, JAY; SINGH, GURJEET; JAISWAL, ABHISHEK
To: ENFABRICA CORPORATION
Reel/Frame 072421/0879 →
Continuity (2)
Provisional Application 63307952 · Feb 8, 2022
Related Publication 20230254259A1 · Aug 10, 2023
References Cited (220)
US 6034945A · Hughes · 2000 [cited by examiner]
US 6092115A · Choudhury · 2000 [cited by examiner]
US 6594712B1 · Pettey et al. · 2003 [cited by applicant]
US 6667974B1 · Shigeta · 2003 [cited by applicant]
US 7181541B1 · Burton et al. · 2007 [cited by applicant]
US 7191225B1 · Borthakur · 2007 [cited by examiner]
US 7245586B2 · Bitar · 2007 [cited by examiner]
US 7293129B2 · Johnsen et al. · 2007 [cited by applicant]
US 7697422B1 · Arad · 2010 [cited by examiner]
US 7937447B1 · Cohen et al. · 2011 [cited by applicant]
US 8234407B2 · Sugumar · 2012 [cited by examiner]
US 8301717B2 · Deshpande · 2012 [cited by applicant]
US 8719456B2 · Wilkinson · 2014 [cited by applicant]
US 8917734B1 · Brown · 2014 [cited by applicant]
US 9049265B1 · Greenfield et al. · 2015 [cited by applicant]
US 9164702B1 · Nesbit et al. · 2015 [cited by applicant]
US 9275071B2 · O'Hare et al. · 2016 [cited by applicant]
US 9448901B1 · Aslam et al. · 2016 [cited by applicant]
US 9648102B1 · Davis et al. · 2017 [cited by applicant]
US 9684597B1 · Eiriksson · 2017 [cited by applicant]
US 9864519B2 · Meyer et al. · 2018 [cited by applicant]
US 9934152B1 · Bryant et al. · 2018 [cited by applicant]
US 10152428B1 · Alshawabkeh et al. · 2018 [cited by applicant]
US 10169279B2 · Yokoyama · 2019 [cited by applicant]
US 10374945B1 · Dhanabalan et al. · 2019 [cited by applicant]
US 10447767B2 · Baptist et al. · 2019 [cited by applicant]
US 10503658B2 · Basu et al. · 2019 [cited by applicant]
US 10778521B2 · Liguori et al. · 2020 [cited by applicant]
US 10880204B1 · Shalev et al. · 2020 [cited by applicant]
US 10931588B1 · Matthews · 2021 [cited by examiner]
US 10944660B2 · Hurson et al. · 2021 [cited by applicant]
US 11934318B2 · Fan et al. · 2024 [cited by applicant]
US 11947483B2 · Helps et al. · 2024 [cited by applicant]
US 11972292B1 · Fan · 2024 [cited by applicant]
US 12450177B2 · Bataineh · 2025 [cited by examiner]
US 20010046212A1 · Nakajima · 2001 [cited by applicant]
US 20020071450A1 · Gasbarro et al. · 2002 [cited by applicant]
US 20020078271A1 · Berry · 2002 [cited by applicant]
US 20020129272A1 · Terrell et al. · 2002 [cited by applicant]
US 20020141427A1 · McAlpine · 2002 [cited by examiner]
US 20020159385A1 · Susnow et al. · 2002 [cited by applicant]
US 20020184452A1 · Simmons et al. · 2002 [cited by applicant]
US 20020191599A1 · Parthasarathy et al. · 2002 [cited by applicant]
US 20030058875A1 · Arndt et al. · 2003 [cited by applicant]
US 20030117958A1 · Nation · 2003 [cited by examiner]
US 20030154412A1 · Hetzler et al. · 2003 [cited by applicant]
US 20040049603A1 · Boyd et al. · 2004 [cited by applicant]
US 20050068798A1 · Lee et al. · 2005 [cited by applicant]
US 20050080920A1 · Bender et al. · 2005 [cited by applicant]
US 20050089033A1 · Gupta et al. · 2005 [cited by applicant]
US 20050223118A1 · Tucker et al. · 2005 [cited by applicant]
US 20060004941A1 · Shah et al. · 2006 [cited by applicant]
US 20060056308A1 · Gusat et al. · 2006 [cited by applicant]
US 20060056405A1 · Chang et al. · 2006 [cited by applicant]
US 20060059242A1 · Blackmore et al. · 2006 [cited by applicant]
US 20060062232A1 · Kumar · 2006 [cited by examiner]
US 20060090014A1 · Wong et al. · 2006 [cited by applicant]
US 20060092837A1 · Kwan · 2006 [cited by examiner]
US 20060236063A1 · Hausauer et al. · 2006 [cited by applicant]
US 20060242352A1 · Torudbakken et al. · 2006 [cited by applicant]
US 20060251109A1 · Muller · 2006 [cited by examiner]
US 20060253619A1 · Torudbakken et al. · 2006 [cited by applicant]
US 20060271713A1 · Xie et al. · 2006 [cited by applicant]
US 20070038794A1 · Purcell et al. · 2007 [cited by applicant]
US 20070104102A1 · Opsasnick · 2007 [cited by examiner]
US 20070230493A1 · Dravida · 2007 [cited by examiner]
US 20070255802A1 · Aloni et al. · 2007 [cited by applicant]
US 20070283123A1 · Vick et al. · 2007 [cited by applicant]
US 20080031266A1 · Tallet et al. · 2008 [cited by applicant]
US 20080043732A1 · Desai et al. · 2008 [cited by applicant]
US 20080168194A1 · Gregg et al. · 2008 [cited by applicant]
US 20090083392A1 · Wong et al. · 2009 [cited by applicant]
US 20090113143A1 · Domsch et al. · 2009 [cited by applicant]
US 20090172301A1 · Ebersole et al. · 2009 [cited by applicant]
US 20100064070A1 · Yoshimura et al. · 2010 [cited by applicant]
US 20100103837A1 · Jungck · 2010 [cited by examiner]
US 20100161870A1 · Daniel · 2010 [cited by applicant]
US 20100232448A1 · Sugumar et al. · 2010 [cited by applicant]
US 20100312850A1 · Deshpande · 2010 [cited by applicant]
US 20110072204A1 · Chang et al. · 2011 [cited by applicant]
US 20110072234A1 · Chinya et al. · 2011 [cited by applicant]
US 20110268119A1 · Pong · 2011 [cited by examiner]
US 20110271010A1 · Kenchammana et al. · 2011 [cited by applicant]
US 20120166690A1 · Regula · 2012 [cited by applicant]
US 20130024591A1 · Sun · 2013 [cited by applicant]
US 20130031328A1 · Kelleher et al. · 2013 [cited by applicant]
US 20130132536A1 · Zhang et al. · 2013 [cited by applicant]
US 20130318322A1 · Shetty et al. · 2013 [cited by applicant]
US 20140108726A1 · Laurich et al. · 2014 [cited by applicant]
US 20140237156A1 · Regula et al. · 2014 [cited by applicant]
US 20150026286A1 · Sharp et al. · 2015 [cited by applicant]
US 20150082000A1 · Hong et al. · 2015 [cited by applicant]
US 20150089009A1 · Tsirkin et al. · 2015 [cited by applicant]
US 20160070475A1 · Zhang et al. · 2016 [cited by applicant]
US 20160085450A1 · Ahn et al. · 2016 [cited by applicant]
US 20160094553A1 · Azgin et al. · 2016 [cited by applicant]
US 20160142317A1 · Yang · 2016 [cited by examiner]
US 20160162422A1 · Weber · 2016 [cited by applicant]
US 20160269305A1 · Sreeramoju et al. · 2016 [cited by applicant]
US 20170097909A1 · Simionescu et al. · 2017 [cited by applicant]
US 20170132148A1 · Liu et al. · 2017 [cited by applicant]
US 20170177520A1 · Kampe et al. · 2017 [cited by applicant]
US 20170177528A1 · Harriman et al. · 2017 [cited by applicant]
US 20170185528A1 · Hansson et al. · 2017 [cited by applicant]
US 20170262567A1 · Vassiliev · 2017 [cited by examiner]
US 20170372088A1 · Zhao et al. · 2017 [cited by applicant]
US 20180004703A1 · Sharma et al. · 2018 [cited by applicant]
US 20180024938A1 · Paltashev et al. · 2018 [cited by applicant]
US 20180046411A1 · Coburn et al. · 2018 [cited by applicant]
US 20180052793A1 · Fang · 2018 [cited by applicant]
US 20180115498A1 · Sundaram · 2018 [cited by examiner]
US 20180176134A1 · Pignataro et al. · 2018 [cited by applicant]
US 20180191623A1 · Marty et al. · 2018 [cited by applicant]
US 20180198715A1 · Shmilovici et al. · 2018 [cited by applicant]
US 20180241629A1 · Sato et al. · 2018 [cited by applicant]
US 20180359219A1 · Israel · 2018 [cited by examiner]
US 20190102310A1 · Ramrakhyani et al. · 2019 [cited by applicant]
US 20190109793A1 · Dalal · 2019 [cited by applicant]
US 20190116121A1 · Friedman et al. · 2019 [cited by applicant]
US 20190141041A1 · Bhabbur et al. · 2019 [cited by applicant]
US 20190173810A1 · Shpiner et al. · 2019 [cited by applicant]
US 20190188146A1 · Dusanapudi et al. · 2019 [cited by applicant]
US 20190220425A1 · Zemach et al. · 2019 [cited by applicant]
US 20190258415A1 · Imamura · 2019 [cited by applicant]
US 20190294366A1 · Kawamura et al. · 2019 [cited by applicant]
US 20190305951A1 · Grubin et al. · 2019 [cited by applicant]
US 20190320019A1 · Hamrick, Jr. · 2019 [cited by applicant]
US 20190324917A1 · Cui et al. · 2019 [cited by applicant]
US 20190334828A1 · Fairhurst · 2019 [cited by examiner]
US 20190370173A1 · Boyer et al. · 2019 [cited by applicant]
US 20190379767A1 · Sharma et al. · 2019 [cited by applicant]
US 20190384733A1 · Jen et al. · 2019 [cited by applicant]
US 20200004685A1 · Guim Bernat et al. · 2020 [cited by applicant]
US 20200119753A1 · Chirca et al. · 2020 [cited by applicant]
US 20200159669A1 · Duncan et al. · 2020 [cited by applicant]
US 20200177513A1 · Zhang · 2020 [cited by applicant]
US 20200204489A1 · Pianigiani et al. · 2020 [cited by applicant]
US 20200236052A1 · Srinivasan et al. · 2020 [cited by applicant]
US 20200264985A1 · Lee · 2020 [cited by applicant]
US 20200280518A1 · Lee et al. · 2020 [cited by applicant]
US 20200371955A1 · Goodacre et al. · 2020 [cited by applicant]
US 20200387405A1 · Xiao et al. · 2020 [cited by applicant]
US 20210019069A1 · Sen et al. · 2021 [cited by applicant]
US 20210037107A1 · Klenk et al. · 2021 [cited by applicant]
US 20210075633A1 · Sen et al. · 2021 [cited by applicant]
US 20210083981A1 · Shmilovici et al. · 2021 [cited by applicant]
US 20210132999A1 · Haywood et al. · 2021 [cited by applicant]
US 20210149803A1 · Bernat · 2021 [cited by applicant]
US 20210232312A1 · Prasad et al. · 2021 [cited by applicant]
US 20210234706A1 · Nair et al. · 2021 [cited by applicant]
US 20210297350A1 · Vegesna et al. · 2021 [cited by applicant]
US 20210311643A1 · Shanbhogue et al. · 2021 [cited by applicant]
US 20210318961A1 · Peterson et al. · 2021 [cited by applicant]
US 20210345112A1 · Elliott et al. · 2021 [cited by applicant]
US 20220004512A1 · Cannata et al. · 2022 [cited by applicant]
US 20220060422A1 · Sommers · 2022 [cited by applicant]
US 20220085916A1 · Debbage et al. · 2022 [cited by applicant]
US 20220109587A1 · Sapio et al. · 2022 [cited by applicant]
US 20220197787A1 · Han et al. · 2022 [cited by applicant]
US 20220200906A1 · Ye et al. · 2022 [cited by applicant]
US 20220214912A1 · Julien et al. · 2022 [cited by applicant]
US 20220217085A1 · Sankar et al. · 2022 [cited by applicant]
US 20220222118A1 · Wang et al. · 2022 [cited by applicant]
US 20220248251A1 · Ryu et al. · 2022 [cited by applicant]
US 20220283964A1 · Burstein et al. · 2022 [cited by applicant]
US 20220291875A1 · Diaz-Cuellar et al. · 2022 [cited by applicant]
US 20220394014A1 · Wang et al. · 2022 [cited by applicant]
US 20230038094A1 · Velasco · 2023 [cited by applicant]
US 20230044342A1 · Wilkinson · 2023 [cited by applicant]
US 20230051781A1 · Patel et al. · 2023 [cited by applicant]
US 20230093247A1 · Kumar et al. · 2023 [cited by applicant]
US 20230096451A1 · Johnson et al. · 2023 [cited by applicant]
US 20240028209A1 · Berke et al. · 2024 [cited by applicant]
US 20240098023A1 · Guo · 2024 [cited by applicant]
US 20240296138A1 · Helps et al. · 2024 [cited by applicant]
US 20240311310A1 · Fan et al. · 2024 [cited by applicant]
US 20240414087A1 · Ranjan et al. · 2024 [cited by applicant]
US 20240422100A1 · Helps et al. · 2024 [cited by applicant]
EP 2768188A1 · 2014 [cited by applicant]
EP 3661141A1 · 2020 [cited by applicant]
EP 3504849B1 · 2022 [cited by examiner]
WO WO2005106693A2 · 2005 [cited by applicant]
WO WO2009120798A2 · 2009 [cited by applicant]
WO WO2020055921A1 · 2020 [cited by applicant]
WO WO2022005322A1 · 2022 [cited by applicant]
WO WO2022108498A1 · 2022 [cited by applicant]
WO WO2022198552 · 2022 [cited by applicant]
WO WO2024102915A1 · 2024 [cited by applicant]
U.S. Appl. No. 17/570,261, filed Jan. 6, 2022, Server Fabric Adapter For I/O Scaling Of Heterogeneous And Accelerated Compute Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 18/778,611, filed Jul. 19, 2024, Server Fabric Adapter for I/O Scaling of Heterogeneous and Accelerated Compute Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 18/747,118, filed Jun. 18, 2024, Optimally Balanced Network Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 19/037,768, filed Jan. 27, 2025, Server Fabric Adapter for I/O Scaling of Heterogeneous and Accelerated Compute Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 17/836,532, filed Jun. 9, 2022, Transparent Remote Memory Access Over Network Protocol, Thomas Norrie, et al. [cited by applicant]
U.S. Appl. No. 18/755,372, filed 6/26/224, Transparent Remote Memory Access Over Network Protocol, Thomas Norrie, et al. [cited by applicant]
U.S. Appl. No. 17/886,026, filed Aug. 11, 2022, System And Method For Congestion Control Using A Flow Level Transmit Mechanism, Shrijeet Mukherjee et al. [cited by applicant]
U.S. Appl. No. 18/102,033, filed Jan. 26, 2023, System And Method For One-Sided Read Rma Using Linked Queues, Shrijeet Mukerjee, et al. [cited by applicant]
U.S. Appl. No. 18/447,180, filed Aug. 9, 2023, System And Method For Ghost Bridging, Thomas Norrie, et al. [cited by applicant]
U.S. Appl. No. 18/666,548, filed May 16, 2024, System And Method For An Optimized Staging Buffer For Broadcast/Multicast Operations, Shrijeet Mukherjee, et al. [cited by applicant]
U.S. Appl. No. 18/526,727, filed Dec. 1, 2023, A Modular Datacenter Interconnection System, David Skirmont, et al. [cited by applicant]
U.S. Appl. No. 18/785,542, filed Jul. 26, 2024, Method And System For Tracking And Moving Pages Within A Memory Hierarchy, Shrijeet Mukhrjee, et al. [cited by applicant]
U.S. Appl. No. 18/920,558, filed Oct. 18, 2024, System and Method for Optimally Balanced Network Multipathing, Shrijeet Mukhrjee, et al. [cited by applicant]
U.S. Appl. No. 19/034,371, filed Jan. 22, 2025, Input/Output System Interconnect Redundancy and Failover, Frederic Vecoven, et al. [cited by applicant]
U.S. Appl. No. 18/785,542, filed Jul. 26, 2024, System and Method for Optimally Balanced Network Multipathing, Shrijeet Mukhrjee, et al. [cited by applicant]
Rochan, Sankar, Foundational Fabrics for AI: Introducing the Accelerated Compute Fabric Switch, AI Hardware Summit, Sep. 13, 2023. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2024/052073, dated Apr. 28, 2024 (15 pages). [cited by applicant]
Emulex Corporation. “Emulex provides 10Gb Ethernet Virtual Fabric Adapter 5 for New Lenovo Servers.” Business Wire. Dec. 15, 2014 (Dec. 15, 2014) Retrieved on Mar. 7, 2022 (Mar. 7, 2022 from: <https://www.businesswire.c… [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2022/011491, dated Mar. 24, 2022 (8 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2022/32841, dated Nov. 21, 2022 (10 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2022/74833, dated Dec. 6, 2022 (8 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/062168, dated May 12, 2023 (54 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/61405, dated Jul. 11, 2023 (6 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/082132, dated Jun. 6, 2024 (8 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2024/029723, dated Aug. 22, 2024 (14 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/029887, dated Oct. 26, 2023 (13 pages). [cited by applicant]
“Using Non-transparent Bridging in PCI Express Systems,” by Jack Regula, Jun. 1, 2004, Jun. 1, 2004, pp. 4-30, XP002686987, U RL:http :/ /www.plxtech.com/files/pdf/technical/expresslane/NontransparentBridging .pdf. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2024/039765, dated Oct. 22, 2024 (15 pages). [cited by applicant]
European Search Report for European Patent Application No. EP 22737124.2, dated Jan. 23, 2025 (12 pages). [cited by applicant]
Extended European Search Report for European Patent Application No. EP 22856810.1, dated May 30, 2025 (9 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2025/012514, dated Jul. 30, 2025 (11 pages). [cited by applicant]
Partial European Search Report for European Patent Application No. EP 22821030.8, dated Apr. 9, 2025 (20 pages). [cited by applicant]