Suvendu Kumar Barik

Suvendu Kumar Barik is a notable inventor based in Noida, India. He has made significant contributions to the field of network path computation, holding a total of 3 patents. His work focuses on enhancing the efficiency and effectiveness of pathfinding algorithms in complex networks.

Latest Patents

Suvendu's latest patents include innovative systems and methods for diversifying k-shortest path computation results. One of his patents, titled "Diversifying k-shortest path computation results for multiple vertices as destination or as inclusion constraint," involves receiving a request for k paths in a network from a source port to a node. This method represents the network as a graph, with vertices and edges, and assigns weights to each edge. It also includes determining up to k paths between the source port and a dummy destination vertex.

Another significant patent is "Path computation with direct enforcement of non-local constraints." This invention creates a graph of a network with vertices and edges, receiving requests for one or more paths. It traverses the graph to determine paths while managing non-local constraints effectively.

Career Highlights

Suvendu Kumar Barik is currently employed at Ciena Corporation, where he applies his expertise in network technologies. His work has been instrumental in advancing the capabilities of path computation systems, making them more robust and adaptable to various constraints.

Collaborations

Suvendu collaborates with talented professionals in his field, including Ankur Jain and John Wade Cherrington. Their combined efforts contribute to the innovative solutions developed at Ciena Corporation.

Conclusion

Suvendu Kumar Barik is a distinguished inventor whose work in path computation technologies has made a significant impact in the field. His patents reflect a deep understanding of network systems and a commitment to innovation.