This paper presents a new publicly available dataset from GÉANT, the European Research and Educational Network. This dataset consists of traffic matrices built using full IGP routing information, sampled Netflow data and BGP routing information of the GÉANT network, one per 15 minutes interval for several months. Potential benefits of publicly available traffic matrices comprise improving our understanding of real traffic matrices, their dynamics, and to make possible the benchmarking of intradomain traffic engineering methods. Categories and Subject Descriptors MOTIVATIONA lot of effort has been put the last few years on trying to infer traffic matrices based on SNMP link counts [1,2,3,4]. The approach of relying on the raw traffic demand [5,6] is rarely used as the burden of the measurement and storage infrastructure is significant [7]. Still, recent works [8,9] indicate that obtaining precise traffic matrices is not out of reach.Contrary to single capture points traffic traces [10,11,12] or BGP routing data [13,14] for which numerous publicly available datasets exist, publicly available traffic matrices coming from a real network are rare. The only publicly available set of traffic matrices to our knowledge is at http://www.cs.utexas.edu/ yzhang/research/AbileneTM/ based on data from the Abilene network. Developing intradomain traffic engineering tools or traffic matrix modeling require real datasets to validate the tools or the models. Without publicly available datasets, no comparisons with alternative techniques or models can be performed. To contribute to filling this lack in the networking community, this paper presents a publicly available dataset consisting of intradomain THE GÉANT NETWORKGÉANT is the pan-European research network and it is operated by DANTE. It carries research traffic from the European National Research and Education Networks (NRENs) connecting universities and research institutions. GÉANT has a PoP in each European country 3 . All the routers of GÉANT are border routers. GÉANT is composed of 23 routers interconnected using 38 links. In addition, GÉANT has 53 links with other domains. GÉANT uses ISIS to compute its intradomain routes. The IGP weights of GÉANT are mainly based on the inverse of the link capacities with some manual tunings. We obtained a libpcap trace of ISIS for the purpose of building a model of the GÉANT topology.In order to build an accurate model of GÉANT suitable for the computation of its intradomain traffic matrices, we also obtained from DANTE the interdomain routes known by GÉANT as well as a trace of the traffic transiting accross GÉANT [15]. The interdomain routes are obtained from BGP and the traffic trace is collected using Netflow. We describe these two datasets in the following paragraphs. BGP Routing dataIn GÉANT, the BGP routes are collected using a dedicated workstation running GNU Zebra [16], a software implementation of different routing protocols including BGP. The workstation has an iBGP session with all the border routers of the networ...
Since recent years, it has been recognized that the existing routing architecture of today's Internet is facing scalability problems. Single numbering space, multi-homing, and traffic engineering, are making routing tables of the default free zone to grow very rapidly. Recently, in order to solve this issue, it has been proposed to review the Internet addressing architecture by separating the end-systems identifiers' space and the routing locators' space.In this paper we review the most recent Locator/ID separation proposal and explore the benefits that such an architecture may bring. In particular, we evaluate the improvements that can be achieved in terms of routing tables' size reduction and traffic engineering.
The Smart Grid (SG) aims to transform the current electric grid into a “smarter” network where the integration of renewable energy resources, energy efficiency and fault tolerance are the main benefits. This is done by interconnecting every energy source, storage point or central control point with connected devices, where heterogeneous SG applications and signalling messages will have different requirements in terms of reliability, latency and priority. Hence, data routing and prioritization are the main challenges in such networks. So far, RPL (Routing Protocol for Low-Power and Lossy networks) protocol is widely used on Smart Grids for distributing commands over the grid. RPL assures traffic differentiation at the network layer in wireless sensor networks through the logical subdivision of the network in multiple instances, each one relying on a specific Objective Function. However, RPL is not optimized for Smart Grids, as its main objective functions and their associated metric does not allow Quality of Service differentiation. To overcome this, we propose OFQS an objective function with a multi-objective metric that considers the delay and the remaining energy in the battery nodes alongside with the dynamic quality of the communication links. Our function automatically adapts to the number of instances (traffic classes) providing a Quality of Service differentiation based on the different Smart Grid applications requirements. We tested our approach on a real sensor testbed. The experimental results show that our proposal provides a lower packet delivery latency and a higher packet delivery ratio while extending the lifetime of the network compared to solutions in the literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.