Arrcus, Inc.

United States of America

Back to Profile

1-100 of 103 for Arrcus, Inc. Sort by
Query
Aggregations
IP Type
        Patent 90
        Trademark 13
Jurisdiction
        United States 52
        World 30
        Canada 21
Date
2025 April 4
2025 (YTD) 4
2024 17
2023 2
2022 28
See more
IPC Class
H04L 12/46 - Interconnection of networks 37
H04L 12/44 - Star or tree networks 30
H04L 45/02 - Topology update or discovery 29
H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks] 27
H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways 23
See more
NICE Class
09 - Scientific and electric apparatus and instruments 13
42 - Scientific, technological and industrial services, research and design 4
Status
Pending 31
Registered / In Force 72
  1     2        Next Page

1.

COST-AWARE ROUTING IN A NETWORK TOPOLOGY

      
Application Number US2024050433
Publication Number 2025/080617
Status In Force
Filing Date 2024-10-09
Publication Date 2025-04-17
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Babu, Lakshman, Swaroop
  • Gopinathan, Sujay
  • Rajaram, Kalyani
  • Swaroop, Ashish

Abstract

Cost aware routing in a network topology to reduce costs within an egress-based pricing model. A method includes receiving telemetry data from one or more of a network device or a compute device within a cloud computing network, wherein the telemetry data is associated with a customer of the cloud computing network. The method includes retrieving an egress-based pricing scheme associated with a provider of the cloud computing network and provisioning one or more of the network device or the compute device to optimize routing decisions for the customer to reduce a predicted data egress charge for the customer.

IPC Classes  ?

  • H04L 45/02 - Topology update or discovery
  • H04L 41/12 - Discovery or management of network topologies
  • H04L 47/00 - Traffic control in data switching networks
  • H04L 45/00 - Routing or path finding of packets in data switching networks

2.

COST-AWARE PROVISIONING AND ROUTING IN A MULTI-CLOUD ENVIRONMENT

      
Application Number US2024050436
Publication Number 2025/080620
Status In Force
Filing Date 2024-10-09
Publication Date 2025-04-17
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Babu, Lakshman, Swaroop
  • Gopinathan, Sujay
  • Rajaram, Kalyani
  • Swaroop, Ashish

Abstract

Cost aware routing in a network topology to reduce costs within an egress-based pricing model. A method includes receiving telemetry data from one or more of a network device or a compute device within a cloud computing network, wherein the telemetry data is associated with a customer of the cloud computing network. The method includes retrieving an egress-based pricing scheme associated with a provider of the cloud computing network and provisioning one or more of the network device or the compute device to optimize routing decisions for the customer to reduce a predicted data egress charge for the customer. A route may be selected to traverse multiple clouds and/or colocation providers according to ingress, egress, and transfer charges. Segment routing and VRFs may be used to implement routes selected based on criteria such as cost, latency, throughput, and jitter.

IPC Classes  ?

  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/74 - Address processing for routing
  • H04L 45/76 - Routing in software-defined topologies, e.g. routing between virtual machines
  • H04L 41/0826 - Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for reduction of network costs

3.

Cost-Aware Routing In A Network Topology

      
Application Number 18483925
Status Pending
Filing Date 2023-10-10
First Publication Date 2025-04-10
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Babu, Lakshman Swaroop
  • Gopinathan, Sujay
  • Rajaram, Kalyani
  • Swaroop, Ashish

Abstract

Cost aware routing in a network topology to reduce costs within an egress-based pricing model. A method includes receiving telemetry data from one or more of a network device or a compute device within a cloud computing network, wherein the telemetry data is associated with a customer of the cloud computing network. The method includes retrieving an egress-based pricing scheme associated with a provider of the cloud computing network and provisioning one or more of the network device or the compute device to optimize routing decisions for the customer to reduce a predicted data egress charge for the customer.

IPC Classes  ?

4.

Cost-Aware Provisioning and Routing in a Multi-Cloud Environment

      
Application Number 18652296
Status Pending
Filing Date 2024-05-01
First Publication Date 2025-04-10
Owner Arrcus Inc (USA)
Inventor
  • Patel, Keyur
  • Babu, Lakshman Swaroop
  • Gopinathan, Sujay
  • Rajaram, Kalyani
  • Swaroop, Ashish

Abstract

Cost aware routing in a network topology to reduce costs within an egress-based pricing model. A method includes receiving telemetry data from one or more of a network device or a compute device within a cloud computing network, wherein the telemetry data is associated with a customer of the cloud computing network. The method includes retrieving an egress-based pricing scheme associated with a provider of the cloud computing network and provisioning one or more of the network device or the compute device to optimize routing decisions for the customer to reduce a predicted data egress charge for the customer. A route may be selected to traverse multiple clouds and/or colocation providers according to ingress, egress, and transfer charges. Segment routing and VRFs may be used to implement routes selected based on criteria such as cost, latency, throughput, and jitter.

IPC Classes  ?

  • H04L 45/12 - Shortest path evaluation
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 67/10 - Protocols in which an application is distributed across nodes in the network

5.

PREVENTION OF SUBSCRIBER IDENTITY MODULE SPOOFING FOR MOBILE USER PLANE

      
Application Number US2024028498
Publication Number 2024/238251
Status In Force
Filing Date 2024-05-09
Publication Date 2024-11-21
Owner ARRCUS INC. (USA)
Inventor
  • Murakami, Tetsuya
  • Patel, Keyur

Abstract

Prevention of SIM spoofing in mobile user plane. A method includes establishing a session for a user equipment to communicate with a session management function (SMF) and a user plane function (UPF), and then snooping a message between the SMF and the UPF to acquire one or more of an address for the user equipment, a tunnel endpoint identifier, or an address for a node within a radio access network. The method includes generating a route for carrying the one or more of the address for the user equipment, the tunnel endpoint identifier, or the address for the node within the radio access network, and then providing the route to a router.

IPC Classes  ?

6.

PREVENTION OF SUBSCRIBER IDENTITY MODULE SPOOFING FOR MOBILE USER PLANE

      
Application Number US2024028503
Publication Number 2024/238252
Status In Force
Filing Date 2024-05-09
Publication Date 2024-11-21
Owner ARRCUS INC. (USA)
Inventor
  • Murakami, Tetsuya
  • Patel, Keyur

Abstract

Prevention of SIM spoofing in mobile user plane. A method includes generating a border gateway protocol (BGP) flow specification based on a range of Internet Protocol (IP) addresses associated with routes for one or more user equipment devices. The method includes, in response to receiving a packet from a node within a radio access network, verifying an inner IP packet encapsulation based on the BGP flow specification.

IPC Classes  ?

7.

PREVENTION OF SUBSCRIBER IDENTITY MODULE SPOOFING FOR MOBILE USER PLANE

      
Application Number US2024028520
Publication Number 2024/238253
Status In Force
Filing Date 2024-05-09
Publication Date 2024-11-21
Owner ARRCUS INC. (USA)
Inventor
  • Murakami, Tetsuya
  • Patel, Keyur

Abstract

Prevention of SIM spoofing in mobile user plane. A system includes a session management function (SMF) within a radio access network and a user plane function (UPF) within the radio access network, wherein the UPF communicates with the SMF. The system includes a packet forwarding control protocol (PFCP) proxy between the SMF and the UPF, wherein the PFCP proxy snoops PF CP messages between the SMF and the UPF.

IPC Classes  ?

8.

PREVENTION OF SUBSCRIBER IDENTITY MODULE SPOOFING FOR MOBILE USER PLANE

      
Application Number 18316686
Status Pending
Filing Date 2023-05-12
First Publication Date 2024-11-14
Owner Arrcus Inc. (USA)
Inventor
  • Murakami, Tetsuya
  • Patel, Keyur

Abstract

Prevention of SIM spoofing in mobile user plane. A system includes a session management function (SMF) within a radio access network and a user plane function (UPF) within the radio access network, wherein the UPF communicates with the SMF. The system includes a packet forwarding control protocol (PFCP) proxy between the SMF and the UPF, wherein the PFCP proxy snoops PFCP messages between the SMF and the UPF.

IPC Classes  ?

  • H04W 12/122 - Counter-measures against attacksProtection against rogue devices

9.

PREVENTION OF SUBSCRIBER IDENTITY MODULE SPOOFING FOR MOBILE USER PLANE

      
Application Number 18316640
Status Pending
Filing Date 2023-05-12
First Publication Date 2024-11-14
Owner Arrcus Inc. (USA)
Inventor
  • Murakami, Tetsuya
  • Patel, Keyur

Abstract

Prevention of SIM spoofing in mobile user plane. A method includes establishing a session for a user equipment to communicate with a session management function (SMF) and a user plane function (UPF), and then snooping a message between the SMF and the UPF to acquire one or more of an address for the user equipment, a tunnel endpoint identifier, or an address for a node within a radio access network. The method includes generating a route for carrying the one or more of the address for the user equipment, the tunnel endpoint identifier, or the address for the node within the radio access network, and then providing the route to a router.

IPC Classes  ?

  • H04W 12/122 - Counter-measures against attacksProtection against rogue devices
  • H04W 60/04 - Affiliation to network, e.g. registrationTerminating affiliation with the network, e.g. de-registration using triggered events

10.

PREVENTION OF SUBSCRIBER IDENTITY MODULE SPOOFING FOR MOBILE USER PLANE

      
Application Number 18316667
Status Pending
Filing Date 2023-05-12
First Publication Date 2024-11-14
Owner Arrcus Inc. (USA)
Inventor
  • Murakami, Tetsuya
  • Patel, Keyur

Abstract

Prevention of SIM spoofing in mobile user plane. A method includes generating a border gateway protocol (BGP) flow specification based on a range of Internet Protocol (IP) addresses associated with routes for one or more user equipment devices. The method includes, in response to receiving a packet from a node within a radio access network, verifying an inner IP packet encapsulation based on the BGP flow specification.

IPC Classes  ?

  • H04W 12/122 - Counter-measures against attacksProtection against rogue devices
  • H04L 12/46 - Interconnection of networks
  • H04L 45/74 - Address processing for routing
  • H04W 12/033 - Protecting confidentiality, e.g. by encryption of the user plane, e.g. user’s traffic
  • H04W 12/72 - Subscriber identity
  • H04W 60/00 - Affiliation to network, e.g. registrationTerminating affiliation with the network, e.g. de-registration

