The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Segment Routing (SR) can be used as a traffic engineering strategy to counteract increasing loads on networks like Internet Service Provider (ISP) backbones. Many SR approaches, however, optimize traffic flows that were measured in the past. This paper introduces a new tunnel training architecture. It aims to show that the results of these strategies can still be beneficial for routing new traffic...
In modern computer networks loading and bandwidth of communication links are optimized for providing high-quality service of network traffic, new services and technologies. As a rule, for this task the protocols of dynamic routing based on Dijkstra algorithm are used. Protocols of multipath routing for ensuring reliability and accuracy of the provided information allow to divide critical traffic and...
In modern computer networks loading and bandwidth of communication links are optimized for providing high-quality service of network traffic, new services and technologies. As a rule, for this task the protocols of dynamic routing based on Dijkstra algorithm are used. Protocols of multipath routing for ensuring reliability and accuracy of the provided information allow to divide critical traffic and...
Since traffic load in mobile networks typically changes significantly over time, time-varying routing, where routing changes in certain time intervals, seems an obvious solution. Yet multiple researchers have claimed independently in the past, that time-varying routing does not lead to worthwhile benefits given its overhead. In this paper, we study this issue in a systematic way. We argue that previous...
We introduce a practical green traffic engineering technique in fast reroute (FRR) enabled IP networks which is able to avoid transient routing disruption caused by sleeping-mode reconfigurations during runtime. Following the description on the time-driven "delegate before sleep" operations based on the NotVia FRR platform, we also propose a simple optimization algorithm for selecting sleeping...
Throughput optimization and traffic engineering in Wavelength-Division Multiplexing (WDM) networks are usually treated as mono-objective optimization problems. In this paper, we provide a multi-objective Integer Linear Program (ILP) for the joint throughput optimization and traffic engineering problem. By simultaneously i) maximizing the throughput, ii) minimizing the resource consumption, and iii)...
Internet Service Providers (ISPs) run the internal flavor of the Border Gateway Protocol (iBGP) for distributing routing information among border routers. While configuration languages allow routers to change iBGP attributes as a BGP message travels within the ISP's network, most prior work neglected this possibility, focusing only on the common case where iBGP attributes are left untouched. In this...
Efficient network utilization using available resources is the main goal of traffic engineering and routing is the core criteria which regulates traffic over Internet links. Open Shortest Path First (OSPF) is a routing protocol which is widely used in the industry and uses the link weights as its routing metric. Optimizing these link weights leads to efficient routing and better network utilization...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.