Service Mapping Logic for Network Entry Point Discovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed computing environments, it is challenging to accurately and efficiently gather uniform resource locators (URLs) and other entry points to an enterprise service, as it often requires extensive time and knowledge, especially in large organizations where resources are disparately located and have varying functions and permissions.
Innovation Solution
The implementation of service mapping logic that automatically discovers and maps relationships between IT components by starting from a suitable entry point at the top communication level, utilizing tables with information on communication and traffic flow between ports, and graphing nodes to identify entry points that are not reachable, thereby ensuring comprehensive mapping without missing critical components.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If manual methods are used to gather entry points by contacting people within the organization, then accuracy of entry point identification may be improved, but the time required to compile the list becomes excessive
Solution Approach 1:
The system performs self-discovery of entry points by automatically analyzing network traffic patterns and communication flows between configuration items. The service mapping logic autonomously identifies entry points without requiring manual input or human knowledge, thereby eliminating the time-consuming manual compilation process while maintaining accurate identification through automated traffic analysis
Solution Approach 2:
The patent replaces the mechanical/manual process of contacting people to gather entry points with an automated electronic system. The service mapping logic electronically analyzes network communications, traffic patterns, and relationships between configuration items to automatically determine entry points, substituting human interaction with automated computational analysis
2Quantity of substance
If entry points are gathered manually from organizational knowledge, then completeness of entry point list may be improved, but the complexity and difficulty of the process increases
Solution Approach 1:
The system continuously monitors and analyzes network traffic patterns, communication flows, and relationships between configuration items to dynamically identify entry points. This feedback-driven approach allows the service mapping logic to adapt to changing network conditions and discover entry points based on actual operational data rather than relying on potentially incomplete organizational knowledge
Solution Approach 2:
The patent replaces the complex manual process of gathering entry points from organizational knowledge with automated electronic analysis. The service mapping logic electronically traces communication paths, analyzes traffic patterns, and identifies entry points through computational algorithms, thereby reducing the complexity and difficulty of the process while maintaining completeness
3Ease of manufacture
If service mapping starts from middle layers of the infrastructure, then mapping process may be simpler to initiate, but critical components on the wrong side of the entry point may be missed
Solution Approach 1:
Instead of starting the mapping process from middle layers and working outward, the system identifies entry points at the top communication level (outermost layer) and maps inward through the infrastructure. This inverted approach ensures that all components, including those on the wrong side of entry points, are discovered through outbound connection tracking from the top-level entry points
Data Source
AI summary
The present approach relates to determining suitable entry points for initiating discovery and mapping of an enterprise service. For example, one or more tables may be utilized that include information regarding connections and/or communication between configuration items (CIs) of the enterprise service. From the tables, a graph may be created with nodes of the graph representing an internet protocol (IP) address and a port associated with the CIs, and edges of the graph representing the connections and/or communication between the CIs. The graph may be traversed according to outbound edges starting from a node with zero or few outbound edges. The nodes that are unreachable, or untraversed, may be flagged as suitable entry point candidates. In some embodiments, the flagged suitable entry point candidates may be reconciled with already known entry points included in the one or more tables.