11.

High Availability Network Address Translation

      
Application Number 18646232
Status Pending
Filing Date 2024-04-25
First Publication Date 2024-08-22
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Gopinathan, Sujay
  • Kannan, Sreekanth
  • Ayyangar, Arthi

Abstract

A computing environment, such as a cloud computing environment, may include nodes performing NAT for a plurality of workloads. An active node performs NAT for the workloads, including maintaining a NAT table. The active node may create sub-interfaces for the workloads and function as a DHCP server. The NAT table and sub-interfaces may be recreated on a standby node. Upon detecting failure, a routing table is updated to direct workloads to connect to the standby node and traffic may continue to be processed by the standby node without disrupting network or application sessions.

IPC Classes  ?

  • H04L 61/2567 - NAT traversal for reachability, e.g. inquiring the address of a correspondent behind a NAT server
  • H04L 12/46 - Interconnection of networks
  • H04L 41/0816 - Configuration setting characterised by the conditions triggering a change of settings the condition being an adaptation, e.g. in response to network events
  • H04L 67/1008 - Server selection for load balancing based on parameters of servers, e.g. available memory or workload
  • H04L 67/1034 - Reaction to server failures by a load balancer
  • H04L 101/622 - Layer-2 addresses, e.g. medium access control [MAC] addresses

12.

METHOD AND APPARATUS FOR TELEMETRY MONITORING OF BGP PREFIXES IN A NETWORK TOPOLOGY

      
Application Number US2023083597
Publication Number 2024/137282
Status In Force
Filing Date 2023-12-12
Publication Date 2024-06-27
Owner ARRCUS INC. (USA)
Inventor
  • Babu, Lakshman Swaroop
  • Yeh, Ting-Chi
  • Patel, Alpesh
  • Patel, Keyur

Abstract

Telemetry monitoring of BGP prefixes in a network topology. A system includes a plurality of input topic streams and a plurality of processors, wherein each of the plurality of processors is dedicated to one or more of the plurality of input topic streams. The system includes a plurality of stream stores for storing data, wherein each of the plurality of stream stores is dedicated to one or more of the plurality of input topic streams. The system includes a route processor in communication with each of the plurality of stream stores, wherein the route processor determines whether a route for a network topology corresponds with an existing route stored on at least one of the plurality of stream stores.

IPC Classes  ?

  • H04L 45/02 - Topology update or discovery
  • H04L 47/10 - Flow controlCongestion control
  • G06F 15/173 - Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star or snowflake
  • H04L 12/46 - Interconnection of networks
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 12/00 - Data switching networks

13.

METHOD AND APPARATUS FOR TELEMETRY MONITORING OF BGP PREFIXES IN A NETWORK TOPOLOGY

      
Application Number US2023083582
Publication Number 2024/137280
Status In Force
Filing Date 2023-12-12
Publication Date 2024-06-27
Owner ARRCUS INC. (USA)
Inventor
  • Babu, Lakshman Swaroop
  • Yeh, Ting-Chi
  • Patel, Alpesh
  • Patel, Keyur

Abstract

Telemetry monitoring of BGP prefixes in a network topology. A method includes receiving a route for a network topology and determining whether the route corresponds with an existing route stored on a route store. The method includes determining whether any network routing paths have been modified between the existing route and the route in response to determining the route corresponds with the existing route. The method includes generating a path configuration key for each of the at least one network routing path in response to determining at least one network routing path was modified between the existing route and the route.

IPC Classes  ?

14.

Method and apparatus for telemetry monitoring of BGP prefixes in a network topology

      
Application Number 18084828
Grant Number 12113700
Status In Force
Filing Date 2022-12-20
First Publication Date 2024-06-20
Grant Date 2024-10-08
Owner Arrcus Inc. (USA)
Inventor
  • Babu, Lakshman Swaroop
  • Yeh, Ting-Chi
  • Patel, Alpesh
  • Patel, Keyur

Abstract

Telemetry monitoring of BGP prefixes in a network topology. A method includes receiving a route for a network topology and determining whether the route corresponds with an existing route stored on a route store. The method includes determining whether any network routing paths have been modified between the existing route and the route in response to determining the route corresponds with the existing route. The method includes generating a path configuration key for each of the at least one network routing path in response to determining at least one network routing path was modified between the existing route and the route.

IPC Classes  ?

15.

Method and apparatus for telemetry monitoring of BGP prefixes in a network topology

      
Application Number 18084845
Grant Number 12294510
Status In Force
Filing Date 2022-12-20
First Publication Date 2024-06-20
Grant Date 2025-05-06
Owner Arrcus Inc. (USA)
Inventor
  • Babu, Lakshman Swaroop
  • Yeh, Ting-Chi
  • Patel, Alpesh
  • Patel, Keyur

Abstract

Telemetry monitoring of BGP prefixes in a network topology. A system includes a plurality of input topic streams and a plurality of processors, wherein each of the plurality of processors is dedicated to one or more of the plurality of input topic streams. The system includes a plurality of stream stores for storing data, wherein each of the plurality of stream stores is dedicated to one or more of the plurality of input topic streams. The system includes a route processor in communication with each of the plurality of stream stores, wherein the route processor determines whether a route for a network topology corresponds with an existing route stored on at least one of the plurality of stream stores.

IPC Classes  ?

16.

Host routed overlay with deterministic host learning and localized integrated routing and bridging

      
Application Number 18582065
Grant Number 12242903
Status In Force
Filing Date 2024-02-20
First Publication Date 2024-06-13
Grant Date 2025-03-04
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Bush, Randy
  • Keszei, Csaba
  • Austein, Robert
  • Kovuru, Harsha Vardhan

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 16/23 - Updating
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

17.

Single Node and Multiple Node Datastore Architecture in a Network Routing Environment

      
Application Number 18523295
Status Pending
Filing Date 2023-11-29
First Publication Date 2024-05-09
Owner Arrcus Inc. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a plurality of instances of a datastore node in a single networking device, each of the plurality of instances of the datastore node comprising: a datastore; a publisher independent of the datastore for publishing data to the datastore; a subscriber independent of the datastore for receiving information from the datastore; a replicator agent configured to connect to the datastore as a publisher or a subscriber; and a persistent storage agent configured to connect to the datastore as a publisher or a subscriber.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 16/23 - Updating
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

18.

Asynchronous object manager in a network routing environment

      
Application Number 18516173
Grant Number 12308997
Status In Force
Filing Date 2023-11-21
First Publication Date 2024-03-14
Grant Date 2025-05-20
Owner Arrcus Inc. (USA)
Inventor
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes routing chip hardware and an asynchronous object manager in communication with the routing chip hardware. The asynchronous object manager is configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include asynchronously receiving a plurality of objects from one or more producers. The instructions include identifying one or more dependencies between two or more of the plurality of objects. The instructions include reordering the plurality of objects according to the one or more dependencies. The instructions include determining whether the one or more dependencies is resolve. The instructions include, in response to determining the one or more dependencies is resolved, calling back an application and providing one or more of the plurality of objects to the application.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 16/23 - Updating
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

19.

AUTOMATED SCALING OF NETWORK TOPOLOGIES USING UNIQUE IDENTIFIERS

      
Document Number 03264146
Status Pending
Filing Date 2023-08-08
Open to Public Date 2024-02-15
Owner ARRCUS INC. (USA)
Inventor
  • Ramanathan, Sethuraman
  • Manoharan, Ashok Patrick Jude
  • Iyer, Amol
  • Wall, Stephen
  • Patel, Keyur

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/46 - Interconnection of networks
  • H04L 45/02 - Topology update or discovery

20.

Automated Scaling Of Network Topologies Using Unique Identifiers

      
Application Number 17886114
Status Pending
Filing Date 2022-08-11
First Publication Date 2024-02-15
Owner Arrcus Inc. (USA)
Inventor
  • Ramanathan, Sethuraman
  • Manoharan, Ashok Patrick Jude
  • Iyer, Amol
  • Wall, Stephen
  • Patel, Keyur

Abstract

Systems and methods for improved data routing in network topologies. A method includes generating a configuration template for a network topology based on a topology descriptor file, wherein the network topology comprises a plurality of nodes, and wherein the topology descriptor file comprises a plurality of unique node tag identifiers that are each assigned to a node of the plurality of nodes within the network topology. The method includes resolving each of the plurality of unique node tag identifiers based on the plurality of nodes within the network topology and generating a network configuration for the network topology.

IPC Classes  ?

  • H04L 41/12 - Discovery or management of network topologies

21.

AUTOMATED SCALING OF NETWORK TOPOLOGIES USING UNIQUE IDENTIFIERS

      
Application Number US2023071841
Publication Number 2024/036149
Status In Force
Filing Date 2023-08-08
Publication Date 2024-02-15
Owner ARRCUS INC. (USA)
Inventor
  • Ramanathan, Sethuraman
  • Manoharan, Ashok, Patrick Jude
  • Iyer, Amol
  • Wall, Stephen
  • Patel, Keyur

Abstract

Systems and methods for improved data routing in network topologies. A method includes generating a configuration template for a network topology based on a topology descriptor file, wherein the network topology comprises a plurality of nodes, and wherein the topology descriptor file comprises a plurality of unique node tag identifiers that are each assigned to a node of the plurality of nodes within the network topology. The method includes resolving each of the plurality of unique node tag identifiers based on the plurality of nodes within the network topology and generating a network configuration for the network topology.

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/46 - Interconnection of networks
  • H04L 45/02 - Topology update or discovery
  • H04L 12/00 - Data switching networks

22.

Independent Datastore In A Network Routing Environment

      
Application Number 18322340
Status Pending
Filing Date 2023-05-23
First Publication Date 2023-11-16
Owner Arrcus Inc. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • H04L 45/48 - Routing tree calculation
  • H04L 9/40 - Network security protocols
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 12/46 - Interconnection of networks
  • H04L 67/55 - Push-based network services
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 12/44 - Star or tree networks
  • G06F 16/23 - Updating
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 49/25 - Routing or path finding in a switch fabric

