Log in
Enquire now
‌

US Patent 10382529 Directed graph based span computation and configuration dispatching

Patent 10382529 was granted and assigned to Nicira on August, 2019 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Patent abstractTimelineTable: Further ResourcesReferences
Is a
Patent
Patent

Patent attributes

Patent Applicant
‌
Nicira
Current Assignee
‌
Nicira
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
10382529
Date of Patent
August 13, 2019
Patent Application Number
15011332
Date Filed
January 29, 2016
Patent Citations Received
‌
US Patent 12130878 Deduplication of monitored communications data in a cloud environment
3
‌
US Patent 11509522 Synchronization of logical network state between global and local managers
‌
US Patent 12126643 Leveraging generative artificial intelligence (‘AI’) for securing a monitored deployment
6
‌
US Patent 12126695 Enhancing security of a cloud deployment based on learnings from other cloud deployments
7
‌
US Patent 11496392 Provisioning logical entities in a multidatacenter environment
‌
US Patent 10846245 Minimizing usage of hardware counters in triggered operations for collective communication
‌
US Patent 10965515 Graph-based network fabric for a network visibility appliance
‌
US Patent 11005753 Defining routing domain for distributed packet processing
...
Patent Primary Examiner
‌
Paul H Masur
Patent abstract

A method of determining the span of logical entities in a network is provided. The method generates a directed graph. Each node of the graph corresponds to a logical network entity. Each edge of the graph has one or two directions. A direction from a first node to a second node identifies the first node as the source of span for the second node. The method determines the span of each node based on the direction of the edges of the directed graph. The method groups each set of nodes that are accessible by all other nodes in the set in a strongly connected group (SCC) sub-graph. The method generates a group node in a directed acyclic graph (DAG) to correspond to each SCC sub-graph in the directed graph. The method assigns the span of each SCC to the corresponding group node of the DAG.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 10382529 Directed graph based span computation and configuration dispatching

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.