Logical graph

Abstract: For many years the research community has attempted to model the Internet in order to better understand its behaviour and improve its performance. Since much of the structural complexity of the Internet is due to its multilevel operation, the Internet's multilevel nature is an important and non-trivial feature that researchers must consider when developing appropriate models. In this paper, we compare the normalised Laplacian spectra of physical- and logical-level topologies of four commercial ISPs and two research networks against the US freeway topology, and show analytically that physical level communication networks are structurally similar to the US freeway topology. We also generate synthetic Gabriel graphs of physical topologies and show that while these synthetic topologies capture the grid-like structure of actual topologies, they are more expensive than the actual physical level topologies based on a network cost model. Moreover, we introduce a distinction between geographic graphs that include degree-2 nodes needed to capture the geographic paths along which physical links follow, and structural graphs that eliminate these degree-2 nodes and capture only the interconnection properties of the physical graph and its multilevel relationship to logical graph overlays. Furthermore, we develop a multilevel graph evaluation framework and analyse the resilience of single and multilevel graphs using the flow robustness metric. We then confirm that dynamic routing performed over the lower levels helps to improve the performance of a higher level service, and that adaptive challenges more severely impact the performance of the higher levels than non-adaptive challenges.

Abstract: A telecommunications mesh network includes a plurality of nodes each interconnected by an edge. A traffic demand is received having a working path with a link of edges interconnecting a source node with a destination node. The telecommunications mesh network has one or more pre-cross-connected trails associated therewith that are subdivided into one or more subtrails. Subtrails that do not meet pre-determined conditions are discarded. A logical graph representation of the telecommunications mesh network is created from subtrails that have not been discarded. Unused, shortcut, and rival edges are inserted into the logical graph. A shortest admissible protection path from the source node to the destination node is identified from the logical graph.

Abstract: A method for network adaptation includes receiving, by an adaptation coordinator of a virtual network, a performance measurement generated at a performance checkpoint located in the virtual network. The method also includes generating, by the adaptation coordinator, a first update of a service- specific configuration of the virtual network. The first update includes at least one of a modification of a performance checkpoint configuration, a modification of a Virtual Network Function (VNF) configuration, a modification of a protocol configuration, a modification of a resource allocation input, or a modification of a logical graph. The service- specific configuration includes a configuration of a plurality of logical nodes and a plurality of logical links of the virtual network in accordance with a service-specific data plane logical topology.

Abstract: The present disclosure describes methods, systems, and computer program products for providing access to business network data. One method includes identifying a logical graph from business network linked graph data to be transformed into a resource graph, the logical graph including at least two nodes and at least one edge connecting a pair of nodes and defining a connection between the nodes. Each node is converted into a resource. A resource graph associated with the logical graph can be generated, where generation comprises, for each identified node, associating at least one attribute associated with the identified node as a resource attribute of the corresponding resource, adding at least one node connected to the identified node via an edge in the logical graph as a resource attribute of the corresponding resource, and dissolving at least one connection between the identified node and at least one other entity in the logical graph.