23.

Host routed overlay with deterministic host learning and localized integrated routing and bridging

      
Application Number 18296149
Grant Number 11941460
Status In Force
Filing Date 2023-04-05
First Publication Date 2023-07-27
Grant Date 2024-03-26
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Bush, Randy
  • Keszei, Csaba
  • Austein, Robert
  • Vardhan Kovuru, Harsha

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 16/23 - Updating
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

24.

IMPROVED USE OF IP NETWORKS FOR ROUTING OF CELLULAR DATA PACKETS

      
Document Number 03216608
Status Pending
Filing Date 2022-04-20
Open to Public Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a gNodeB connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy snoops information and provides it to a BGP module that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF. The BGP module may program the first translation module with an SR policy associated with a binding SID that is bound to an interface to the gNodeB. The SR policy may invoke translation according to a function. The routing module may be programmed to embed GTP information in an SRH header that is used by the first translation module. BGP module may also distribute routing and VPN updates.

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04W 40/00 - Communication routing or communication path finding
  • H04W 80/00 - Wireless network protocols or protocol adaptations to wireless operation

25.

PFCP SESSION LOAD BALANCER

      
Application Number US2022025555
Publication Number 2022/231906
Status In Force
Filing Date 2022-04-20
Publication Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

Importing of a UE address into a VRF of perimeter equipment is facilitate by receiving a VPN update from the perimeter equipment including a route target of the perimeter equipment and a gNodeB address. In addition, session information is obtained by intercepting traffic between the UE address and a UPF. The session information including the UE address and address of a gNodeB to which the UE is connected. By matching the gNodeB addresses from the VPN update and the session information, the route target of the perimeter equipment to which the UE is connected may be determined. The UE address may then be imported exclusively into the VRF of the perimeter equipment.

IPC Classes  ?

  • G06F 9/50 - Allocation of resources, e.g. of the central processing unit [CPU]
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
  • G06F 9/46 - Multiprogramming arrangements
  • G06F 13/14 - Handling requests for interconnection or transfer
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol

26.

IMPROVED USE OF IP NETWORKS FOR ROUTING OF CELLULAR DATA PACKETS

      
Application Number US2022025592
Publication Number 2022/231917
Status In Force
Filing Date 2022-04-20
Publication Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a BBU connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy intercepts control packets of the UPF. Information snooped by the PFCP proxy is provided to a routing/SDN controller that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF.

IPC Classes  ?

  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/50 - Circuit switching systems, i.e. systems in which the path is physically permanent during the communication
  • H04L 61/59 - Network arrangements, protocols or services for addressing or naming using proxies for addressing
  • H04L 69/16 - Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
  • H04L 69/22 - Parsing or analysis of headers

27.

IMPROVED USE OF IP NETWORKS FOR ROUTING OF CELLULAR DATA PACKETS

      
Application Number US2022025600
Publication Number 2022/231919
Status In Force
Filing Date 2022-04-20
Publication Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a gNodeB connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy snoops information and provides it to a BGP module that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF. The BGP module may program the first translation module with an SR policy associated with a binding SID that is bound to an interface to the gNodeB. The SR policy may invoke translation according to a function. The routing module may be programmed to embed GTP information in an SRH header that is used by the first translation module. BGP module may also distribute routing and VPN updates.

IPC Classes  ?

  • H04W 80/00 - Wireless network protocols or protocol adaptations to wireless operation
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04W 40/00 - Communication routing or communication path finding

28.

SELECTIVE IMPORTING OF UE ADDRESSES TO VRF IN 5G NETWORKS

      
Document Number 03216568
Status Pending
Filing Date 2022-04-20
Open to Public Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

Importing of a UE address into a VRF of perimeter equipment is facilitate by receiving a VPN update from the perimeter equipment including a route target of the perimeter equipment and a gNodeB address. In addition, session information is obtained by intercepting traffic between the UE address and a UPF. The session information including the UE address and address of a gNodeB to which the UE is connected. By matching the gNodeB addresses from the VPN update and the session information, the route target of the perimeter equipment to which the UE is connected may be determined. The UE address may then be imported exclusively into the VRF of the perimeter equipment.

IPC Classes  ?

  • H04W 40/06 - Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on characteristics of available antennas
  • H04W 40/24 - Connectivity information management, e.g. connectivity discovery or connectivity update

29.

PFCP SESSION LOAD BALANCER

      
Document Number 03216581
Status Pending
Filing Date 2022-04-20
Open to Public Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

Importing of a UE address into a VRF of perimeter equipment is facilitate by receiving a VPN update from the perimeter equipment including a route target of the perimeter equipment and a gNodeB address. In addition, session information is obtained by intercepting traffic between the UE address and a UPF. The session information including the UE address and address of a gNodeB to which the UE is connected. By matching the gNodeB addresses from the VPN update and the session information, the route target of the perimeter equipment to which the UE is connected may be determined. The UE address may then be imported exclusively into the VRF of the perimeter equipment.

IPC Classes  ?

  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 61/2592 - Translation of Internet protocol [IP] addresses using tunnelling or encapsulation
  • H04L 67/1004 - Server selection for load balancing
  • H04L 67/1023 - Server selection for load balancing based on a hash applied to IP addresses or costs
  • H04L 67/14 - Session management
  • H04W 28/08 - Load balancing or load distribution
  • H04W 80/06 - Transport layer protocols, e.g. TCP [Transport Control Protocol] over wireless

30.

USE OF IP NETWORKS FOR ROUTING OF CELLULAR DATA PACKETS

      
Document Number 03216587
Status Pending
Filing Date 2022-04-20
Open to Public Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a gNodeB connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy snoops information and provides it to a BGP module that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF. The BGP module may program the first translation module with an SR policy associated with a binding SID that is bound to an interface to the gNodeB. The SR policy may invoke translation according to a function. The routing module may be programmed to embed GTP information in an SRH header that is used by the first translation module. BGP module may also distribute routing and VPN updates.

IPC Classes  ?

31.

IMPROVED USE OF IP NETWORKS FOR ROUTING OF CELLULAR DATA PACKETS

      
Document Number 03216613
Status Pending
Filing Date 2022-04-20
Open to Public Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a BBU connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy intercepts control packets of the UPF. Information snooped by the PFCP proxy is provided to a routing/SDN controller that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF.

IPC Classes  ?

  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 61/59 - Network arrangements, protocols or services for addressing or naming using proxies for addressing
  • H04L 69/16 - Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
  • H04L 69/22 - Parsing or analysis of headers

32.

USE OF IP NETWORKS FOR ROUTING OF CELLULAR DATA PACKETS

      
Application Number US2022025549
Publication Number 2022/231905
Status In Force
Filing Date 2022-04-20
Publication Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a gNodeB connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy snoops information and provides it to a BGP module that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF. The BGP module may program the first translation module with an SR policy associated with a binding SID that is bound to an interface to the gNodeB. The SR policy may invoke translation according to a function. The routing module may be programmed to embed GTP information in an SRH header that is used by the first translation module. BGP module may also distribute routing and VPN updates.

IPC Classes  ?

  • H04L 45/24 - Multipath
  • H04L 45/74 - Address processing for routing
  • H04Q 11/04 - Selecting arrangements for multiplex systems for time-division multiplexing

33.

SELECTIVE IMPORTING OF UE ADDRESSES TO VRF IN 5G NETWORKS

      
Application Number US2022025559
Publication Number 2022/231907
Status In Force
Filing Date 2022-04-20
Publication Date 2022-11-03
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

Importing of a UE address into a VRF of perimeter equipment is facilitate by receiving a VPN update from the perimeter equipment including a route target of the perimeter equipment and a gNodeB address. In addition, session information is obtained by intercepting traffic between the UE address and a UPF. The session information including the UE address and address of a gNodeB to which the UE is connected. By matching the gNodeB addresses from the VPN update and the session information, the route target of the perimeter equipment to which the UE is connected may be determined. The UE address may then be imported exclusively into the VRF of the perimeter equipment.

IPC Classes  ?

  • H04W 40/24 - Connectivity information management, e.g. connectivity discovery or connectivity update
  • H04W 40/06 - Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on characteristics of available antennas

34.

Use of IP networks for routing of cellular data packets

      
Application Number 17240726
Grant Number 11632692
Status In Force
Filing Date 2021-04-26
First Publication Date 2022-10-27
Grant Date 2023-04-18
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a BBU connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy intercepts control packets of the UPF. Information snooped by the PFCP proxy is provided to a routing/SDN controller that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF.

IPC Classes  ?

  • H04W 28/02 - Traffic management, e.g. flow control or congestion control
  • H04L 67/56 - Provisioning of proxy services

35.

Use of IP networks for routing of cellular data packets

      
Application Number 17488833
Grant Number 12063583
Status In Force
Filing Date 2021-09-29
First Publication Date 2022-10-27
Grant Date 2024-08-13
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a gNodeB connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy snoops information and provides it to a BGP module that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF. The BGP module may program the first translation module with an SR policy associated with a binding SID that is bound to an interface to the gNodeB. The SR policy may invoke translation according to a function. The routing module may be programmed to embed GTP information in an SRH header that is used by the first translation module. BGP module may also distribute routing and VPN updates.

IPC Classes  ?

  • H04W 40/24 - Connectivity information management, e.g. connectivity discovery or connectivity update
  • H04L 45/02 - Topology update or discovery
  • H04L 61/2592 - Translation of Internet protocol [IP] addresses using tunnelling or encapsulation
  • H04W 80/04 - Network layer protocols, e.g. mobile IP [Internet Protocol]

36.

Use of IP networks for routing of cellular data packets

      
Application Number 17362071
Grant Number 11849381
Status In Force
Filing Date 2021-06-29
First Publication Date 2022-10-27
Grant Date 2023-12-19
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

