Multiprotocol label switching (MPLS) has become an attractive technology for the next generation backbone networks. To provide high quality services, fault tolerance should be taken into account in the design of a backbone network. In an MPLS based backbone network, the fault-tolerant issue concerns how to protect traffic in a carried path (label switched path (LSP)) against node and link failu...

This study presents a time-dependent stochastic user equilibrium (TDSUE) traffic assignment model within a probit-based path choice decision framework that explicitly takes into account temporal and spatial correlation (traveler interactions) in travel disutilities across a set of paths. The TDSUE problem, which aims to find time-dependent SUE path flows, is formulated as a Fixed Point (FP) pro...

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...

Multi-protocol Label Switching extends the IP destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the ne...

This dissertation investigates the single path calculation in order to satisfy the load balancing of the traffic. Today's Internet is a best effort service based on a single metric path selecting algorithm that can only support path for one requirement. Traffic is sent according to the selected path whatever the type of service is served. Various network services such as multimedia traffic requ...

We present a new iterative mathematical model for calculating the average bandwidth assigned to traffic flows using a Weighted Round Robin with Priority queuing (WRRPQ) scheduler with both strict and rate controlled priority in IP based NGN networks. The bandwidth assignment estimation is based on the average packet length, link speed and the arrival rate. We prove the model outcome with exampl...

In this paper we propose new simple integer linear programs (ILPs) formulations for minimizing capacity (in wavelength link) utilization in survivable WDM network. The study examines the performance of shared based protection schemes, such as path protection scheme and link protection scheme under single fiber failure. The numerical results obtained show a reduction in capacity utilization usin...

1 Traffic Engineering We describe a Traffic Engineering (TE) solution which can incorporate non-linear link costs. TE decides on the actual assignment of requests’ flow to (time, path) pairs. Formulation. A byte request, indexed by i, has a quantity of data di to be routed, and a value per byte vi. The request indicates the source Si and target Ti; data must be transmitted along a path from Si ...