In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer has to satisfy certain survivability and routing constraints. Given the node locations, the...

The Internet is a complex mesh of networks that use a common suite (TCP/IP) of networking protocols. A key feature of the Internet is that all of these constituent networks are interconnected, thereby providing system wide communication. The magnitude and pattern of the ow of routing information directly represents the con-nectivity stability of the Internet. The NSFNET backbone network provide...

Virtual Backbone Formation in Wireless Ad Hoc Networks

Virtualization has been proposed as a vehicle for overcoming the growing problem of internet ossification [1]. This paper studies the problem of mapping diverse virtual networks onto a common physical substrate. In particular, we develop a method for mapping a virtual network onto a substrate network in a cost-efficient way, while allocating sufficient capacity to virtual network links to ensur...

Ad hoc networks lack pre-designated routers and physical infrastructure, which makes routing in these networks a challenging task. To overcome the problems associated with this, virtual backbone has been proposed as the routing infrastructure of ad hoc networks. A well-known and well researched approach for constructing virtual backbone is Connected Dominating Set (CDS). It overcomes the broadc...

Currently wireless networks are dominant by star topology paradigm. Its natural the evolution is towards wireless mesh multi-hop networks. This article compares the performance of several algorithms for virtual backbone formation in ad hoc mesh networks both theoretically and through simulations. Firstly, an overview of the algorithms is given. Next, the results of the algorithm simulations mad...

This paper presents the results of a measurement study of the T1 NSFNET backbone. We rst discuss the measurement environment and approach to data collection. We then present measurements results for: long-term growth in traac volume, including attribu-tion to domains and protocols; trend in average packet size on the network, both over long and medium term intervals; most popular sources, desti...

Uncovering anomalies in large ISPs and enterprise networks is challenging because of the wide variety of such anomalies. They can come from activity with malicious intentions (e.g., scanning, DDoS, prefix hijacking), or from misconfigurations and failures of network components (e.g., link failures, routing problems, outages in measurement equipment). In the literature, the problem of detecting ...

The Internet supports a growing number of services ranging from legacy web browsing to the more recent online gaming or voice over IP. Among these services, some emerging network applications, such as IP television or video on demand, have stringent requirements in terms of guaranteed endtoend performance. These requirements translate into multiple quality of service (QoS) constraints related t...

This paper introduces methods for the minimisation of virtual backbone size in wireless mesh networks, subject to practical constraints. The methods are centralised, which limits their usage to static applications. Four algorithms are presented, one exact and three heuristic. The exact method guarantees to find an optimal solution but runs in exponential time. Of the three heuristics, one is sh...