A cellular data communication network includes a gNodeB connected to a UPF by an IP network. A first translation module translates GFP packets into IP packets transmitted over the IP network. A second translation module translates the IP packets back into IP packets and forwards the IP packets to the UPF. A PFCP proxy snoops information and provides it to a BGP module that programs the translation modules and a routing module to perform routing of packets in bypass of the UPF. The BGP module may program the first translation module with an SR policy associated with a binding SID that is bound to an interface to the gNodeB. The SR policy may invoke translation according to a function. The routing module may be programmed to embed GTP information in an SRH header that is used by the first translation module. BGP module may also distribute routing and VPN updates.

IPC Classes  ?

  • H04W 40/02 - Communication route or path selection, e.g. power-based or shortest path routing
  • H04L 69/08 - Protocols for interworkingProtocol conversion
  • H04L 67/562 - Brokering proxy services

37.

PFCP Session Load Balancer

      
Application Number 17553522
Status Pending
Filing Date 2021-12-16
First Publication Date 2022-10-27
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

Importing of a UE address into a VRF of perimeter equipment is facilitate by receiving a VPN update from the perimeter equipment including a route target of the perimeter equipment and a gNodeB address. In addition, session information is obtained by intercepting traffic between the UE address and a UPF. The session information including the UE address and address of a gNodeB to which the UE is connected. By matching the gNodeB addresses from the VPN update and the session information, the route target of the perimeter equipment to which the UE is connected may be determined. The UE address may then be imported exclusively into the VRF of the perimeter equipment.

IPC Classes  ?

  • H04L 67/101 - Server selection for load balancing based on network conditions
  • H04L 67/1008 - Server selection for load balancing based on parameters of servers, e.g. available memory or workload
  • H04L 67/1027 - Persistence of sessions during load balancing
  • H04L 67/145 - Termination or inactivation of sessions, e.g. event-controlled end of session avoiding end of session, e.g. keep-alive, heartbeats, resumption message or wake-up for inactive or interrupted session
  • H04L 67/141 - Setup of application sessions

38.

Selective importing of UE addresses to VRF in 5G networks

      
Application Number 17553559
Grant Number 12114250
Status In Force
Filing Date 2021-12-16
First Publication Date 2022-10-27
Grant Date 2024-10-08
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Murakami, Tetsuya

Abstract

Importing of a UE address into a VRF of perimeter equipment is facilitate by receiving a VPN update from the perimeter equipment including a route target of the perimeter equipment and a gNodeB address. In addition, session information is obtained by intercepting traffic between the UE address and a UPF. The session information including the UE address and address of a gNodeB to which the UE is connected. By matching the gNodeB addresses from the VPN update and the session information, the route target of the perimeter equipment to which the UE is connected may be determined. The UE address may then be imported exclusively into the VRF of the perimeter equipment.

IPC Classes  ?

  • H04W 40/24 - Connectivity information management, e.g. connectivity discovery or connectivity update
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/64 - Routing or path finding of packets in data switching networks using an overlay routing layer
  • H04L 45/745 - Address table lookupAddress filtering
  • H04W 76/12 - Setup of transport tunnels

39.

BEST PATH COMPUTATION OFFLOAD IN A NETWORK COMPUTING ENVIRONMENT

      
Document Number 03205718
Status Pending
Filing Date 2021-02-03
Open to Public Date 2022-08-11
Owner ARRCUS INC. (USA)
Inventor
  • Pai, Nalinaksh
  • Xu, Feng
  • Aries, Ebben
  • Ayyangar, Arthi
  • Patel, Keyur

Abstract

Systems, methods, and devices for offloading best path computations in a networked computing environment. A method includes storing in memory, by a best path controller, a listing of a plurality of paths learnt by a device, wherein each of the plurality of paths is a route for transmitting data from the device to a destination device. The method includes receiving, by the best path controller, a message from the device. The method includes processing, by the best path controller, a best path computation to identify one or more best paths based on the message such that processing of the best path computation is offloaded from the device to the best path controller. The method includes sending the one or more best paths to the device.

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

40.

BEST PATH COMPUTATION OFFLOAD IN A NETWORK COMPUTING ENVIRONMENT

      
Application Number US2021016467
Publication Number 2022/169446
Status In Force
Filing Date 2021-02-03
Publication Date 2022-08-11
Owner ARRCUS INC. (USA)
Inventor
  • Pai, Nalinaksh
  • Xu, Feng
  • Aries, Ebben
  • Ayyangar, Arthi
  • Patel, Keyur

Abstract

Systems, methods, and devices for offloading best path computations in a networked computing environment. A method includes storing in memory, by a best path controller, a listing of a plurality of paths learnt by a device, wherein each of the plurality of paths is a route for transmitting data from the device to a destination device. The method includes receiving, by the best path controller, a message from the device. The method includes processing, by the best path controller, a best path computation to identify one or more best paths based on the message such that processing of the best path computation is offloaded from the device to the best path controller. The method includes sending the one or more best paths to the device.

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

41.

DISAGGREGATED BORDER GATEWAY PROTOCOL (BGP)

      
Document Number 03195443
Status Pending
Filing Date 2021-10-18
Open to Public Date 2022-04-28
Owner ARRCUS INC. (USA)
Inventor
  • Murakami, Tetsuya
  • Rajaraman, Kalyani
  • Patel, Keyur

Abstract

Disaggregated border gateway protocol (BGP) enables an eBGP session between an internal node an external node to continue despite failover of a perimeter through which the eBGP session is established. eBGP control traffic is trapped by a perimeter router and forwarded to a BGP speaker on the internal node through an IP tunnel. Failover is detected in response to a change in a source address of the IP tunnel over which eBGP control traffic is received. The BGP speaker announces routes to the external node that include a reference to an internal address of an active perimeter router. In response to failover, the BGP speaker announces updated routes referencing the standby router for the perimeter router.

IPC Classes  ?

  • H04L 12/46 - Interconnection of networks
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/58 - Association of routers
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 67/01 - Protocols

42.

SID allocation

      
Application Number 17569286
Grant Number 11909664
Status In Force
Filing Date 2022-01-05
First Publication Date 2022-04-28
Grant Date 2024-02-20
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Rajaraman, Kalyani
  • Vaishampayan, Ravindra
  • Yeung, Derek Man-Kit
  • Kumar, Lalit
  • Murakami, Tetsuya
  • Anderson, Matthew

Abstract

A segment identifier (SID) manager interfaces with clients by way of a library. Clients implementing network services and needing SIDs according to internet SRv6, are allocated blocks by the SID manager using the library. Clients assign SIDs from the block independent of the SID manager using the library. Where a threshold portion of the block is assigned, the library requests an additional block of SIDs from the SID manager. Clients transmit context mappings of assigned SIDs to the SID manager for use by administrators and to enable recovery in the event of failure.

IPC Classes  ?

  • G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
  • H04L 47/78 - Architectures of resource allocation
  • H04L 41/0604 - Management of faults, events, alarms or notifications using filtering, e.g. reduction of information by using priority, element types, position or time
  • H04L 41/0654 - Management of faults, events, alarms or notifications using network fault recovery
  • H04L 47/74 - Admission controlResource allocation measures in reaction to resource unavailability
  • H04L 101/659 - Internet protocol version 6 [IPv6] addresses

43.

DISAGGREGATED BORDER GATEWAY PROTOCOL (BGP)

      
Application Number US2021055474
Publication Number 2022/086878
Status In Force
Filing Date 2021-10-18
Publication Date 2022-04-28
Owner ARRCUS INC. (USA)
Inventor
  • Murakami, Tetsuya
  • Rajaraman, Kalyani
  • Patel, Keyur

Abstract

Disaggregated border gateway protocol (BGP) enables an eBGP session between an internal node an external node to continue despite failover of a perimeter through which the eBGP session is established. eBGP control traffic is trapped by a perimeter router and forwarded to a BGP speaker on the internal node through an IP tunnel. Failover is detected in response to a change in a source address of the IP tunnel over which eBGP control traffic is received. The BGP speaker announces routes to the external node that include a reference to an internal address of an active perimeter router. In response to failover, the BGP speaker announces updated routes referencing the standby router for the perimeter router.

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04J 3/16 - Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
  • G06F 15/163 - Interprocessor communication

44.

Disaggregated border gateway protocol (BGP)

      
Application Number 17078827
Grant Number 11539615
Status In Force
Filing Date 2020-10-23
First Publication Date 2022-04-28
Grant Date 2022-12-27
Owner ARRCUS INC. (USA)
Inventor
  • Murakami, Tetsuya
  • Rajaraman, Kalyani
  • Patel, Keyur

Abstract

Disaggregated border gateway protocol (BGP) enables an eBGP session between an internal node an external node to continue despite failover of a perimeter through which the eBGP session is established. eBGP control traffic is trapped by a perimeter router and forwarded to a BGP speaker on the internal node through an IP tunnel. Failover is detected in response to a change in a source address of the IP tunnel over which eBGP control traffic is received. The BGP speaker announces routes to the external node that include a reference to an internal address of an active perimeter router. In response to failover, the BGP speaker announces updated routes referencing the standby router for the perimeter router.

IPC Classes  ?

  • H04L 45/02 - Topology update or discovery
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 12/46 - Interconnection of networks
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/586 - Association of routers of virtual routers

45.

Asynchronous object manager in a network routing environment

      
Application Number 17539893
Grant Number 11861419
Status In Force
Filing Date 2021-12-01
First Publication Date 2022-03-24
Grant Date 2024-01-02
Owner ARRCUS INC. (USA)
Inventor
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes routing chip hardware and an asynchronous object manager in communication with the routing chip hardware. The asynchronous object manager is configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include asynchronously receiving a plurality of objects from one or more producers. The instructions include identifying one or more dependencies between two or more of the plurality of objects. The instructions include reordering the plurality of objects according to the one or more dependencies. The instructions include determining whether the one or more dependencies is resolve. The instructions include, in response to determining the one or more dependencies is resolved, calling back an application and providing one or more of the plurality of objects to the application.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • G06F 16/23 - Updating
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 45/48 - Routing tree calculation
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/24 - Multipath
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

46.

Host routed overlay with deterministic host learning and localized integrated routing and bridging

      
Application Number 17527890
Grant Number 11675637
Status In Force
Filing Date 2021-11-16
First Publication Date 2022-03-10
Grant Date 2023-06-13
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Bush, Randy
  • Keszei, Csaba
  • Austein, Robert
  • Kovuru, Harsha Vardhan

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (TRB) service for the plurality of host virtual machines of the host routed overlay.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 45/48 - Routing tree calculation
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/24 - Multipath
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

