Abstract

During the last years, MultiProtocol Label Switching (MPLS) has been deployed by most large Service Providers (SP). The main driver for MPLS deployment is the ability to provide new services with stringent Service Level Agreements (SLAs) such as layer-2 and layer-3 Virtual Private Networks (VPNs) as well as Voice and Video over IP. Most of these services are already deployed inside single SP networks. However, customers now require world-wide VPN and VoIP services. Therefore, SPs need to collaborate to offer these services across multiple SP networks. Inside a single SP network, each node usually knows the complete topology of the network with the load and delay of all the links. Based on this information, each router is able to compute constrained paths toward any other router inside the SP network. Then, it can establish a connection and reserve resources along the computed path with the Resource reSerVation Protocol (RSVP-TE). However, when services with stringent requirements must cross multiple SP networks the computation of the path becomes a problem. Routers in different SP networks exchange routing information by using the Border Gateway Protocol (BGP). BGP provides reachability information. It does not distribute complete topology, delay and bandwidth information. One way to provide guaranteed services crossing different SPs is to delegate the computation of the paths to a Path Computation Element (PCE) that learns the topology of the different SPs. However, this requires that SPs reveal information that they usually consider confidential, their topology. In this thesis, we perform active measurements to show the difficulty to engineer the interdomain traffic with BGP. MPLS together with RSVP-TE provide much more control on the traffic. We define extensions to RSVP-TE for the protection of inter-AS MPLS paths. The aim is to be able to provide the same service guarantees as inside a domain while keeping the internal topology of SPs confidential, as required by SPs. We propose and evaluate distributed techniques relying on PCEs for the computation of interdomain constrained paths respecting the latter confidentiality requirement. (FSA 3)--UCL, 2006

Abstract

Segment Routing (SR) is a powerful tool to solve traffic engineering in large networks. It enables steering the traffic along any arbitrary network path while limiting scalability issues as routers do not need to maintain a global state. Mathematical programming approaches proposed so far for SR either do not scale well with the size of topology or impose a strong limit on the number of possible detours (typically at most one). Moreover they do not support Segment Routing fully by ignoring the adjacency segments. This paper leverages column generation, a widely used technique for solving large scale linear programs, combined with a novel dynamic program for solving the pricing problem. Our approach reaches near optimal solutions with gap guarantees by also computing a strong lower-bound tighter than the multi-commodity flow relaxation. It scales even on large topologies and exploits the full expressiveness of SR including adjacency segments. Our experiments compared with existing traffic engineering techniques on various topologies and demand matrices demonstrate the advantages of our approach in terms of scalability, any-time behavior and quality of the solutions.

Abstract

Nowadays, sustainability and resilience have become a major consideration that cannot be neglected in urban development. People are starting to consider utilizing the urban infrastructure environment to maintain and improve the functionality and availability of the urban system when unexpected events take place. Traffic congestion is always a major issue in urban planning, especially when the vehicles in the roadway keep growing and the local authorities are lack of solutions to manage or distribute the traffics in the city. It has huge impact on urban sustainability and resilience such as overload of the city’s infrastructure, and air pollution, etc. This paper presents a survey on the challenges of developing sustainable and resilient transportation networks and the current urban traffic optimisation methods, as a possible solution to address such challenges. It aims to describe and define the state of the art on the research on sustainable and resilient transportation networks in urban development and a taxonomy of different traffic optimisation methods used for avoiding traffic congestion and improve urban traffic management.

Abstract

dvanced urban traffic control systems are often based on feed-back algorithms. For instance, current traffic control systems often operate on the basis of adaptive green phases and flexible co-ordination in road (sub) networks based on measured traffic conditions. However, these approaches are still not very efficient during unforeseen situations such as road incidents when changes in traffic are requested in a short time interval. Therefore, we need self-managing systems that can plan and act effectively in order to restore an unexpected road traffic situations into the normal order. A significant step towards this is exploiting Automated Planning techniques which can reason about unforeseen situations in the road network and come up with plans (sequences of actions) achieving a desired traffic situation. In this paper, we introduce the problem of self-management of a road traffic network as a temporal planning problem in order to effectively navigate cars throughout a road network. We demonstrate the feasibility of such a concept and discuss our preliminary evaluation in order to identify strengths and weaknesses of our approach and point to some promising directions of future research.

Abstract

ment of road transport network mobility from network perspective is presented.Physical connectivity and network traffic condition are considered.Fuzzy logic is employed to combine the two attributes into a mobility indicator.Two case studies were tested to show the applicability of the technique.The technique can be used as an evaluation tool for decision makers. This paper proposes a fuzzy logic model for assessing the mobility of road transport networks from a network perspective. Two mobility attributes are introduced to account for the physical connectivity and road transport network level of service. The relative importance of the two mobility attributes has been established through the fuzzy inference reasoning procedure that was implemented to estimate a single mobility indicator. The advantage of quantifying two mobility attributes is that it improves the ability of the mobility indicator developed to assess the level of mobility under different types of disruptive events.A case study of real traffic data from seven British cities shows a strong correlation between the proposed mobility indicator and the Geo distance per minute, demonstrating the applicability of the proposed fuzzy logic model. The second case study of a synthetic road transport network for Delft city illustrates the ability of the proposed network mobility indicator to reflect variation in the demand side (i.e. departure rate) and supply side (i.e. network capacity and link closure). Overall, the proposed mobility indicator offers a new tool for decision makers in understanding the dynamic nature of mobility under various disruptive events. Document type: Article