scispace - formally typeset
Patent

Monitoring Dynamic Networks

TLDR
In this paper, a set of predicted network topology snapshot graphs of nodes in the network are generated based on the set of topology prediction models for the network, and a subset of the nodes is selected as monitors in the predicted graph, so that each link in a given set of selected links is identifiable using end-to-end measurements between the monitors.
Abstract
Monitoring a network is provided A set of predicted network topology snapshot graphs of nodes in the network are generated based on a set of network topology prediction models for the network A subset of the nodes is selected as monitors in the set of predicted network topology snapshot graphs of the network so that each link in a set of selected network links is identifiable using end-to-end measurements between the monitors Network states of interest are determined in the set of selected network links within a selected time window based on the end-to-end measurements between the monitors

read more

Citations
More filters
Journal ArticleDOI

Optimal Dynamic Cloud Network Control

TL;DR: This work addresses the problem of optimal service delivery over a distributed cloud network, in which nodes are equipped with both communication and computation resources, and designs a family of dynamic cloud network control algorithms that stabilize any service input rate inside the capacity region, while achieving arbitrarily close to minimum resource cost.
Patent

High performance software-defined core network

TL;DR: In this article, a virtual machine (VM) provisioned at a node and coupled to the network is configured to receive feedback data of link conditions, and use the feedback data to dynamically determine and adapt an optimal route through the network.
References
More filters
ReportDOI

The NIST Definition of Cloud Computing

Peter Mell, +1 more
TL;DR: This cloud model promotes availability and is composed of five essential characteristics, three service models, and four deployment models.
Journal ArticleDOI

Network Tomography of Binary Network Performance Characteristics

TL;DR: This paper abstracts the properties of network performance that allow this to be done and exploits them with a quick and simple inference algorithm that, with high likelihood, identifies the worst performing links.
Proceedings ArticleDOI

Group mobility and partition prediction in wireless ad-hoc networks

TL;DR: This work proposes a new characterization of group mobility, based on existing group mobility models, which provides parameters that are sufficient for network partition prediction, and uses a simple but effective data clustering algorithm that can accurately determine the mobility groups and estimate the characteristic parameters of each group.
Proceedings ArticleDOI

Locating internet bottlenecks: algorithms, measurements, and implications

TL;DR: This paper presents Pathneck, a tool that allows end users to efficiently and accurately locate the bottleneck link on an Internet path based on a novel probing technique called Recursive Packet Train (RPT) and does not require access to the destination.
Proceedings ArticleDOI

On the number of distributed measurement points for network tomography

TL;DR: In this article, the minimum number of required beacons on a network under a BGP-like routing policy is shown to be NP-hard and at best Ω(log n)-approximable.