47.

Routing optimizations in a network computing environment

      
Application Number 17530163
Grant Number 11972306
Status In Force
Filing Date 2021-11-18
First Publication Date 2022-03-10
Grant Date 2024-04-30
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a spine node and a plurality of leaf nodes. The system is such that at least one of the plurality of leaf nodes is associated with one or more networking prefixes. The spine node stores a prefix table. The prefix table includes a listing of networking prefixes in the network topology. The prefix table includes an indication of at least one equal-cost multipath routing (ECMP) group associated with each of the networking prefixes in the network topology. The prefix table includes an indication of at least one leaf node of the plurality of leaf nodes associated with each of the networking prefixes in the network topology.

IPC Classes  ?

  • H04L 12/701 - Routing or path finding
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • G06F 9/54 - Interprogram communication
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 16/23 - Updating
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • H04L 12/741 - Header address processing for routing, e.g. table lookup
  • H04L 12/753 - Routing tree discovery, e.g. converting from mesh topology to tree topology
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

48.

HIGH AVAILABILITY NETWORK ADDRESS TRANSLATION

      
Document Number 03189870
Status Pending
Filing Date 2021-08-18
Open to Public Date 2022-02-24
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Gopinathan, Sujay
  • Kannan, Sreekanth
  • Ayyangar, Arthi

Abstract

A computing environment, such as a cloud computing environment, may include nodes performing NAT for a plurality of workloads. An active node performs NAT for the workloads, including maintaining a NAT table. The active node may create sub-interfaces for the workloads and function as a DHCP server. The NAT table and sub-interfaces may be recreated on a standby node. Upon detecting failure, a routing table is updated to direct workloads to connect to the standby node and traffic may continue to be processed by the standby node without disrupting network or application sessions.

IPC Classes  ?

  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 12/46 - Interconnection of networks
  • H04L 41/0668 - Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 61/2514 - Translation of Internet protocol [IP] addresses between local and global IP addresses
  • H04L 61/2567 - NAT traversal for reachability, e.g. inquiring the address of a correspondent behind a NAT server
  • H04L 61/2596 - Translation of addresses of the same type other than IP, e.g. translation from MAC to MAC addresses
  • H04L 69/16 - Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]

49.

High availability network address translation

      
Application Number 17000189
Grant Number 11997064
Status In Force
Filing Date 2020-08-21
First Publication Date 2022-02-24
Grant Date 2024-05-28
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Gopinathan, Sujay
  • Kannan, Sreekanth
  • Ayyangar, Arthi

Abstract

A computing environment, such as a cloud computing environment, may include nodes performing NAT for a plurality of workloads. An active node performs NAT for the workloads, including maintaining a NAT table. The active node may create sub-interfaces for the workloads and function as a DHCP server. The NAT table and sub-interfaces may be recreated on a standby node. Upon detecting failure, a routing table is updated to direct workloads to connect to the standby node and traffic may continue to be processed by the standby node without disrupting network or application sessions.

IPC Classes  ?

  • H04L 61/2567 - NAT traversal for reachability, e.g. inquiring the address of a correspondent behind a NAT server
  • H04L 12/46 - Interconnection of networks
  • H04L 41/0816 - Configuration setting characterised by the conditions triggering a change of settings the condition being an adaptation, e.g. in response to network events
  • H04L 67/1008 - Server selection for load balancing based on parameters of servers, e.g. available memory or workload
  • H04L 67/1034 - Reaction to server failures by a load balancer
  • H04L 101/622 - Layer-2 addresses, e.g. medium access control [MAC] addresses

50.

HIGH AVAILABILITY NETWORK ADDRESS TRANSLATION

      
Application Number US2021046551
Publication Number 2022/040344
Status In Force
Filing Date 2021-08-18
Publication Date 2022-02-24
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Gopinathan, Sujay
  • Kannan, Sreekanth
  • Ayyangar, Arthi

Abstract

A computing environment, such as a cloud computing environment, may include nodes performing NAT for a plurality of workloads. An active node performs NAT for the workloads, including maintaining a NAT table. The active node may create sub-interfaces for the workloads and function as a DHCP server. The NAT table and sub-interfaces may be recreated on a standby node. Upon detecting failure, a routing table is updated to direct workloads to connect to the standby node and traffic may continue to be processed by the standby node without disrupting network or application sessions.

IPC Classes  ?

  • H04L 29/12 - Arrangements, apparatus, circuits or systems, not covered by a single one of groups characterised by the data terminal

51.

SID allocation

      
Application Number 16783931
Grant Number 11252101
Status In Force
Filing Date 2020-02-06
First Publication Date 2022-02-15
Grant Date 2022-02-15
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Rajaraman, Kalyani
  • Vaishampayan, Ravindra
  • Yeung, Derek Man-Kit
  • Kumar, Lalit
  • Murakami, Tetsuya
  • Anderson, Matthew

Abstract

A segment identifier (SID) manager interfaces with clients by way of a library. Clients implementing network services and needing SIDs according to internet SRv6, are allocated blocks by the SID manager using the library. Clients assign SIDs from the block independent of the SID manager using the library. Where a threshold portion of the block is assigned, the library requests an additional block of SIDs from the SID manager. Clients transmit context mappings of assigned SIDs to the SID manager for use by administrators and to enable recovery in the event of failure.

IPC Classes  ?

  • G06F 15/173 - Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star or snowflake
  • H04L 12/911 - Network admission control and resource allocation, e.g. bandwidth allocation or in-call renegotiation
  • H04L 12/24 - Arrangements for maintenance or administration
  • H04L 29/12 - Arrangements, apparatus, circuits or systems, not covered by a single one of groups characterised by the data terminal

52.

Independent datastore in a network routing environment

      
Application Number 17469609
Grant Number 11693716
Status In Force
Filing Date 2021-09-08
First Publication Date 2021-12-30
Grant Date 2023-07-04
Owner ARRCUS INC. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

IPC Classes  ?

  • G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
  • G06F 9/54 - Interprogram communication
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 45/48 - Routing tree calculation
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/24 - Multipath
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

53.

Best path computation offload in a network computing environment

      
Application Number 17400929
Grant Number 12261767
Status In Force
Filing Date 2021-08-12
First Publication Date 2021-12-02
Grant Date 2025-03-25
Owner Arrcus Inc. (USA)
Inventor
  • Pai, Nalinaksh
  • Xu, Feng
  • Aries, Ebben
  • Ayyangar, Arthi
  • Patel, Keyur

Abstract

Systems, methods, and devices for offloading best path computations in a networked computing environment. A method includes storing in memory, by a best path controller, a listing of a plurality of paths learnt by a device, wherein each of the plurality of paths is a route for transmitting data from the device to a destination device. The method includes receiving, by the best path controller, a message from the device. The method includes processing, by the best path controller, a best path computation to identify one or more best paths based on the message such that processing of the best path computation is offloaded from the device to the best path controller. The method includes sending the one or more best paths to the device.

IPC Classes  ?

  • H04L 45/24 - Multipath
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/122 - Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
  • H04L 45/42 - Centralised routing
  • H04L 45/58 - Association of routers

54.

IMPROVED SID ALLOCATION

      
Document Number 03167179
Status Pending
Filing Date 2021-01-28
Open to Public Date 2021-08-12
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Rajaraman, Kalyani
  • Vaishampayan, Ravindra
  • Yeung, Derek Man-Kit
  • Kumar, Lalit
  • Murakami, Tetsuya
  • Anderson, Matthew

Abstract

A segment identifier (SID) manager interfaces with clients by way of a library. Clients implementing network services and needing SIDs according to internet SRv6, are allocated blocks by the SID manager using the library. Clients assign SIDs from the block independent of the SID manager using the library. Where a threshold portion of the block is assigned, the library requests an additional block of SIDs from the SID manager. Clients transmit context mappings of assigned SIDs to the SID manager for use by administrators and to enable recovery in the event of failure.

IPC Classes  ?

  • H04L 41/0654 - Management of faults, events, alarms or notifications using network fault recovery
  • H04L 45/64 - Routing or path finding of packets in data switching networks using an overlay routing layer
  • H04L 45/74 - Address processing for routing

55.

IMPROVED SID ALLOCATION

      
Application Number US2021015565
Publication Number 2021/158428
Status In Force
Filing Date 2021-01-28
Publication Date 2021-08-12
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Rajaraman, Kalyani
  • Vaishampayan, Ravindra
  • Yeung, Derek, Man-Kit
  • Kumar, Lalit
  • Murakami, Tetsuya
  • Anderson, Matthew

Abstract

A segment identifier (SID) manager interfaces with clients by way of a library. Clients implementing network services and needing SIDs according to internet SRv6, are allocated blocks by the SID manager using the library. Clients assign SIDs from the block independent of the SID manager using the library. Where a threshold portion of the block is assigned, the library requests an additional block of SIDs from the SID manager. Clients transmit context mappings of assigned SIDs to the SID manager for use by administrators and to enable recovery in the event of failure.

IPC Classes  ?

  • H04L 12/781 - Multiprotocol routing, e.g. for protocol adaptation between IPv4 and IPv6 or dual stack
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/751 - Topology update or discovery

56.

Logical router comprising disaggregated network elements

      
Application Number 17210218
Grant Number 11863351
Status In Force
Filing Date 2021-03-23
First Publication Date 2021-07-08
Grant Date 2024-01-02
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/00 - Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
  • H04L 12/46 - Interconnection of networks
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 41/0668 - Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
  • H04L 49/552 - Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections
  • H04L 12/44 - Star or tree networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 41/0893 - Assignment of logical groups to network elements
  • H04L 47/52 - Queue scheduling by attributing bandwidth to queues
  • H04L 49/10 - Packet switching elements characterised by the switching fabric construction
  • H04L 49/354 - Switches specially adapted for specific applications for supporting virtual local area networks [VLAN]

57.

Best path computation offload in a network computing environment

      
Application Number 16672964
Grant Number 11121963
Status In Force
Filing Date 2019-11-04
First Publication Date 2021-05-06
Grant Date 2021-09-14
Owner Arrcus Inc. (USA)
Inventor
  • Pai, Nalinaksh
  • Xu, Feng
  • Aries, Ebben
  • Ayyangar, Arthi
  • Patel, Keyur

Abstract

Systems, methods, and devices for offloading best path computations in a networked computing environment. A method includes storing in memory, by a best path controller, a listing of a plurality of paths learnt by a device, wherein each of the plurality of paths is a route for transmitting data from the device to a destination device. The method includes receiving, by the best path controller, a message from the device. The method includes processing, by the best path controller, a best path computation to identify one or more best paths based on the message such that processing of the best path computation is offloaded from the device to the best path controller. The method includes sending the one or more best paths to the device.

IPC Classes  ?

  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • H04L 12/733 - Selecting a path with minimum length or minimum hop count
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • H04L 12/717 - Centralised routing
  • H04L 12/775 - Router architecture multiple routing entities, e.g. multiple software or hardware instances

58.

ARCEDGE

      
Serial Number 90016193
Status Registered
Filing Date 2020-06-23
Registration Date 2021-09-07
Owner Arrcus, Inc. ()
NICE Classes  ?
  • 09 - Scientific and electric apparatus and instruments
  • 42 - Scientific, technological and industrial services, research and design

Goods & Services

Downloadable computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; downloadable operating system programs; downloadable WAN (wide area network) and SD-WAN (software defined wide area network) and operating software; downloadable computer software for use in securing and controlling WAN (wide area network) traffic, for multi-cloud networking, and for real-time monitoring and historical reporting of application, location and networking statistics; downloadable software for creating, delivering, deploying, configuring, orchestrating, integrating and managing virtualized computer applications in the fields of communications, data security, computer system performance, security and monitoring, data center deployment, management, and reference architecture; downloadable software for use in configuring, managing, monitoring, supporting and securing data, virtualization and computer hardware, applications and networks in the field of communications Providing temporary use of non-downloadable, cloud-based networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; providing temporary use of non-downloadable operating system programs and WAN (wide area network) and SD-WAN (software defined wide area network) operating software; providing temporary use of non-downloadable computer software for use in securing and controlling WAN (wide area network) traffic, for multi-cloud networking, and for real-time monitoring and historical reporting of application, location and networking statistics; providing temporary use of non-downloadable computer software for creating, delivering, deploying, configuring, orchestrating, integrating and managing virtualized computer applications in the fields of communications, data security, computer system performance, security and monitoring, data center deployment, management, and reference architecture; providing temporary use of non-downloadable software for use in configuring, managing, monitoring, supporting and securing data, virtualization and computer hardware, applications and networks in the field of communications; computer services, namely, providing technical consultation in the field of connectivity, interoperability and management capability among networked components and systems

59.

ARCORCHESTRATOR

      
Serial Number 90016200
Status Registered
Filing Date 2020-06-23
Registration Date 2022-05-24
Owner Arrcus, Inc. ()
NICE Classes  ?
  • 09 - Scientific and electric apparatus and instruments
  • 42 - Scientific, technological and industrial services, research and design

Goods & Services

Downloadable computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; downloadable operating system programs; downloadable WAN (wide area network) and SD-WAN (software defined wide area network) and operating software; downloadable computer software for use in securing and controlling WAN (wide area network) traffic, for multi-cloud networking, and for real-time monitoring and historical reporting of application, location and networking statistics; downloadable software for creating, delivering, deploying, configuring, orchestrating, integrating and managing virtualized computer applications in the fields of communications, data security, computer system performance, security and monitoring, data center deployment, management, and reference architecture; downloadable software for use in configuring, managing, monitoring, supporting and securing data, virtualization and computer hardware, applications and networks in the field of communications Providing temporary use of non-downloadable, cloud-based networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; providing temporary use of non-downloadable operating system programs and WAN (wide area network) and SD-WAN (software defined wide area network) operating software; providing temporary use of non-downloadable computer software for use in securing and controlling WAN (wide area network) traffic, for multi-cloud networking, and for real-time monitoring and historical reporting of application, location and networking statistics; providing temporary use of non-downloadable computer software for creating, delivering, deploying, configuring, orchestrating, integrating and managing virtualized computer applications in the fields of communications, data security, computer system performance, security and monitoring, data center deployment, management, and reference architecture; providing temporary use of non-downloadable software for use in configuring, managing, monitoring, supporting and securing data, virtualization and computer hardware, applications and networks in the field of communications; computer services, namely, providing technical consultation in the field of connectivity, interoperability and management capability among networked components and systems

60.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Document Number 03120743
Status Pending
Filing Date 2019-11-26
Open to Public Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/38 - Information transfer, e.g. on bus
  • G06F 13/40 - Bus structure
  • G06F 15/00 - Digital computers in generalData processing equipment in general
  • H04Q 11/00 - Selecting arrangements for multiplex systems
  • H04W 40/00 - Communication routing or communication path finding

61.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Document Number 03120746
Status Pending
Filing Date 2019-11-26
Open to Public Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

62.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Application Number US2019063229
Publication Number 2020/112756
Status In Force
Filing Date 2019-11-26
Publication Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kaiyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • H04L 12/46 - Interconnection of networks
  • H04L 12/44 - Star or tree networks
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

63.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Application Number US2019063268
Publication Number 2020/112786
Status In Force
Filing Date 2019-11-26
Publication Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • H04L 12/931 - Switch fabric architecture
  • H04L 12/947 - Address processing within a device, e.g. using internal ID or tags for routing within a switch
  • H04L 12/741 - Header address processing for routing, e.g. table lookup

64.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Document Number 03120710
Status Pending
Filing Date 2019-11-26
Open to Public Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kaiyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks

65.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Document Number 03124394
Status Pending
Filing Date 2019-11-26
Open to Public Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • H04L 12/44 - Star or tree networks
  • H04L 41/0668 - Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
  • H04L 41/0893 - Assignment of logical groups to network elements
  • H04L 41/12 - Discovery or management of network topologies
  • H04L 45/02 - Topology update or discovery
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/44 - Distributed routing
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/60 - Router architectures
  • H04L 47/52 - Queue scheduling by attributing bandwidth to queues
  • H04L 49/10 - Packet switching elements characterised by the switching fabric construction
  • H04L 49/354 - Switches specially adapted for specific applications for supporting virtual local area networks [VLAN]
  • H04L 49/40 - Constructional details, e.g. power supply, mechanical construction or backplane
  • H04L 49/552 - Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections

66.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Application Number US2019063313
Publication Number 2020/112817
Status In Force
Filing Date 2019-11-26
Publication Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/38 - Information transfer, e.g. on bus
  • G06F 13/40 - Bus structure
  • G06F 15/00 - Digital computers in generalData processing equipment in general
  • H04Q 11/00 - Selecting arrangements for multiplex systems
  • H04W 40/00 - Communication routing or communication path finding

67.

LOGICAL ROUTER COMPRISING DISAGGREGATED NETWORK ELEMENTS

      
Application Number US2019063331
Publication Number 2020/112831
Status In Force
Filing Date 2019-11-26
Publication Date 2020-06-04
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

68.

Logical router comprising disaggregated network elements

      
Application Number 16695796
Grant Number 10992497
Status In Force
Filing Date 2019-11-26
First Publication Date 2020-05-28
Grant Date 2021-04-27
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/00 - Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
  • H04L 12/46 - Interconnection of networks
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 12/24 - Arrangements for maintenance or administration
  • H04L 12/939 - Provisions for redundant switching, e.g. using parallel switching planes
  • H04L 12/44 - Star or tree networks
  • H04L 12/751 - Topology update or discovery
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/873 - Bandwidth-aware scheduling
  • H04L 12/933 - Switch core, e.g. crossbar, shared memory or shared medium
  • H04L 12/931 - Switch fabric architecture

69.

Logical router comprising disaggregated network elements

      
Application Number 16695913
Grant Number 11343121
Status In Force
Filing Date 2019-11-26
First Publication Date 2020-05-28
Grant Date 2022-05-24
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/00 - Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
  • H04L 12/46 - Interconnection of networks
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 41/0668 - Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
  • H04L 49/552 - Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections
  • H04L 12/44 - Star or tree networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 41/0893 - Assignment of logical groups to network elements
  • H04L 47/52 - Queue scheduling by attributing bandwidth to queues
  • H04L 49/10 - Packet switching elements characterised by the switching fabric construction
  • H04L 49/354 - Switches specially adapted for specific applications for supporting virtual local area networks [VLAN]

70.

Logical router comprising disaggregated network elements

      
Application Number 16696106
Grant Number 11082261
Status In Force
Filing Date 2019-11-26
First Publication Date 2020-05-28
Grant Date 2021-08-03
Owner Arrcus Inc. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/00 - Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
  • H04L 12/46 - Interconnection of networks
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 12/24 - Arrangements for maintenance or administration
  • H04L 12/939 - Provisions for redundant switching, e.g. using parallel switching planes
  • H04L 12/44 - Star or tree networks
  • H04L 12/751 - Topology update or discovery
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/873 - Bandwidth-aware scheduling
  • H04L 12/933 - Switch core, e.g. crossbar, shared memory or shared medium
  • H04L 12/931 - Switch fabric architecture

71.

Logical router comprising disaggregated network elements

      
Application Number 16696279
Grant Number 10965496
Status In Force
Filing Date 2019-11-26
First Publication Date 2020-05-28
Grant Date 2021-03-30
Owner ARRCUS INC. (USA)
Inventor
  • Patel, Keyur
  • Pai, Nalinaksh
  • Bush, Randall
  • Ragukumar, Vikram
  • Shanker, Ashutosh
  • Rajaraman, Kalyani
  • Austein, Robert
  • Aries, Ebben
  • Kumar, Lalit
  • Pitchai, Sridhar
  • Gurusamy, Rajkumar

Abstract

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

IPC Classes  ?

  • G06F 13/00 - Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
  • H04L 12/46 - Interconnection of networks
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 12/24 - Arrangements for maintenance or administration
  • H04L 12/939 - Provisions for redundant switching, e.g. using parallel switching planes
  • H04L 12/44 - Star or tree networks
  • H04L 12/751 - Topology update or discovery
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/873 - Bandwidth-aware scheduling
  • H04L 12/933 - Switch core, e.g. crossbar, shared memory or shared medium
  • H04L 12/931 - Switch fabric architecture

72.

ARCRR

      
Serial Number 88866501
Status Registered
Filing Date 2020-04-09
Registration Date 2020-10-27
Owner Arrcus, Inc. ()
NICE Classes  ? 09 - Scientific and electric apparatus and instruments

Goods & Services

Downloadable computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; downloadable operating system programs

73.

FIRST HOP GATEWAY REDUNDANCY IN A NETWORK COMPUTING ENVIRONMENT

      
Document Number 03109923
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Kreeger, Lawrence Rolfe
  • Shah, Shitanshu
  • Kumar, Lalit
  • Rajaraman, Kalyani
  • Ragukumar, Vickram
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a first switch and a second switch in a network topology. The system includes a host virtual machine in communication with at least one of the first switch and the second switch. The system includes a routed peer link connecting the first switch to the second switch. The system is such that the first switch and the second switch have the same Internet protocol (IP) address and media access control (MAC) address.

IPC Classes  ?

  • H04L 12/44 - Star or tree networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/30 - Routing of multiclass traffic
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

74.

INDEPENDENT DATASTORE IN A NETWORK ROUTING ENVIRONMENT

      
Document Number 03109946
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

IPC Classes  ?

  • G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
  • G06F 15/173 - Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star or snowflake
  • H04L 12/44 - Star or tree networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/30 - Routing of multiclass traffic
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

75.

Independent datastore in a network routing environment

      
Application Number 16549315
Grant Number 11140070
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2021-10-05
Owner Arrcus Inc. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

IPC Classes  ?

  • G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
  • G06F 9/54 - Interprogram communication
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol
  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/753 - Routing tree discovery, e.g. converting from mesh topology to tree topology
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/751 - Topology update or discovery
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 12/703 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP]
  • H04L 12/741 - Header address processing for routing, e.g. table lookup
  • H04L 12/803 - Load balancing, e.g. traffic distribution over multiple links
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
  • H04L 12/947 - Address processing within a device, e.g. using internal ID or tags for routing within a switch

76.

Routing optimizations in a network computing environment

      
Application Number 16549439
Grant Number 11212215
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2021-12-28
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a spine node and a plurality of leaf nodes. The system is such that at least one of the plurality of leaf nodes is associated with one or more networking prefixes. The spine node stores a prefix table. The prefix table includes a listing of networking prefixes in the network topology. The prefix table includes an indication of at least one equal-cost multipath routing (ECMP) group associated with each of the networking prefixes in the network topology. The prefix table includes an indication of at least one leaf node of the plurality of leaf nodes associated with each of the networking prefixes in the network topology.

IPC Classes  ?

  • H04L 12/701 - Routing or path finding
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • H04L 12/753 - Routing tree discovery, e.g. converting from mesh topology to tree topology
  • H04L 12/741 - Header address processing for routing, e.g. table lookup
  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/751 - Topology update or discovery
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 12/703 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP]
  • H04L 12/803 - Load balancing, e.g. traffic distribution over multiple links
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
  • H04L 12/947 - Address processing within a device, e.g. using internal ID or tags for routing within a switch

77.

Host routed overlay with deterministic host learning and localized integrated routing and bridging

      
Application Number 16549731
Grant Number 11206208
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2021-12-21
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Bush, Randall
  • Keszei, Csaba
  • Austein, Robert
  • Kovuru, Harsha Vardhan

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

IPC Classes  ?

  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/753 - Routing tree discovery, e.g. converting from mesh topology to tree topology
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/751 - Topology update or discovery
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 12/703 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP]
  • H04L 12/741 - Header address processing for routing, e.g. table lookup
  • H04L 12/803 - Load balancing, e.g. traffic distribution over multiple links
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
  • H04L 12/947 - Address processing within a device, e.g. using internal ID or tags for routing within a switch

78.

Loop conflict avoidance in a spine-and-leaf network topology

      
Application Number 16549752
Grant Number 11134006
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2021-09-28
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

IPC Classes  ?

  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/753 - Routing tree discovery, e.g. converting from mesh topology to tree topology
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/751 - Topology update or discovery
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 12/703 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP]
  • H04L 12/741 - Header address processing for routing, e.g. table lookup
  • H04L 12/803 - Load balancing, e.g. traffic distribution over multiple links
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
  • H04L 12/947 - Address processing within a device, e.g. using internal ID or tags for routing within a switch

79.

First hop gateway redundancy in a network computing environment

      
Application Number 16549852
Grant Number 12106160
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2024-10-01
Owner Arrcus Inc. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Kreeger, Lawrence Rolfe
  • Shah, Shitanshu
  • Kumar, Lalit
  • Rajaraman, Kalyani
  • Ragukumar, Vikram
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a first switch and a second switch in a network topology. The system includes a host virtual machine in communication with at least one of the first switch and the second switch. The system includes a routed peer link connecting the first switch to the second switch. The system is such that the first switch and the second switch have the same Internet protocol (IP) address and media access control (MAC) address.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 16/23 - Updating
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

80.

ASYNCHRONOUS OBJECT MANAGER IN A NETWORK ROUTING ENVIRONMENT

      
Application Number US2019047844
Publication Number 2020/041666
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes routing chip hardware and an asynchronous object manager in communication with the routing chip hardware. The asynchronous object manager is configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include asynchronously receiving a plurality of objects from one or more producers. The instructions include identifying one or more dependencies between two or more of the plurality of objects. The instructions include reordering the plurality of objects according to the one or more dependencies. The instructions include determining whether the one or more dependencies is resolve. The instructions include, in response to determining the one or more dependencies is resolved, calling back an application and providing one or more of the plurality of objects to the application.

IPC Classes  ?

  • G06F 13/28 - Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access, cycle steal
  • G06F 13/38 - Information transfer, e.g. on bus
  • G06F 17/30 - Information retrieval; Database structures therefor
  • H04B 7/26 - Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
  • H04W 4/00 - Services specially adapted for wireless communication networksFacilities therefor
  • H04W 56/00 - Synchronisation arrangements

81.

ROUTING OPTIMIZATIONS IN A NETWORK COMPUTING ENVIRONMENT

      
Application Number US2019047902
Publication Number 2020/041699
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek, Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a spine node and a plurality of leaf nodes. The system is such that at least one of the plurality of leaf nodes is associated with one or more networking prefixes. The spine node stores a prefix table. The prefix table includes a listing of networking prefixes in the network topology. The prefix table includes an indication of at least one equal-cost multipath routing (ECMP) group associated with each of the networking prefixes in the network topology. The prefix table includes an indication of at least one leaf node of the plurality of leaf nodes associated with each of the networking prefixes in the network topology.

IPC Classes  ?

  • H04L 12/24 - Arrangements for maintenance or administration
  • G06N 99/00 - Subject matter not provided for in other groups of this subclass
  • H04L 12/26 - Monitoring arrangements; Testing arrangements
  • H04L 12/56 - Packet switching systems

82.

LOOP CONFLICT AVOIDANCE IN A NETWORK COMPUTING ENVIRONMENT

      
Application Number US2019047948
Publication Number 2020/041729
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek, Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

IPC Classes  ?

  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • H04L 12/18 - Arrangements for providing special services to substations for broadcast or conference
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/56 - Packet switching systems
  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy

83.

ASYNCHRONOUS OBJECT MANAGER IN A NETWORK ROUTING ENVIRONMENT

      
Document Number 03109935
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes routing chip hardware and an asynchronous object manager in communication with the routing chip hardware. The asynchronous object manager is configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include asynchronously receiving a plurality of objects from one or more producers. The instructions include identifying one or more dependencies between two or more of the plurality of objects. The instructions include reordering the plurality of objects according to the one or more dependencies. The instructions include determining whether the one or more dependencies is resolve. The instructions include, in response to determining the one or more dependencies is resolved, calling back an application and providing one or more of the plurality of objects to the application.

IPC Classes  ?

  • G06F 13/28 - Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access, cycle steal
  • G06F 13/38 - Information transfer, e.g. on bus
  • H04B 7/26 - Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
  • H04W 4/00 - Services specially adapted for wireless communication networksFacilities therefor
  • H04W 56/00 - Synchronisation arrangements

84.

ROUTING OPTIMIZATIONS IN A NETWORK COMPUTING ENVIRONMENT

      
Document Number 03109939
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a spine node and a plurality of leaf nodes. The system is such that at least one of the plurality of leaf nodes is associated with one or more networking prefixes. The spine node stores a prefix table. The prefix table includes a listing of networking prefixes in the network topology. The prefix table includes an indication of at least one equal-cost multipath routing (ECMP) group associated with each of the networking prefixes in the network topology. The prefix table includes an indication of at least one leaf node of the plurality of leaf nodes associated with each of the networking prefixes in the network topology.

IPC Classes  ?

  • G06N 99/00 - Subject matter not provided for in other groups of this subclass
  • H04L 12/44 - Star or tree networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/30 - Routing of multiclass traffic
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

85.

SINGLE NODE AND MULTIPLE NODE DATASTORE ARCHITECTURE IN A NETWORK ROUTING ENVIRONMENT

      
Document Number 03109941
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a plurality of instances of a datastore node in a single networking device, each of the plurality of instances of the datastore node comprising: a datastore; a publisher independent of the datastore for publishing data to the datastore; a subscriber independent of the datastore for receiving information from the datastore; a replicator agent configured to connect to the datastore as a publisher or a subscriber; and a persistent storage agent configured to connect to the datastore as a publisher or a subscriber.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • H04L 12/44 - Star or tree networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/30 - Routing of multiclass traffic
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

86.

HOST ROUTED OVERLAY WITH DETERMINISTIC HOST LEARNING AND LOCALIZED INTEGRATED ROUTING AND BRIDGING

      
Document Number 03109948
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Bush, Randall
  • Keszei, Csaba
  • Austein, Robert
  • Kovuru, Harsha Vardhan

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

IPC Classes  ?

  • G06F 15/177 - Initialisation or configuration control
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/30 - Routing of multiclass traffic
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

87.

LOOP CONFLICT AVOIDANCE IN A NETWORK COMPUTING ENVIRONMENT

      
Document Number 03109950
Status Pending
Filing Date 2019-08-23
Open to Public Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

IPC Classes  ?

  • H04L 12/18 - Arrangements for providing special services to substations for broadcast or conference
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/44 - Star or tree networks
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • H04L 45/24 - Multipath
  • H04L 45/28 - Routing or path finding of packets in data switching networks using route fault recovery
  • H04L 45/30 - Routing of multiclass traffic
  • H04L 45/48 - Routing tree calculation
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 49/25 - Routing or path finding in a switch fabric
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services

88.

Asynchronous object manager in a network routing environment

      
Application Number 16549215
Grant Number 11221893
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2022-01-11
Owner ARRCUS INC. (USA)
Inventor
  • Pai, Nalinaksh
  • Rajaraman, Kalyani
  • Ragukumar, Vikram

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes routing chip hardware and an asynchronous object manager in communication with the routing chip hardware. The asynchronous object manager is configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include asynchronously receiving a plurality of objects from one or more producers. The instructions include identifying one or more dependencies between two or more of the plurality of objects. The instructions include reordering the plurality of objects according to the one or more dependencies. The instructions include determining whether the one or more dependencies is resolve. The instructions include, in response to determining the one or more dependencies is resolved, calling back an application and providing one or more of the plurality of objects to the application.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • H04L 12/707 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using path redundancy
  • G06F 16/23 - Updating
  • H04L 12/723 - Label or tag based routing, e.g. multi-protocol label switching [MPLS] or generalised multi-protocol label switching [GMPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 12/753 - Routing tree discovery, e.g. converting from mesh topology to tree topology
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/751 - Topology update or discovery
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 12/703 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP]
  • H04L 12/741 - Header address processing for routing, e.g. table lookup
  • H04L 12/803 - Load balancing, e.g. traffic distribution over multiple links
  • H04L 29/06 - Communication control; Communication processing characterised by a protocol
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
  • H04L 12/947 - Address processing within a device, e.g. using internal ID or tags for routing within a switch

89.

Single node and multiple node datastore architecture in a network routing environment

      
Application Number 16549369
Grant Number 11868824
Status In Force
Filing Date 2019-08-23
First Publication Date 2020-02-27
Grant Date 2024-01-09
Owner ARRCUS INC. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence Rolfe
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a plurality of instances of a datastore node in a single networking device, each of the plurality of instances of the datastore node comprising: a datastore; a publisher independent of the datastore for publishing data to the datastore; a subscriber independent of the datastore for receiving information from the datastore; a replicator agent configured to connect to the datastore as a publisher or a subscriber; and a persistent storage agent configured to connect to the datastore as a publisher or a subscriber.

IPC Classes  ?

  • G06F 16/20 - Information retrievalDatabase structures thereforFile system structures therefor of structured data, e.g. relational data
  • G06F 9/54 - Interprogram communication
  • H04L 45/00 - Routing or path finding of packets in data switching networks
  • H04L 45/50 - Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
  • H04L 12/44 - Star or tree networks
  • H04L 12/46 - Interconnection of networks
  • H04L 45/48 - Routing tree calculation
  • G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
  • G06F 16/23 - Updating
  • G06F 16/22 - IndexingData structures thereforStorage structures
  • G06F 9/455 - EmulationInterpretationSoftware simulation, e.g. virtualisation or emulation of application or operating system execution engines
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 45/02 - Topology update or discovery
  • G06F 9/48 - Program initiatingProgram switching, e.g. by interrupt
  • H04L 45/24 - Multipath
  • H04L 45/745 - Address table lookupAddress filtering
  • H04L 47/125 - Avoiding congestionRecovering from congestion by balancing the load, e.g. traffic engineering
  • H04L 9/40 - Network security protocols
  • H04L 12/28 - Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
  • H04L 45/586 - Association of routers of virtual routers
  • H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
  • H04L 67/55 - Push-based network services
  • H04L 49/25 - Routing or path finding in a switch fabric

90.

INDEPENDENT DATASTORE IN A NETWORK ROUTING ENVIRONMENT

      
Application Number US2019047857
Publication Number 2020/041674
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek, Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence, Rolfe

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a publisher device in a network computing environment. The system includes a subscriber device in the network computing environment. The system includes a datastore independent of the publisher device and the subscriber device, the datastore comprising one or more processors in a processing platform configurable to execute instructions stored in non-transitory computer readable storage media. The instructions includes receiving data from the publisher device. The instructions include storing the data across one or more of a plurality of shared storage devices. The instructions include providing the data to the subscriber device.

IPC Classes  ?

  • G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
  • G06F 15/173 - Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star or snowflake
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure

91.

SINGLE NODE AND MULTIPLE NODE DATASTORE ARCHITECTURE IN A NETWORK ROUTING ENVIRONMENT

      
Application Number US2019047873
Publication Number 2020/041681
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Sarkar, Pushpasis
  • Patel, Keyur
  • Yeung, Derek, Man-Kit
  • Patel, Alpesh
  • Kreeger, Lawrence, Rolfe
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for offloading network data to a datastore. A system includes a plurality of instances of a datastore node in a single networking device, each of the plurality of instances of the datastore node comprising: a datastore; a publisher independent of the datastore for publishing data to the datastore; a subscriber independent of the datastore for receiving information from the datastore; a replicator agent configured to connect to the datastore as a publisher or a subscriber; and a persistent storage agent configured to connect to the datastore as a publisher or a subscriber.

IPC Classes  ?

  • G06F 9/54 - Interprogram communication
  • H04L 12/701 - Routing or path finding
  • H04L 29/08 - Transmission control procedure, e.g. data link level control procedure

92.

HOST ROUTED OVERLAY WITH DETERMINISTIC HOST LEARNING AND LOCALIZED INTEGRATED ROUTING AND BRIDGING

      
Application Number US2019047946
Publication Number 2020/041727
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Bush, Randy
  • Keszei, Csaba
  • Austein, Robert
  • Kovuru, Harsha, Vardhan

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

IPC Classes  ?

  • G06F 15/177 - Initialisation or configuration control
  • H04L 12/46 - Interconnection of networks
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP

93.

FIRST HOP GATEWAY REDUNDANCY IN A NETWORK COMPUTING ENVIRONMENT

      
Application Number US2019047970
Publication Number 2020/041742
Status In Force
Filing Date 2019-08-23
Publication Date 2020-02-27
Owner ARRCUS INC. (USA)
Inventor
  • Malhotra, Neeraj
  • Patel, Keyur
  • Yeung, Derek, Man-Kit
  • Kreeger, Lawrence, Rolfe
  • Shah, Shitanshu
  • Kumar, Lalit
  • Rajaraman, Kalyani
  • Ragukumar, Vickram
  • Pai, Nalinaksh

Abstract

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a first switch and a second switch in a network topology. The system includes a host virtual machine in communication with at least one of the first switch and the second switch. The system includes a routed peer link connecting the first switch to the second switch. The system is such that the first switch and the second switch have the same Internet protocol (IP) address and media access control (MAC) address.

IPC Classes  ?

  • H04L 29/12 - Arrangements, apparatus, circuits or systems, not covered by a single one of groups characterised by the data terminal
  • H04L 12/66 - Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
  • H04L 12/713 - Route fault prevention or recovery, e.g. rerouting, route redundancy, virtual router redundancy protocol [VRRP] or hot standby router protocol [HSRP] using node redundancy, e.g. VRRP
  • H04L 12/715 - Hierarchical routing, e.g. clustered networks or inter-domain routing
  • H04L 12/721 - Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing

94.

ARCAPI

      
Serial Number 88777516
Status Registered
Filing Date 2020-01-29
Registration Date 2020-08-25
Owner Arrcus, Inc. ()
NICE Classes  ? 09 - Scientific and electric apparatus and instruments

Goods & Services

Downloadable computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; downloadable operating system programs

95.

NETWORK DIFFERENT

      
Application Number 1422770
Status Registered
Filing Date 2018-07-30
Registration Date 2018-07-30
Owner Arrcus, Inc. (USA)
NICE Classes  ?
  • 09 - Scientific and electric apparatus and instruments
  • 42 - Scientific, technological and industrial services, research and design

Goods & Services

Computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems. Computer services, namely, providing technical consultation in the field of connectivity, interoperability and management capability among networked components and systems.

96.

ARCOPS

      
Serial Number 88054495
Status Registered
Filing Date 2018-07-26
Registration Date 2019-08-13
Owner Arrcus, Inc. ()
NICE Classes  ? 09 - Scientific and electric apparatus and instruments

Goods & Services

computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; operating system programs

97.

DPAL

      
Serial Number 88000154
Status Registered
Filing Date 2018-06-14
Registration Date 2020-01-14
Owner Arrcus, Inc. ()
NICE Classes  ? 09 - Scientific and electric apparatus and instruments

Goods & Services

computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; operating system programs

98.

ARCIQ

      
Serial Number 88000161
Status Registered
Filing Date 2018-06-14
Registration Date 2020-01-07
Owner Arrcus, Inc. ()
NICE Classes  ? 09 - Scientific and electric apparatus and instruments

Goods & Services

computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems; operating system programs

99.

NETWORK DIFFERENT

      
Serial Number 87746931
Status Registered
Filing Date 2018-01-08
Registration Date 2019-07-09
Owner Arrcus, Inc. ()
NICE Classes  ?
  • 09 - Scientific and electric apparatus and instruments
  • 42 - Scientific, technological and industrial services, research and design

Goods & Services

computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems computer services, namely, providing technical consultation in the field of connectivity, interoperability and management capability among networked components and systems

100.

A

      
Serial Number 87704015
Status Registered
Filing Date 2017-11-30
Registration Date 2018-08-14
Owner Arrcus, Inc. ()
NICE Classes  ? 09 - Scientific and electric apparatus and instruments

Goods & Services

Computer networking software, namely, software that provides connectivity, interoperability and management capability among networked components and systems
  1     2        Next Page