To see the other types of publications on this topic, follow the link: Traffic engineering.
Dissertations / Theses on the topic 'Traffic engineering'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Traffic engineering.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Mortier, Richard Michael. "Internet traffic engineering." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620378.
Full text
2
Lin, Gongqi. "Energy aware traffic engineering." Thesis, Curtin University, 2014. http://hdl.handle.net/20.500.11937/292.
Full textAbstract:
Over-provisioning of network resources, i.e., routers and links, provides a unique opportunity for energy aware traffic engineering. In the thesis, we design three heuristic approaches, i.e., SSPF, MSPF, and 2DP-SP to solve three proposed green routing problems, i.e., SP-EAR, MP-EAR, and EAR-2DP. Our simulation results show the trade-off between power savings and network performances, i.e., maximum link utilization, path length, and route reliability, when using green routings algorithms.
3
Fortin, Melanie. "Traffic engineering of narrowband networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0018/MQ57726.pdf.
Full text
4
Bagula, Bigomokero Antoine. "Traffic engineering label switched paths." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/53196.
Full textAbstract:
Thesis (MSc)--Stellenbosch University, 2002.<br>ENGLISH ABSTRACT: The Internet is evolving into a commercial platform requiring enhanced protocols and an expanded
physical infrastructure allowing a better delivery from IP. Multi-protocol Label Switching (MPLS)
is a technology enabling traffic engineering and virtual private network (VPN) provisioning.
MPLS achieves traffic engineering by carrying the traffic over virtual connections called Label
Switched Paths (LSPs) which are engineered based on QoS requirements such as delay, jitter and
packet loss minimization or throughput maximization.
This thesis proposes path finding and traffic distribution methods to be deployed in MPLS networks
for traffic engineering LSPs. A flow optimization model based on a pre-planned routing approach
separating path finding and traffic distribution is presented. This model is augmented by a
threshold routing approach which routes the traffic based on thresholds expressing the maximum
load level reached by network links. This routing approach moves the traffic away from thresholdmarked
links to achieve low-utilized links/paths. The performance and routing capabilities of
these methods are evaluated through designed software. A routing architecture implementing a
two-layer signalling model for MPLS network is proposed and evaluated through simulation.
v<br>AFRIKAANSE OPSOMMING:Die verandering van die Internet in 'n kommersiele platform met verbeterde protokolle en 'n
uitgebreide fisieke infrastruktuur stel die internetprotokol (IP) in staat tot beter lewering. Multiprotokol-
etiketskakeling (MPLS), is 'n tegnologie vir die voorsiening van televerkeerbeheer en
virtuele privaatnetwerke (VPN). MPLS verskaf televerkeerbeheer deur die verkeer te dra oar
virtuele konneksies, wat bekend staan as etiketgeskakelde paaie, waarvan die ontwerp gebaseer
is op vereistes vir diensgehalte soos vertraging, ritteling en die minimering van pakketverlies of
maksimering van deurvoer.
Hierdie tesis stel nuwe padvind- en verkeerdistribusiemetodes voor wat aangewend word in MPLSnetwerke
om etiketgeskakelde paaie te beheer. 'n Model vir vloei-optimering-gebaseer op voorafbeplande
roetering wat padvinding en verkeerdistribusie skei-word aangebied. Hierdie model
word uitgebrei deur 'n benadering van drempelroetering wat die verkeer roeteer en gebaseer is op
drempels wat die maksimum ladingsvlak voorstel wat bereik kan word deur netwerkskakels. Hierdie
roeteringsbenadering skuif die verkeer weg van drempelgemerkte skakels en bereik daardeur
laaggebruikte skakelsjpaaie. Die prestasie en roeteringsvaardigheid van hierdie metodes word
gevalueer deur selfontwikkelde programmatuur. 'n Argitektuur vir roetering wat 'n dubbellaagseinmodel
implementeer vir 'n MPLS-netwerk, word aangebied en gevalueer met simulasie.
5
Fortin, Melanie (Melanie Yvette) Carleton University Dissertation Engineering Systems and Computer. "Traffic engineering of narrowband networks." Ottawa, 2000.
Find full text
6
Warsama, Ahmed. "Traffic Engineering with SDN : Optimising traffic Load-Balancing with OpenFlow". Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-39385.
Full textAbstract:
The advent of trends such as virtualization, cloud computing, IoT and BYOD has increased the traffic loads on modern enterprise and data-center networks. As the requirements on today’s networks increase, newer designs and solutions have sprout forth. Software-Defined Networking was developed to cater to the needs of modern networks and to improve traffic handling among other things. This study focuses on the ways SDN, specifically the OpenFlow standard, can be used to load-balance and increase the network throughput, in comparison to traditional methods such as Equal-Cost Load-Balancing. This was done by creating a test environment with the network emulator Mininet, and by creating load-balancing programs. The load-balancers were created using the OpenFlow protocol. These programs were used together with the Floodlight controller and were compared in the same environment. The results showed that the bandwidth load-balancer outperformed the Equal-Cost Load-Balancer.
7
Rojanarowan, Jerapong. "MPLS-Based Best-Effort Traffic Engineering." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7496.
Full textAbstract:
MPLS-Based Best-Effort Traffic Engineering
Jerapong Rojanarowan
120 Pages
Directed by Dr. Henry L. Owen
The objective of this research is to develop a multipath traffic engineering framework for best-effort traffic in Multiprotocol Label Switching (MPLS) networks so as to deliver more equal shares of bandwidth to best-effort users as compared to the traditional shortest-path algorithm. The proposed framework is static and the input to the traffic engineering algorithm is restricted to network topology. Performance evaluation of this framework is conducted by simulation using ns-2 network simulator. In a multi-service capable network, some portion of the bandwidth is reserved for guaranteed services and the leftover portion is dedicated to best-effort service. This research examines the problem of traffic engineering for the remaining network bandwidth that is utilized by best-effort traffic where demands are not known a priori. This framework will result in making the limited available best-effort traffic bandwidth more equitably shared by the best-effort flows over a wide range of demands. Traditional traffic engineering research has not examined best-effort traffic.
8
Ikram, Imran. "Traffic Engineering with MPLS and QOS." Thesis, Blekinge Tekniska Högskola, Avdelningen för telekommunikationssystem, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1217.
Full textAbstract:
In the modern era there exist applications that require very high resources and generate a tremendous amount of traffic so they require considerable amount of bandwidth and QOS to operate and perform correctly. MPLS is a new and a fast technology that offers much remuneration both in terms of providing trouble-free and efficient security together with the high speed of switching. MPLS not only guarantees quality of service of IP networks but in addition to provides scope for traffic engineering it offers many enhanced features of IP networks as it does not replace IP routing, but works along with existing and future routing technologies to provide high-speed data forwarding between label-switched routers (LSRs) together with QOS. Many network carriers are facing the problem of how to accommodate such ever-growing demands for bandwidth. And the static nature of current routing algorithms, such as OSPF or IS-IS, the situation is going even worse since the traffic is concentrated on the "least cost" paths which causes the congestion for some links while leaving other links lightly loaded. Therefore, MPLS traffic engineering is proposed and by taking advantage of MPLS, traffic engineering can route the packets through explicit paths to optimize network resource utilization and traffic performance. MPLS provides a robust quality of service control feature in the internet. MPLS class of service feature can work in accordance with other quality of service architectures for IP networks.
9
Dahlberg, Anders. "Traffic Engineering in a Bluetooth Piconet." Thesis, Blekinge Tekniska Högskola, Institutionen för telekommunikation och signalbehandling, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5759.
Full textAbstract:
The Bluetooth technology is still in an early stage of development. Much more research can and will be done before the performance of Bluetooth reaches its peak. During the recent years, ideas to integrate Bluetooth units in larger networks have arose, with the Bluetooth unit in the role as access point to the network. This behavior opens up for new possibilities but also increases the requirements on performance. In this thesis the main topic is improvement of piconet performance. The piconet, with the Master unit as access point, is studied from a teletraffic engineering point of view. Different performance attributes and behaviors have been found and investigated. With the outcome of these investigations in mind, new and more efficient policies and algorithms are proposed for both data and voice. A policy increasing the utilization of available bandwidth in a piconet is presented. Furthermore, a proposal is presented where multiple Bluetooth units are used in an efficient manner to support voice calls. The proposed solution does also enable creation of simple teletraffic models to be used for dimensioning.<br>Phone: +46709138850
10
Botha, Marlene. "Online traffic engineering for MPLS networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/50049.
Full textAbstract:
Thesis (MSc) -- Stellenbosch University, 2004.<br>ENGLISH ABSTRACT: The Internet is fast evolving into a commercial platform that carries a mixture of narrow- and broadband applications
such as voice, video, and data. Users expect a certain level of guaranteed service from their service
providers and consequently the need exists for efficient Internet traffic engineering to enable better Quality of
Service (QoS) capabilities.
Multi-protocol Label Switching (MPLS) is a label switching protocol that has emerged as an enabling technology
to achieve efficient traffic engineering for QoS management in IP networks. The ability of the MPLS
protocol to create explicit virtual connections called Label Switched Paths (LSPs) to carry network traffic
significantly enhances the traffic engineering capabilities of communication networks. The MPLS protocol
supports two options for explicit LSP selection: offline LSP computation using an optimization method and
dynamic route selection where a single node makes use of current available network state information in order
to compute an explicit LSP online.
This thesis investigates various methods for the selection of explicit bandwidth guaranteed LSPs through
dynamic route selection. We address the problem of computing a sequence of optimal LSPs where each LSP
can carry a specific traffic demand and we assume that no prior information regarding the future traffic demands
are available and that the arrival sequence of LSP requests to the network is unknown. Furthermore,
we investigate the rerouting abilities of the online LSP selection methods to perform MPLS failure restoration
upon link failure.
We propose a new online routing framework known as Least Interference Optimization (LIO) that utilizes
the current bandwidth availability and traffic flow distribution to achieve efficient traffic engineering. We
present the Least Interference Optimization Algorithm (LIOA) that reduces the interference among competing
network flows by balancing the number and quantity of flows carried by a link for the setup of bandwidth
guaranteed LSPs in MPLS networks.
The LIOA routing strategy is evaluated and compared against well-known routing strategies such as the Minimum Hop Algorithm (MHA), Minimum Interference Routing Algorithm (MIRA), Open Shortest Path
First (OSPF) and Constraint Shortest Path First (CSPF) by means of simulation.
Simulation results revealed that, for the network topologies under consideration, the routing strategies that
employed dynamic network state information in their routing decisions (LIOA, CSPF and MIRA) generally
outperformed the routing strategies that only rely on static network information (OSPF and MHA). In most
simulation experiments the best performance was achieved by the LIOA routing strategy while the MHA performed
the worse. Furthermore we observed that the computational complexity of the MIRA routing strategy
does not translate into equivalent performance gains.
We employed the online routing strategies for MPLS failure recovery upon link failure. In particular we
investigated two aspects to determine the efficiency of the routing strategies for MPLS rerouting: the suitability
of the LSP configuration that results due to the establishment of LSPs prior to link failure and the
ability of the online routing strategy to reroute failed LSPs upon link failure. Simulation results revealed
similar rerouting performance for all online routing strategies under investigation, but a LSP configuration
most suitable for online rerouting was observed for the LIOA routing strategy.<br>AFRIKAANSE OPSOMMING:Die Internet is voordurend besig om te evoleer in 'n medium wat 'n wye reeks moderne kommunikasietegnologiee
ondersteun, insluitende telefoon, video en data. Internet gebruikers verwag gewaarborgde diens van hul
diensverskaffers en daar bestaan dus 'n vraag na doeltreffende televerkeerbeheer vir gewaarborgde Internet
diensgehalte.
Multiprotokol Etiketskakeling (MPLS) is 'n etiketskakeling protokol wat doeltreffende televerkeerbeheer en
diensgehalte moontlik maak deur die eksplisiete seleksie van virtuele konneksies vir die transmissie van netwerkverkeer
in Internetprotokol (IP) netwerke. Hierdie virtuele konneksies staan bekend as etiketgeskakelde paaie.
Die MPLS protokol ondersteun tans twee moontlikhede vir eksplisiete seleksie van etiketgeskakelde paaie: aflyn
padberekening met behulp van optimeringsmetodes en dinamiese aanlyn padseleksie waar 'n gekose node 'n
eksplisiete pad bereken deur die huidige stand van die netwerk in ag te neem.
In hierdie tesis word verskeie padseleksiemetodes vir die seleksie van eksplisiete bandwydte-gewaarborgde
etiketgeskakelde paaie deur mid del van dinamiese padseleksie ondersoek. Die probleem om 'n reeks optimale
etiketgeskakelde paaie te bereken wat elk 'n gespesifeerde verkeersaanvraag kan akkommodeer word aangespreek.
Daar word aanvaar dat geen informasie in verband met die toekomstige verkeersaanvraag bekend is
nie en dat die aankomsvolgorde van etiketgeskakelde pad verso eke onbekend is. Ons ondersoek verder die herroeteringsmoontlikhede
van die aanlyn padseleksiemetodes vir MPLS foutrestorasie in die geval van skakelonderbreking.
Vir hierdie doel word 'n nuwe aanlyn roeteringsraamwerk naamlik Laagste Inwerking Optimering (LIO)
voorgestel. LIO benut die huidige beskikbare bandwydte en verkeersvloeidistribusie van die netwerk om
doeltreffende televerkeerbeheer moontlik te maak. Ons beskryf 'n Laagste Inwerking Optimering Algoritme
(LIOA) wat die inwerking tussen kompeterende verkeersvloei verminder deur 'n balans te handhaaf tussen die
aantal en kwantiteit van die verkeersvloeistrome wat gedra word deur elke netwerkskakel.
Die LIOA roeteringstrategie word geevalueer met behulp van simulasie en die resultate word vergelyk met
ander bekende roeteringstrategiee insluitende die Minimum Node Algorithme (MHA), die Minimum Inwerking
Algoritme (MIRA), die Wydste Kortste Pad Eerste Algoritme (OSPF) en die Beperkte Kortste Pad Eerste
Algoritme (CSPF).
Die resultate van die simulasie-eksperimente to on dat, vir die netwerk topologiee onder eksperimentasie, die
roeteringstratgiee wat roeteringsbesluite op dinamiese netwerk informasie baseer (LIOA, MIRA, CSPF) oor
die algemeen beter vaar as die wat slegs staatmaak op statiese netwerkinformasie (MHA, OSPF). In die meeste
simulasie-eksperimente vaar die LIOA roeteringstrategie die beste en die MHA roeteringstrategie die slegste.
Daar word verder waargeneem dat die komputasiekomplesiteit van die MIRA roeteringstrategie nie noodwendig
weerspieel word in die sukses van roeteringsuitkoms nie.
In die geval waar die aanlyn roeteringstrategiee aangewend word vir MPLS foutrestorasie, toon die resultate
van simulasie-eksperimente dat al die roeteringstrategiee min of meer dieselfde uitkoms lewer ten opsigte
van herroetering van onderbreekte verkeersvloei. Die konfigurasie van etiketgeskakelde paaie deur die LIOA
roeteringstrategie voor skakelonderbreking is egter die geskikste vir televerkeer herroetering na skakelonderbreking
11
Mazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.
Full text
12
Griem, J. "Traffic engineering for multiservice IP networks." Thesis, University College London (University of London), 2007. http://discovery.ucl.ac.uk/1446248/.
Full textAbstract:
The central cause of strain on today's IP network infrastructure steins from the industries striving to extend the network to carry voice and other advanced services that it was not designed for. This thesis develops the reasons why more sophisticated mechanisms are required for ensuring that the best-effort infrastructure becomes both predictable and controllable, if the current IP infrastructure is to replace circuit switched networks. The main theme of the thesis are the IP traffic engineering (IPTE) traffic engineering algorithms that were developed by the author. The goal of the proposed approach is to compute a set of Open Shortest Path First (OSPF) link weights to balance network load, while honouring bandwidth, hop count and propagation delay constraints of the traffic. The proposed solution is built on classical OSPF routing and additionally uses the multi topology concepts that were recently proposed as an extension to OSPF. Using Multi Topology OSPF (mt-OSPF), multiple routing planes can be implemented. Each Multi Topology (MT) routing plane is assigned its own link metrics and thus traffic can be routed independently. Given a traffic demand matrix and the network topology, the algorithm computes a set of link weights using a search heuristic. The optimisation is cost function based, so that individual constraints can be taken into account per routing plane. Using this approach, constraint information remains in the "offline" IPTE algorithms and thus no extra constraint awareness is required at layer 3. Since recent Cisco implementations of mt-OSPF and Multi Topology IS-IS (M-ISIS) provide the required multi topology routing support, no major changes at the router level are required for the approach to be realised. Extensive simulations presented in this thesis show that IPTE has the potential to provide the differentiated routing and load balancing that it was designed for. In addition the simulations show that load is balanced more evenly across the network than with standard shortest path routing on inverse capacity link weights. A network management system is discussed that acts as the binding element for all enabling components. A simplified architecture for such a management system is presented and it is discussed how several traffic engineering mechanisms could coexist with IPTE on one network infrastructure. The use of the authors IPTE approach in the context of this management system is discussed in depth: Dangers associated with potential network disruption caused by frequent link weight modifications are analysed from both intra- and inter-domain point of view. A strategy for solving the problem of disruptions caused by link weight changes is presented by using several network planes to migrate traffic, rather than causing disruptions to a "live" plane through link weight modification and resulting OSPF routing table updates. The strategy is simulated, showing that any detrimental effects of the transition are avoidable. However, the work is ongoing and the results presented are indicative. Overall the thesis presents an approach for traffic engineering using traditional routing techniques, to (1) preserve the original intrinsic advantages of the IP design and (2) help ready IP networking for the much more restricting requirements of the future mutiservice network. It presents algorithms, simulations and frameworks showing how the work fits into the current IP networking world.
13
Guedrez, Rabah. "Enabling traffic engineering over segment routing." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2018. http://www.theses.fr/2018IMTA0116/document.
Full textAbstract:
La majorité des grands opérateurs utilise la technologie MPLS pour gérer leur réseau via des protocoles de signalisation et de distributions de labels. Or, ces protocoles sont complexes à déployer, à maintenir et la résolution des pannes est souvent très difficile. L'IETF a initié la standardisation d'une architecture de routage par segments (Segment Routing) s'appuyant sur un plan de contrôle simple, léger, facile à gérer et instanciée sur MPLS ou IPv6. Cette architecture repose sur le concept de routage à la source, dans lequel l'en-tête des paquets transporte les indications du chemin à suivre pour atteindre sa destination. Adapté aux cas d'usages simples et offrant nativement une résistance aux pannes, les cas d'usages plus complexes exigent de résoudre des verrous technologiques pour lesquels nous proposons plusieurs solutions. Dans cette thèse effectuée au sein d'Orange Labs, nous nous sommes intéressés à l'instanciation de l'architecture Segment Routing sur le plan de transfert MPLS et plus particulièrement à l'ingénierie de trafic, notamment avec réservation de ressources. Nous avons proposé des solutions aux problèmes liés à la limitation matérielle des routeurs actuels ne permettant pas l'expression de tous les chemins contraints. Ce travail est divisé en deux parties : (i) la proposition d'algorithmes de calcul et d'encodage de chemins de routage par segment afin de contourner les limitations matérielles. (ii) la définition des exigences architecturales et la construction d'une preuve de concept fonctionnelle. Enfin, cette thèse propose de nouvelles pistes d'études afin de consolider les outils d'ingénierie de trafic pour le routage par segment<br>Most major operators use MPLS technology to manage their network via signalling and label distribution protocols. However, these protocols are complex to deploy, maintain and troubleshooting is often very difficult. The IETF has initiated the standardization of a segment routing architecture based on a simple control plane, lightweight, easyto-manage and instantiated on MPLS or IPv6. This architecture is based on the concept of source routing, in which the packet header carries the indications of the path to follow to reach its destination. Suitable for simple use cases and natively resistant to failure, more complex use cases require the resolution of technological issues for which we offer several solutions.In this thesis carried out within Orange Labs, we were interested in the instantiation of the Segment Routing architecture on the MPLS transfer plan and more particularly in traffic engineering, particularly with resource reservation. We have proposed solutions to the problems related to the hardware limitation of current routers that do not allow the expression of all constrained paths. This work is divided into two parts : (i) the proposal of algorithms for computing and encoding segment routing paths in order to bypass hardware limitations. (ii) the definition of architectural requirements and the construction of a functional proof of concept. Finally, this thesis proposes new research issues to consolidate traffic engineering tools for segment routing
14
Phuvoravan, Surapich. "Fast timescale traffic engineering in MPLS networks." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/229.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2004.<br>Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
15
Gao, Ruomei. "Interdomain Traffic Engineering for Multi-homed Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19732.
Full textAbstract:
Interdomain traffic engineering (TE) controls the flow of traffic
between autonomous systems (ASes) to achieve performance goals under
various resource constraints. Interdomain TE can be categorized
into ingress TE and egress TE, which aim to control the ingress and
egress traffic flow in a network, respectively. Most interdomain TE
techniques are based on BGP, which was not designed to support
performance based routing. Hence even though some basic interdomain
TE techniques are widely deployed, their overall effectiveness and
impact on interdomain traffic are not well understood. Furthermore,
systematic practices for deploying these techniques have yet to be
developed.
In this thesis, we explore these open issues for both ingress and
egress TE. We first focus on the AS-Path prepending technique in
interdomain ingress TE. We design a polynomial algorithm that
takes network settings as input and produces the optimal prepending
at each ingress link. We also develop methods to measure the inputs
of the optimal algorithm by leveraging widely available looking
glass severs and evaluate the errors of such measurement. We
further propose an algorithm, based on this optimal algorithm, that
is robust to input errors.
We then focus on Intelligent Routing Control (IRC) systems often
used at multihomed networks for egress interdomain TE. To address
the possible traffic oscillation problem caused by multiple IRC
systems, we design a class of randomized IRC algorithms. Through
simulations, we show that the proposed algorithms can effectively
mitigate oscillations. We also show that IRC systems using
randomized path switching algorithms perform better than those
switching path deterministically, when both types of IRC systems
co-exist.
To further understand the performance impact of IRC systems, we next
focus on the performance of applications, such as TCP
connections. We study the synergistic and antagonistic
interactions between IRC and TCP connections, through a simple
dual-feedback model. We first examine the impact of sudden RTT and
available bandwidth changes in TCP connection. We then examine the
effect of IRC measurement delays on closed loop traffic. We also
show the conditions under which IRC is beneficial under various path
impairment models.
16
Alassaf, Mohamad. "Traffic engineering for inter-domain optical networks." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26562.
Full textAbstract:
Because of increasing demands for network bandwidth and the advances in WDM technologies, it is expected that IP (Internet Protocol) over Wave Division Multiplexing (WDM) will be the infrastructure for the next generation Internet by carrying IP packets over WDM. As this infrastructure matures, a number of important control issues are surfacing. One of them is traffic engineering, which concerns network performance optimization.
This thesis presents a new approach to the congestion avoidance problem for wavelength-routed inter-domain networking under dynamic traffic demands where IP traffic is directly routed over WDM. The main idea is to adapt the underlying optical connectivity by measuring the actual traffic load over the existing lightpaths continuously and reacting to the load changes by adding or tearing down lightpaths. We avoid load instability directly by setting up a lightpath when congestion occurs or by tearing down a lightpath when the congestion is relieved. For the decision of setting up or tearing down lightpath, we propose a traffic engineering algorithm. The algorithm is characterized by two system parameters, high threshold (H) and low threshold (L).
A simulation is conducted with different network topologies. The simulation results show the improvement we achieved in term of packets loss, resource utilization, blocking probability and delay.
17
Gunnar, Anders. "Towards Robust Traffic Engineering in IP Networks." Licentiate thesis, Stockholm : Elektriska energisystem, Kungliga Tekniska högskolan, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4557.
Full text
18
Lam, Fung, and 林峰. "Internet inter-domain traffic engineering and optimizatioon." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31224581.
Full text
19
Park, Jin-Soo. "Marine traffic engineering in Korean coastal waters." Thesis, University of Plymouth, 1994. http://hdl.handle.net/10026.1/2410.
Full textAbstract:
This study describes and discusses the marine casualties, the effectiveness of existing traffic services, and marine safety and Vessel Traffic Service(VTS) in Korean coastal waters. Marine traffic is comprehensively assessed in Korean waters, an analysis of casualties is undertaken by block scheme. Marine environmental parameters are identified relating to marine casualties as appropriate. Various statistical techniques are employed to evaluate the inter-relationships between individual causal factors, and for the first time effect level is instituted to quantify the relative importance of the causal factors in Korean waters. A further innovation is the examination of the adequacy of existing Korean traffic services by casualty and traffic analysis, and an accident danger index is introduced to compare accident danger over different .time periods. A mixed population of contributors to marine safety is sought by questionnaire. The design of this is both innovative and original in content in order to evaluate the perceived importance of the various risk factors, the marginal effectiveness of various options in reducing risks, and their weight with regard to YTS services and activities, the main part of the study uses an original multiple coefficient to estimate casualty reduction rate and a new method to quantify the effectiveness of VTS. The Korean waters traffic study is conducted as an intermediate level and provides the data base for the main body of work. The conclusions include recommendations with respect to the stricter enforcement of the routeing scheme(TSS) and the adoption of further traffic observation/surveillance over the areas concerned. Finally it is noted in particular that additional Vessel Traffic Service and Traffic Separation Schemes are now required if any substantial improvement is to be achieved in marine traffic safety in Korean coastal waters.
20
Alves, Alexessander da Silva Couto. "Internet Traffic Engineering : An Artificial Intelligence Approach." Master's thesis, Universidade do Porto. Reitoria, 2004. http://hdl.handle.net/10216/14332.
Full text
21
Arya, Vijay. "Congestion inference and traffic engineering in networks." Nice, 2005. http://www.theses.fr/2005NICE4079.
Full textAbstract:
Cette thèse présente des mécanismes pour obtenir de meilleures estimations de la congestion sur Internet. Elle présente également un mécanisme ayant des applications sur le trafic multipoint dans des réseaux overlay. Tout d’abord, nous présentons une méthode de différenciation des pertes qui permet aux protocoles de transport non fiables d’estimer avec précision la congestion de bout-en-bout, en distinguant les pertes liées à la congestion des pertes liées aux erreurs de transmission sur les liaisons sans fil. Ensuite, nous présentons deux contributions relatives à un outil de tomographie de réseau. Nous proposons d’une part un algorithme statistique qui vérifie les mesures binaires effectuées en multipoint par MINC pour estimer les pertes. Cet algorithme permet de garantir une estimation fiable des taux de pertes sur les différents liens. D’autre part, nous proposons une nouvelle version de l’estimateur de perte MINC. Notre estimateur utilise les informations multipoints cumulées fournies en retour pour évaluer les taux de perte sur tous les liens. Il peut être utilisé dans des situations où la bande passante pour transmettre les rapports de réception est faible. Enfin, nous présentons des techniques efficaces pour encoder les arbres de transmission multipoint au sein des paquets de données. Ces techniques d’encodage peuvent être utilisées pour implanter un routage multipoint explicite et sans état dans des réseaux overlay et ont donc des applications dan le domaine d’ingénierie de trafic multipoint<br>This thesis presents methods which help to improve the quality of congestion inference on both en-to-end paths and internal network links in the Internet and a method which help to perform multicast traffic engineering in Overlay Networks. First, we propose an explicit loss differentiation scheme which allows unreliable transport protocols to accurately infer congestion on end-to-end paths by correctly differentiating congestion losses from wireless losses. Second, we present two contributions related to Multicast-based Inference of Network Characteristics (MINC). MINC is a method of performing network tomography which infers loss rates, i. E. , congestion on internal network links from end-to-end multicast measurements. We propose a statistical verification algorithm which can verify the integrity of binary multicast measurements used by MINC to perform loss inference. This algorithm helps to ensure a trustworthy inference of link loss rates. Next, we propose an extended MINC loss estimator which can infer loss rates of network links using aggregate multicast feedbacks. This estimator can be used to perform loss inference in situations where the bandwidth to report multicast feedbacks is low. Third, we present efficient ways of encoding multicast trees within data packets. These encodings can be used to perform stateless and explicit multicast routing in overlay networks and thus achieve goals of multicast traffic engineering
22
Lam, Fung. "Internet inter-domain traffic engineering and optimizatioon /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk:8888/cgi-bin/hkuto%5Ftoc%5Fpdf?B23273173.
Full text
23
Goyal, Mukul. "Internet Traffic Engineering: QoS Translation and Survivability." Columbus, OH : Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1047407545.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2003.<br>Title from first page of PDF file. Document formatted into pages; contains xxi, 271 p.: ill. Includes abstract and vita. Advisors: Ming T. Liu and Wu-chi Feng, Dept. of Computer and Information Science. Includes bibliographical references (p. 261-271).
24
Alves, Alexessander da Silva Couto. "Internet Traffic Engineering : An Artificial Intelligence Approach." Dissertação, Universidade do Porto. Reitoria, 2004. http://hdl.handle.net/10216/14332.
Full text
25
Aspin, SJ. "X.25 traffic generator." Master's thesis, University of Cape Town, 1986. http://hdl.handle.net/11427/21864.
Full textAbstract:
Due to the lower cost and error free data transmission capabilities offered by packet switching, numerous countries have installed national packet switched networks. The South African packet network, SAPONET-P, became operational in 1982 and has been growing rapidly, creating a need for network test equipment. This thesis describes the design of a high speed traffic generator which can be used to test and monitor the throughput capabilities of equipment or part of the network as a whole. To meet the main requirement of the traffic generator, that it should support a number of high speed X.25 lines, a multiprocessor architecture was chosen to cope with the high data throughput. An IBM PC was used as the base system, with several specially designed X.25 cards being installed in its expansion slots. The major part of the work done was on the design and development of the X.25 cards, each of which provides two high speed (64 Kbps) X.25 links. In order to achieve this throughput, the card uses three processors coupled on a local bus to a 256K multi-port memory. Two WD25ll processors implement the link level of the X.25 packet switching protocol (LAPB), with the required software being micro-encoded on the chip. An 8088 processor, the same as is used in the PC, implements the packet level, the traffic generator and overall control of the card. Extensive use was made of programmable array logic (PAL) devices to implement the system logic required. All programs for the traffic generator are written in the modern and powerful c language which is ideally suited to the application. The software was written in a modular fashion with the various modules being linked together by means of a set of common data structures. Use was made of packet buffers and job queueing to allow the traffic generator to cope with very high peak data rates. As well as programs for the X.25 cards, a monitor program runs on the PC and allows the· user to view statistics screens and modify the traffic generator configuration. While primarily designed for the,traffic generator application, the X.25 card may also be configured for a variety of other networking applications. By substituting a local area network (LAN) processor for the X.25 one, the card can be used as a low cost network card or as a network file server. The card can also be configured to provide a low cost means of connecting a PC based workstation to the packet switching network. As all programs are downloaded onto the cards from the PC, it is relatively easy to modify or upgrade the software. Thus while meeting the original project requirements, the traffic generator design has a flexible and expandible nature.
26
Gunnar, Anders. "Aspects of proactive traffic engineering in IP networks." Doctoral thesis, KTH, Reglerteknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-29558.
Full textAbstract:
To deliver a reliable communication service over the Internet it is essential for the network operator to manage the traffic situation in the network. The traffic situation is controlled by the routing function which determines what path traffic follows from source to destination. Current practices for setting routing parameters in IP networks are designed to be simple to manage. This can lead to congestion in parts of the network while other parts of the network are far from fully utilized. In this thesis we explore issues related to optimization of the routing function to balance load in the network and efficiently deliver a reliable communication service to the users. The optimization takes into account not only the traffic situation under normal operational conditions, but also traffic situations that appear under a wide variety of circumstances deviating from the nominal case. In order to balance load in the network knowledge of the traffic situations is needed. Consequently, in this thesis we investigate methods for efficient derivation of the traffic situation. The derivation is based on estimation of traffic demands from link load measurements. The advantage of using link load measurements is that they are easily obtained and consist of a limited amount of data that need to be processed. We evaluate and demonstrate how estimation based on link counts gives the operator a fast and accurate description of the traffic demands. For the evaluation we have access to a unique data set of complete traffic demands from an operational IP backbone. However, to honor service level agreements at all times the variability of the traffic needs to be accounted for in the load balancing. In addition, optimization techniques are often sensitive to errors and variations in input data. Hence, when an optimized routing setting is subjected to real traffic demands in the network, performance often deviate from what can be anticipated from the optimization. Thus, we identify and model different traffic uncertainties and describe how the routing setting can be optimized, not only for a nominal case, but for a wide range of different traffic situations that might appear in the network. Our results can be applied in MPLS enabled networks as well as in networks using link state routing protocols such as the widely used OSPF and IS-IS protocols. Only minor changes may be needed in current networks to implement our algorithms. The contributions of this thesis is that we: demonstrate that it is possible to estimate the traffic matrix with acceptable precision, and we develop methods and models for common traffic uncertainties to account for these uncertainties in the optimization of the routing configuration. In addition, we identify important properties in the structure of the traffic to successfully balance uncertain and varying traffic demands.<br>QC 20110211
27
Mian, Azhar Ali, and Sardar Usman Khalid. "Multi-Protocol Label Switching Traffic Engineering with QoS." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4201.
Full textAbstract:
The world has emerged as a global village. Internet has brought an amazing change in the era of modern communications. Demand for multimedia applications and an ever increasing amount of VoIP traffic have increased data rate and bandwidth requirements. It has become a big chal-lenge to provide best quality applications. Traffic engineers are working hard over Internet Protocol (IP) and Routing Protocols (RPs) in order to cope with this challenge. IP networks have offered these services efficiently until now, but there are several issues with IP routing that affect the Quality of Service (QoS). Multi-Protocol Label Switching (MPLS) has emerged as an agile technology which promises effective security together with high speed data delivery. MPLS networks use switching instead of conventional routing. MPLS doesn’t replace existing IP networks, but guarantees instead better QoS in existing IP networks as well as future routing technologies, providing thus a suitable environment for Traffic Engineering (TE). The Class of Service (CoS) architecture provided by MPLS can easily be coordinated with IP QoS mecha-nisms. Traffic can be switched based on resource utilization and network performance instead of using static routing techniques such as selecting a path with least cost, optimizing thus the MPLS network for heavy application at desired quality.<br>Världen har blivit en global by. Internet har inneburit en fantastisk förändring i en tid präglad av modern kommunikation. Efterfrågan på multimediaapplikationer och en allt större mängd VoIP-trafik har ökat datahastighet och krav på bandbredd. Det har blivit en stor utmaning att ge bästa kvalitet ansökningar. Trafiken tekniker arbetar hårt over Internet Protocol (IP) och routingprotokoll (RPS) för att klara av denna utmaning. IP-nät har erbjudit dessa tjänster på ett effektivt fram tills nu, men det finns flera problem med IP-routing som påverkar Quality of Service (QoS). Multi-Protocol Label Switching (MPLS) har utvecklats till en flexibel teknik som utlovar effektiv säkerhet tillsammans med hög hastighet leverans. MPLS-nätverk används byte istället för konventionella routing. MPLS ersätter inte de befintliga IP-nät, utan garantier i stället bättre QoS i befintliga IP-nät samt framtida routing-teknik, vilket har en lämplig miljö för trafikteknik (TE). Den klass som (COS) arkitektur som MPLS kan enkelt styras med IP QoS meka-nismer. Trafiken kan kopplas grundas på resursutnyttjande och nätverksprestanda istället för att använda statisk routing tekniker som att välja en väg med lägsta kostnad, vilket optimerar därmed MPLS nät för tunga ansökan till önskad kvalitet.
28
Carpa, Radu. "Energy Efficient Traffic Engineering in Software Defined Networks." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN065/document.
Full textAbstract:
Ce travail a pour but d'améliorer l'efficacité énergétique des réseaux de cœur en éteignant un sous-ensemble de liens par une approche SDN (Software Defined Network). Nous nous différencions des nombreux travaux de ce domaine par une réactivité accrue aux variations des conditions réseaux. Cela a été rendu possible grâce à une complexité calculatoire réduite et une attention particulière au surcoût induit par les échanges de données. Pour valider les solutions proposées, nous les avons testées sur une plateforme spécialement construite à cet effet.Dans la première partie de cette thèse, nous présentons l'architecture logicielle ``SegmenT Routing based Energy Efficient Traffic Engineering'' (STREETE). Le cœur de la solution repose sur un re-routage dynamique du trafic en fonction de la charge du réseau dans le but d'éteindre certains liens peu utilisés. Cette solution utilise des algorithmes de graphes dynamiques pour réduire la complexité calculatoire et atteindre des temps de calcul de l'ordre des millisecondes sur un réseau de 50 nœuds. Nos solutions ont aussi été validées sur une plateforme de test comprenant le contrôleur SDN ONOS et des commutateurs OpenFlow. Nous comparons nos algorithmes aux solutions optimales obtenues grâce à des techniques de programmation linéaires en nombres entiers et montrons que le nombre de liens allumés peut être efficacement réduit pour diminuer la consommation électrique tout en évitant de surcharger le réseau.Dans la deuxième partie de cette thèse, nous cherchons à améliorer la performance de STREETE dans le cas d’une forte charge, qui ne peut pas être écoulée par le réseau si des algorithmes de routages à plus courts chemins sont utilisés. Nous analysons des méthodes d'équilibrage de charge pour obtenir un placement presque optimal des flux dans le réseau.Dans la dernière partie, nous évaluons la combinaison des deux techniques proposées précédemment : STREETE avec équilibrage de charge. Ensuite, nous utilisons notre plateforme de test pour analyser l'impact de re-routages fréquents sur les flux TCP. Cela nous permet de donner des indications sur des améliorations à prendre en compte afin d'éviter des instabilités causées par des basculements incontrôlés des flux réseau entre des chemins alternatifs. Nous croyons à l'importance de fournir des résultats reproductibles à la communauté scientifique. Ainsi, une grande partie des résultats présentés dans cette thèse peuvent être facilement reproduits à l'aide des instructions et logiciels fournis<br>This work seeks to improve the energy efficiency of backbone networks by automatically managing the paths of network flows to reduce the over-provisioning. Compared to numerous works in this field, we stand out by focusing on low computational complexity and smooth deployment of the proposed solution in the context of Software Defined Networks (SDN). To ensure that we meet these requirements, we validate the proposed solutions on a network testbed built for this purpose. Moreover, we believe that it is indispensable for the research community in computer science to improve the reproducibility of experiments. Thus, one can reproduce most of the results presented in this thesis by following a couple of simple steps. In the first part of this thesis, we present a framework for putting links and line cards into sleep mode during off-peak periods and rapidly bringing them back on when more network capacity is needed. The solution, which we term ``SegmenT Routing based Energy Efficient Traffic Engineering'' (STREETE), was implemented using state-of-art dynamic graph algorithms. STREETE achieves execution times of tens of milliseconds on a 50-node network. The approach was also validated on a testbed using the ONOS SDN controller along with OpenFlow switches. We compared our algorithm against optimal solutions obtained via a Mixed Integer Linear Programming (MILP) model to demonstrate that it can effectively prevent network congestion, avoid turning-on unneeded links, and provide excellent energy-efficiency. The second part of this thesis studies solutions for maximizing the utilization of existing components to extend the STREETE framework to workloads that are not very well handled by its original form. This includes the high network loads that cannot be routed through the network without a fine-grained management of the flows. In this part, we diverge from the shortest path routing, which is traditionally used in computer networks, and perform a particular load balancing of the network flows. In the last part of this thesis, we combine STREETE with the proposed load balancing technique and evaluate the performance of this combination both regarding turned-off links and in its ability to keep the network out of congestion. After that, we use our network testbed to evaluate the impact of our solutions on the TCP flows and provide an intuition about the additional constraints that must be considered to avoid instabilities due to traffic oscillations between multiple paths
29
Bakhshi, Taimur. "User-centric traffic engineering in software defined networks." Thesis, University of Plymouth, 2017. http://hdl.handle.net/10026.1/8202.
Full textAbstract:
Software defined networking (SDN) is a relatively new paradigm that decouples individual network elements from the control logic, offering real-time network programmability, translating high level policy abstractions into low level device configurations. The framework comprises of the data (forwarding) plane incorporating network devices, while the control logic and network services reside in the control and application planes respectively. Operators can optimize the network fabric to yield performance gains for individual applications and services utilizing flow metering and application-awareness, the default traffic management method in SDN. Existing approaches to traffic optimization, however, do not explicitly consider user application trends. Recent SDN traffic engineering designs either offer improvements for typical time-critical applications or focus on devising monitoring solutions aimed at measuring performance metrics of the respective services. The performance caveats of isolated service differentiation on the end users may be substantial considering the growth in Internet and network applications on offer and the resulting diversity in user activities. Application-level flow metering schemes therefore, fall short of fully exploiting the real-time network provisioning capability offered by SDN instead relying on rather static traffic control primitives frequent in legacy networking. For individual users, SDN may lead to substantial improvements if the framework allows operators to allocate resources while accounting for a user-centric mix of applications. This thesis explores the user traffic application trends in different network environments and proposes a novel user traffic profiling framework to aid the SDN control plane (controller) in accurately configuring network elements for a broad spectrum of users without impeding specific application requirements. This thesis starts with a critical review of existing traffic engineering solutions in SDN and highlights recent and ongoing work in network optimization studies. Predominant existing segregated application policy based controls in SDN do not consider the cost of isolated application gains on parallel SDN services and resulting consequence for users having varying application usage. Therefore, attention is given to investigating techniques which may capture the user behaviour for possible integration in SDN traffic controls. To this end, profiling of user application traffic trends is identified as a technique which may offer insight into the inherent diversity in user activities and offer possible incorporation in SDN based traffic engineering. A series of subsequent user traffic profiling studies are carried out in this regard employing network flow statistics collected from residential and enterprise network environments. Utilizing machine learning techniques including the prominent unsupervised k-means cluster analysis, user generated traffic flows are cluster analysed and the derived profiles in each networking environment are benchmarked for stability before integration in SDN control solutions. In parallel, a novel flow-based traffic classifier is designed to yield high accuracy in identifying user application flows and the traffic profiling mechanism is automated. The core functions of the novel user-centric traffic engineering solution are validated by the implementation of traffic profiling based SDN network control applications in residential, data center and campus based SDN environments. A series of simulations highlighting varying traffic conditions and profile based policy controls are designed and evaluated in each network setting using the traffic profiles derived from realistic environments to demonstrate the effectiveness of the traffic management solution. The overall network performance metrics per profile show substantive gains, proportional to operator defined user profile prioritization policies despite high traffic load conditions. The proposed user-centric SDN traffic engineering framework therefore, dynamically provisions data plane resources among different user traffic classes (profiles), capturing user behaviour to define and implement network policy controls, going beyond isolated application management.
30
Kundé, Kunal Kamlakar 1978. "Calibration of mesoscopic traffic simulation models for dynamic traffic assignment." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/84839.
Full textAbstract:
Thesis (S.M. in Transportation)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2002.<br>Includes bibliographical references (p. 125-129).<br>by Kunal Kamlakar Kundé.<br>S.M.in Transportation
31
Phung, Chi Dung. "Enriching the internet control-plane for improved traffic engineering." Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS017/document.
Full textAbstract:
L'un des défis majeurs de l'évolution de l'architecture Internet est la définition d'une architecture protocolaire permettant d'améliorer le routage, et en particulier (i) conserver un système de routage gérable avec les technologies actuelles et futures c'est-à-dire, avec quelques millions d'états, (ii) offrir une architecture apte à faciliter la programmabilité du plan de transfert, (iii) proposer un système de routage évolutif pouvant être régulièrement optimisé avec uniquement les informations sur les flux actifs, (iv) fournir une séparation entre localisateurs et identificateurs pour la mobilité IP avancée, (v) faciliter un déploiement incrémental, (vi) mieux servir les services applicatifs "over-the-top". Le protocole LISP (\textit{Locator/Identifier Separation Protocol}) a été identifié comme l'un des protocoles émergents à cet égard. Dans son état actuel, il répond très bien aux besoins susmentionnés. Cependant, il subit des limitations lorsqu'il s'agit de prendre en compte la résilience et la capacité à réagir rapidement aux mises à jour de l'état du réseau. Ces inconvénients peuvent être compensés en améliorant l'architecture du plan de contrôle et ses algorithmes de routage. Dans cette thèse, nous proposons une nouvelle architecture réseau-système et expérimentons de nouvelles primitives de plan de contrôle, ainsi que d'algorithmes de diffusion des états, en testant son passage à l'échelle avec différentes conditions de réseau. Nous concevons et construisons d'abord un nœud de plan de données et de plan de contrôle LISP open source. Nous le comparons avec d'autres implémentations en montrant que notre implémentation atteint des performances adaptées aux vrais déploiements. Nous montrons comment notre implémentation a permis la mise en oeuvre d'une plateforme d'expérimentation à grande échelle, la plate-forme LISP-Lab, en opération aussi bien les fonctions de plan de transfert que les fonctions de plan de contrôle. En suite, nous proposons une nouvelle solution pour les migrations à chaud de machines virtuelles à travers des centres de données géographiquement répartis sur des réseaux IP étendus. Des tests dans un testbed réel connecté nativement à Internet montrent qu'avec notre approche, nous pouvons facilement atteindre des temps d'arrêt inférieurs à la seconde lors de la migration sur une grande échelle, même pour des clients très distants. En outre, nous avons étudié des protocoles d'optimisation de réseau multicouche, en particulier en relation avec le protocole MPTCP (Multipath Transport Control Protocol), auquel LISP peut offrir une diversité de chemins pour l’agrégation de bande passante, ainsi qu’une plus grande confidentialité et fiabilité des connexions. Bien que nous ne puissions bénéficier que de quelques nœuds de réseau superposés, nous avons pu évaluer expérimentalement nos propositions en montrant l'impact positif de notre solution, l'impact négatif des longs temps d'aller-rétour sur certains sous-flux MPTCP, et la forte corrélation entre le temps d'aller-retour différentiel et le débit. Enfin, nous avons travaillé sur une refonte du plan de contrôle de LISP afin d’améliorer son fonctionnement du à l'échelle d’Internet, en facilitant la coopération entre les systèmes de mapping LISP et en introduisant plus d'automatisation dans la procédure de fourniture de services de connectivité LISP. Nous croyons qu'une telle optimisation pourrait sensibiliser la communauté des fournisseurs de services, générant de nouvelles opportunités commerciales liées aux services de cartographie LISP et l'application de politiques d'ingénierie de trafic interdomaines avancées dans le but d'obtenir de meilleures garanties de qualité de service<br>One of the major challenges in the evolution of the Internet architecture is the definition of a protocol architecture that allows to solve the following major issues in Internet routing and traffic forwarding capabilities, (i) keeping a routing state that is manageable with current and forthcoming computing infrastructure – i.e., with few millions of states, (ii) offering a scalable pull architecture in support of data-plane programmability, (iii) offering a scalable forwarding plane able to be regularly optimized with only active flows information, (iv) offering locator/identifier separation for advanced IP mobility, (v) is incrementally deployable, (vi) can enhance the support of over-the-top services. The Locator/Identifier Separation Protocol (LISP) has been identified as one of the rising protocols in this respect. In its current status, it supports the above mentioned requirements at a level that is acceptable for basic networking environments. However, it shows too limited capacities when it comes to take into consideration fault resiliency and capability to react fast to network state updates. These shortcomings can be compensated by enhancing the control-plane architecture, and the routing algorithms therein. In this dissertation, we propose new protocol features and experiment novel control-plane primitives, as well as hybrid distributed-centralized routing state dissemination algorithms, to scale with different network conditions. We first design and build own open source LISP data-plane and control plane node, comparing it with other implementations, showing how our implementation can scale for large networks and reach performances suitable for real deployments. We present how our implementation served to operate all network nodes (data-plane and control-plane nodes) of a large scale experimentation testbed, the LISP-Lab testbed. Then we propose a novel LISP-based solution for VM live migrations across geographically separated datacenters over wide area IP networks. Experimenting it at large scale, we show that with our approach we can easily reach sub-second downtimes upon Internet-wide migration, even for very distant clients. Moreover, we investigate cross-layer network optimization protocols, in particular in relation with the Multipath Transport Control Protocol (MPTCP) to which LISP can deliver path diversity in support of bandwidth increase, confidentiality support and connection reliability, also using LISP traffic engineering network overlays. Despite we could benefit from only few overlay network nodes, we could experimentally evaluate our proposals showing the positive impact by using our solution, the negative impact of long round-trip times on some MPTCP subflows, and the strong correlation between the differential round-trip time among subflows and the throughput performance. Finally, we worked on a framework to improve LISP operation at the Internet scale, by facilitating cooperation between LISP Mapping Systems and introducing more automation in the LISP connectivity service delivery procedure. We believe such optimization could raise awareness among the service providers’ community, yielding new business opportunities related to LISP mapping services and the enforcement of advanced inter-domain traffic engineering policies for the sake of better quality of service guarantees
32
Bulman, Andrew. "Longbeach Mall : traffic impact assessment." Thesis, Stellenbosch : University of Stellenbosch, 2001. http://hdl.handle.net/10019.1/3427.
Full textAbstract:
Thesis (MEng (Civil Engineering))--University of Stellenbosch, 2001.<br>This Traffic Impact Assessment (TIA) was commissioned in March 1998 as a supporting document to
an application for the rezoning of an ert in Noordhoek from general housing to commercial use. The
proposal at the time was to develop a medium·sized 15 000 m2 GLA shopping centre with supporting
offices and a Health & Racquet Club. All the work (including managing the traffic counting team) was
carried out by myself under the guidance of Dr Piet Jordaan at Gibb Africa Consulting Engineers.
As financial backing and anchor tenants were secured for the development, the size of the proposed
shopping centre was increased from a local facilily to a regional facilily of 31 000 m2 GFA to be
developed in two phases. This necessitated a complete revision of the approach and content of the
TIA. Owing to the regional nature of the new development, the TIA was expanded to include a wider
geographical area of influence and a longer development period. This revised TIA was carried out by
myself between September 1998 and March 1999 under the guidance of Dr Herman Joubert.
Longbeach Mall opened for business in April 2001 complete with upgraded road network as
recommended in the TIA
The TIA is submitted as the final-year project for my Master's Degree in Traffic & Transportation
Engineering. For the purposes of completion, an after·study of current traffic conditions on the local
road infrastructure has also been included. The after·study was carried out in October 2001 (6 months
after Longbeach Mall opened) and includes traffic counts at critical intersections during the Saturday
morning peak period, observations of parking area utilisation, observations of shopping centre
occupancy and discussions of the possible reasons for differences between predicted and actual traffic
volumes.
Confirmation that the study is original and was carried out by myself and permission from Arcus Gibb
(Ply) Ltd to use the study as part of my final-year project, is provided in Appendix A.
33
Ruffing, Nicholas Luke. "Analysis of Smartphone Traffic." Cleveland State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=csu1430150923.
Full text
34
Wall, Zach R. "Traffic management and control utilizing a microscopic model of traffic dynamics /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/5922.
Full text
35
Wang, Hao. "Efficient and robust traffic engineering in a dynamic environment." YALE UNIVERSITY, 2009. http://pqdtopen.proquest.com/#viewpdf?dispub=3361616.
Full text
36
Abrahamsson, Henrik. "Network overload avoidance by traffic engineering and content caching." Doctoral thesis, SICS, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-24104.
Full textAbstract:
The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers. This thesis presents work on two methods operators can use to reduce links loads in their networks: traffic engineering and content caching. This thesis studies access patterns for TV and video and the potential for caching. The investigation is done both using simulation and by analysis of logs from a large TV-on-Demand system over four months. The results show that there is a small set of programs that account for a large fraction of the requests and that a comparatively small local cache can be used to significantly reduce the peak link loads during prime time. The investigation also demonstrates how the popularity of programs changes over time and shows that the access pattern in a TV-on-Demand system very much depends on the content type. For traffic engineering the objective is to avoid congestion in the network and to make better use of available resources by adapting the routing to the current traffic situation. The main challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands. This thesis proposes L-balanced routings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level L. L-balanced routing gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present an L-balanced routing algorithm and a heuristic search method for finding L-balanced weight settings for the legacy routing protocols OSPF and IS-IS. We show that the search and the resulting weight settings work well in real network scenarios.
37
Américo, F. Muchanga. "Interdomain traffic engineering and faster restoration in optical networks /." Stockholm : Telecommunication Systems Laboratory, Department of Electronics, Computers and Software Systems (ECS), School of Information and Communication Technology (ICT), Royal Institute of Technology (KTH), 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4220.
Full text
38
Koehler, Bernd G. "Best-effort traffic engineering in multiprotocol label switched networks." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/14937.
Full text
39
Muchanga, Americo Francisco. "Interdomain Traffic Engineering and Faster Restoration in Optical Networks." Doctoral thesis, KTH, Elektronik- och datorsystem, ECS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4220.
Full textAbstract:
Internet traffic has surpassed voice traffic and is dominating in transmission networks. The Internet Protocol (IP) is now being used to encapsulate various kinds of services. The new services have different requirements than the initial type of traffic that was carried by the Internet network and IP. Interactive services such as voice and video require paths than can guarantee some bandwidth level, minimum delay and jitter. In addition service providers need to be able to improve the performance of their networks by having an ability to steer the traffic along the less congested links or paths, thus balancing the load in a uniform way as a mechanism to provide differentiated service quality. This needs to be provided not only within their domains but also along paths that might traverse more than one domain. For this to be possible changes have been proposed and some are being applied to provide quality of service (QoS) and traffic engineering (TE) within and between domains. Because data networks now carry critical data and there are new technologies that enable providers to carry huge amount of traffic, it is important to have mechanisms to safeguard against failures that can render the network unavailable. In this thesis we propose and develop mechanisms to enable interdomain traffic engineering as well as to speed up the restoration time in optical transport networks. We propose a mechanism, called abstracted path information, that enable peering entities to exchange just enough information to engage in QoS and TE operations without divulging all the information about the internal design of the network. We also extend BGP to carry the abstracted information. Our simulations show that BGP could still deliver the same performance with the abstracted information. In this thesis we also develop a method of classifying failures of links or paths. To improve the restoration time we propose that common failures be classified and assigned error type numbers and we develop a mechanism for interlayer communication and faster processing of signalling messages that are used to carry notification signals. Additionally we develop a mechanism of exchanging the failure information between layers through the use of service primitives; that way we can speed up the restoration process. Finally we simulate the developed mechanism for a 24 node Pan American optical transport network.<br><p>QC 20100913</p>
40
Rabbat, Richard R. 1972. "Traffic engineering for hybrid optical and electronic switching networks." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8624.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2001.<br>Includes bibliographical references (leaves 115-118).<br>Quality of Service (QoS) over the Internet is receiving increasing attention with growing need to support upcoming multimedia applications. Many of these applications including real-time video and audio traffic require a more robust architecture that can deliver faster response times to the service requested. The Internet infrastructure currently supports a best effort service paradigm that does not differentiate between different flows. To support future applications, this thesis proposes an approach to solve the QoS needs of the traffic the network carries, by reserving bandwidth, reducing delay and increasing availability. The issues addressed in this dissertation are two-fold, leading to a better network switching architecture to support the differing needs of high-priority and low-priority voice and data traffic. Link failure is a problem that seriously affects QoS-enabled routing. The thesis addresses this challenge by designing a mechanism to restore network connectivity and reach optimality in the event of failures, while using a variant of link-state routing protocols. The thesis applies insights from the first problem to design an improved switching/routing architecture that services the needs of both low-priority and highpriority traffic. It achieves this architecture by making intelligent traffic admission and transport and assigning that traffic to packet switching or circuit switching hardware, in this case, an IP router and an all-optical cross-connect combined in a single hybrid switch design.<br>by Richard Rizkallah Rabbat.<br>Ph.D.
41
Zhang, Xu. "Cross-layer P2P traffic engineering in content-based networks." Thesis, University of Surrey, 2015. http://epubs.surrey.ac.uk/807619/.
Full textAbstract:
Peer-to-peer (P2P) content sharing applications account for a significant fraction of the traffic volumes and is expected to increase [1]. Data is distributed to a large population of end client peers from end source peers in P2P systems, without the need for big investments to deploy servers. The costs of the content distribution are thus shared among end users and Internet service providers (ISPs). Consequently, negative impacts, such as increased inter-ISP traffic in particular, have become critical issues that need to be kept low, due to that most popular P2P protocols are not designed to be aware of network topology. On the other hand, substantial access burden at source peers’ side can be increased due to their limited uploading bandwidth capacities, compared to the massive data demand. The top-level technical objectives of this work are thus to 1) achieve optimised usage of network resources through reducing P2P content traffic, and at the same time, 2) to provide enhanced network support to P2P applications. Specifically, we address the above issues in mainly two ways: First, in order to reduce the P2P traffic load especially over the costly inter-ISP links, we propose an advanced hybrid scheme for peer selections across multi-domains, by promoting cooperation and non-cooperation among adjacent ISPs. An analytical modelling framework is developed for analysing inter-domain peer selection schemes concerning ISP business policies. Our analytical modelling framework can be used as a guide for analysing and evaluating future network-aware P2P peer selection paradigms in general multi-domain scenarios. Second, with the concern of improving service quality for P2P users in terms of content access delay and transmission delay, we propose an intelligent in-network caching scheme enabled by Information-Centric Networking (ICN). A simple analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching policy. We further design an ICN-driven protocol for the efficient P2P content delivery with in-network caching support. Bloom Filter (BF) techniques are adopted to save cache space and also to reduce communication overhead. A P2P-like content delivery simulator with In-network caching functionalities is built, with which extensive simulation experiments are conducted to validate the analytical results and to further prove the efficiency of the proposed caching scheme.
42
Wang, Hong Feng. "IGP traffic engineering : a comparison of computational optimization algorithms." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/20877.
Full textAbstract:
Thesis (MSc)--Stellenbosch University, 2008.<br>ENGLISH ABSTRACT: Traffic Engineering (TE) is intended to be used in next generation IP networks to optimize
the usage of network resources by effecting QoS agreements between the traffic offered
to the network and the available network resources. TE is currently performed by the
IP community using three methods including (1) IGP TE using connectionless routing
optimization (2) MPLS TE using connection-oriented routing optimization and (3) Hybrid
TE combining IGP TE with MPLS TE. MPLS has won the battle of the core of the Internet
and is making its way into metro, access and even some private networks. However,
emerging provider practices are revealing the relevance of using IGP TE in hybrid TE
models where IGP TE is combined with MPLS TE to optimize IP routing. This is done by
either optimizing IGP routing while setting a few number of MPLS tunnels in the network
or optimizing the management of MPLS tunnels to allow growth for the IGP traffic or
optimizing both IGP and MPLS routing in a hybrid IGP+MPLS setting.
The focus of this thesis is on IGP TE using heuristic algorithms borrowed from the computational
intelligence research field. We present four classes of algorithms for Maximum
Link Utilization (MLU) minimization. These include Genetic Algorithm (GA), Gene Expression
Programming (GEP), Ant Colony Optimization (ACO), and Simulated Annealing
(SA). We use these algorithms to compute a set of optimal link weights to achieve IGP
TE in different settings where a set of test networks representing Europe, USA, Africa and
China are used. Using NS simulation, we compare the performance of these algorithms
on the test networks with various traffic profiles.<br>AFRIKAANSE OPSOMMING: Verkeersingenieurswese (VI) is aangedui vir gebruik in volgende generasie IP netwerke vir
die gebruiksoptimering van netwerkbronne deur die daarstelling van kwaliteit van diens
ooreenkomste tussen die verkeersaanbod vir die netwerk en die beskikbare netwerkbronne.
VI word huidiglik algemeen bewerkstellig deur drie metodes, insluitend (1) IGP VI gebruikmakend
van verbindingslose roete-optimering, (2) MPLS VI gebruikmakend van verbindingsvaste
roete-optimering en (3) hibriede VI wat IGP VI en MPLS VI kombineer. MPLS
is die mees algemene, en word ook aangewend in metro, toegang en selfs sommige privaatnetwerke.
Nuwe verskaffer-praktyke toon egter die relevansie van die gebruik van IGP VI
in hibriede VI modelle, waar IGP VI gekombineer word met MPLS VI om IP roetering te
optimeer. Dit word gedoen deur `of optimering van IGP roetering terwyl ’n paar MPLS
tonnels in die netwerk gestel word, `of optimering van die bestuur van MPLS tonnels om
toe te laat vir groei in die IGP verkeer `of die optimering van beide IGP en MPLS roetering
in ’n hibriede IGP en MPLS situasie.
Die fokus van hierdie tesis is op IGP VI gebruikmakend van heuristieke algoritmes wat
ontleen word vanuit die berekeningsintelligensie navorsingsveld. Ons beskou vier klasse van
algoritmes vir Maksimum Verbindingsgebruik (MVG) minimering. Dit sluit in genetiese
algoritmes, geen-uitdrukkingsprogrammering, mierkoloniemaksimering and gesimuleerde
temperoptimering. Ons gebruik hierdie algoritmes om ’n versameling optimale verbindingsgewigte
te bereken om IGP VI te bereik in verskillende situasies, waar ’n versameling
toetsnetwerke gebruik is wat Europa, VSA, Afrika en China verteenwoordig. Gebruikmakende
van NS simulasie, vergelyk ons die werkverrigting van hierdie algoritmes op die
toetsnetwerke, met verskillende verkeersprofiele.
43
Combrink, J. J. (Jacobus Johannes). "A bandwidth market for traffic engineering in telecommunication networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/49808.
Full textAbstract:
Thesis (MSc)--University of Stellenbosch, 2004.<br>ENGLISH ABSTRACT: Traffic engineering determines the bandwidth allocation required to meet the traffic loads in a
network. Similarly an economic market determines the resource allocation required to meet the
demand for resources. The term bandwidth market denotes traffic engineering methods that use
economic market methodology to determine the bandwidth allocation required to meet the traffic
loads. A bandwidth market is an attractive traffic engineering method because of its distributed
nature and ability to respond quickly to changes in network architecture or traffic loads.
Network terminology is frequently used to define bandwidth markets. Our approach is to use
the concepts of microeconomics to define a bandwidth market. The result is that our bandwidth
markets are similar to economic markets, which is advantageous for applying economic principles
correctly.
This thesis presents the theoretical basis for two bandwidth markets. The first bandwidth market
is a framework for building bandwidth markets. The second bandwidth market represents a society
of cooperating individuals. The society distributes resources via a mechanism based on economic
principles. An implementation of the bandwidth market is presented in the form of an optimisation
algorithm, followed by its application to several test networks.
We show that, in the test networks examined, the optimisation algorithm reduces the network
loss. For all test networks, the network loss achieved by the optimisation algorithm compares well
with the network loss achieved by a centralised optimisation algorithm.<br>AFRIKAANSE OPSOMMING: Verkeersingenieurswese bepaal die nodige bandwydtetoekenning om die verkeersvolume in 'n
netwerk te dra. Op 'n soortgelyke wyse bepaal 'n ekonomiese mark die nodige hulpbrontoekenning
om die aanvraag vir hulpbronne te bevredig. Die terme bandwydtemark stel verkeersingenieurswesetegnieke
voor wat ekonomiese-mark metodes gebruik om die bandwydtetoekenning vir die
verkeersvolume in 'n netwerk te bepaal. 'n Bandwydtemark is 'n aantreklike verkeersingenieurswesetegniek
omdat dit verspreid van aard is en vinnig kan reageer op veranderinge in netwerk
argitektuur en verkeersvolume.
Netwerkterminologie word gereeld gebruik om bandwydtemarkte te definieer. Ons benadering is
om mikro-ekonomiese begrippe te gebruik om 'n bandwydtemark te definieer. Die resultaat is
dat ons bandwydtemarkte soortgelyk aan ekonomiese markte is, wat voordelig is vir die korrekte
toepassing van ekonomiese beginsels.
Hierdie tesis lê die teoretiese grondwerk vir twee bandwydtemarkte. Die eerste bandwydtemark
is 'n raamwerk vir die ontwikkeling van bandwydtemarkte. Die tweede bandwydtemark stel 'n
vereniging van samewerkende individue voor. Die vereniging versprei bandwydte deur middel van
'n meganisme wat gebasseer is op ekonomiese beginsels. 'n Implementasie van hierdie bandwydtemark
word voorgestel in die vorm van 'n optimeringsalgoritme, gevolg deur die toepassing van
die optimeringsalgoritme op 'n aantal toetsnetwerke.
Ons wys dat die bandwydtemark die netwerkverlies verminder in die toetsnetwerke. In terme van
netwerkverlies vaar die bandwydtemark goed vergeleke met 'n gesentraliseerde optimeringsalgoritme.
44
ABHYANKAR, SACHIN ARUN. "TRAFFIC ENGINEERING OVER BLUETOOTH-BASED WIRELESS AD HOC NETWORKS." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1054754764.
Full text
45
Phung, Chi Dung. "Enriching the internet control-plane for improved traffic engineering." Electronic Thesis or Diss., Sorbonne université, 2018. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2018SORUS017.pdf.
Full textAbstract:
L'un des défis majeurs de l'évolution de l'architecture Internet est la définition d'une architecture protocolaire permettant d'améliorer le routage, et en particulier (i) conserver un système de routage gérable avec les technologies actuelles et futures c'est-à-dire, avec quelques millions d'états, (ii) offrir une architecture apte à faciliter la programmabilité du plan de transfert, (iii) proposer un système de routage évolutif pouvant être régulièrement optimisé avec uniquement les informations sur les flux actifs, (iv) fournir une séparation entre localisateurs et identificateurs pour la mobilité IP avancée, (v) faciliter un déploiement incrémental, (vi) mieux servir les services applicatifs "over-the-top". Le protocole LISP (\textit{Locator/Identifier Separation Protocol}) a été identifié comme l'un des protocoles émergents à cet égard. Dans son état actuel, il répond très bien aux besoins susmentionnés. Cependant, il subit des limitations lorsqu'il s'agit de prendre en compte la résilience et la capacité à réagir rapidement aux mises à jour de l'état du réseau. Ces inconvénients peuvent être compensés en améliorant l'architecture du plan de contrôle et ses algorithmes de routage. Dans cette thèse, nous proposons une nouvelle architecture réseau-système et expérimentons de nouvelles primitives de plan de contrôle, ainsi que d'algorithmes de diffusion des états, en testant son passage à l'échelle avec différentes conditions de réseau. Nous concevons et construisons d'abord un nœud de plan de données et de plan de contrôle LISP open source. Nous le comparons avec d'autres implémentations en montrant que notre implémentation atteint des performances adaptées aux vrais déploiements. Nous montrons comment notre implémentation a permis la mise en oeuvre d'une plateforme d'expérimentation à grande échelle, la plate-forme LISP-Lab, en opération aussi bien les fonctions de plan de transfert que les fonctions de plan de contrôle. En suite, nous proposons une nouvelle solution pour les migrations à chaud de machines virtuelles à travers des centres de données géographiquement répartis sur des réseaux IP étendus. Des tests dans un testbed réel connecté nativement à Internet montrent qu'avec notre approche, nous pouvons facilement atteindre des temps d'arrêt inférieurs à la seconde lors de la migration sur une grande échelle, même pour des clients très distants. En outre, nous avons étudié des protocoles d'optimisation de réseau multicouche, en particulier en relation avec le protocole MPTCP (Multipath Transport Control Protocol), auquel LISP peut offrir une diversité de chemins pour l’agrégation de bande passante, ainsi qu’une plus grande confidentialité et fiabilité des connexions. Bien que nous ne puissions bénéficier que de quelques nœuds de réseau superposés, nous avons pu évaluer expérimentalement nos propositions en montrant l'impact positif de notre solution, l'impact négatif des longs temps d'aller-rétour sur certains sous-flux MPTCP, et la forte corrélation entre le temps d'aller-retour différentiel et le débit. Enfin, nous avons travaillé sur une refonte du plan de contrôle de LISP afin d’améliorer son fonctionnement du à l'échelle d’Internet, en facilitant la coopération entre les systèmes de mapping LISP et en introduisant plus d'automatisation dans la procédure de fourniture de services de connectivité LISP. Nous croyons qu'une telle optimisation pourrait sensibiliser la communauté des fournisseurs de services, générant de nouvelles opportunités commerciales liées aux services de cartographie LISP et l'application de politiques d'ingénierie de trafic interdomaines avancées dans le but d'obtenir de meilleures garanties de qualité de service<br>One of the major challenges in the evolution of the Internet architecture is the definition of a protocol architecture that allows to solve the following major issues in Internet routing and traffic forwarding capabilities, (i) keeping a routing state that is manageable with current and forthcoming computing infrastructure – i.e., with few millions of states, (ii) offering a scalable pull architecture in support of data-plane programmability, (iii) offering a scalable forwarding plane able to be regularly optimized with only active flows information, (iv) offering locator/identifier separation for advanced IP mobility, (v) is incrementally deployable, (vi) can enhance the support of over-the-top services. The Locator/Identifier Separation Protocol (LISP) has been identified as one of the rising protocols in this respect. In its current status, it supports the above mentioned requirements at a level that is acceptable for basic networking environments. However, it shows too limited capacities when it comes to take into consideration fault resiliency and capability to react fast to network state updates. These shortcomings can be compensated by enhancing the control-plane architecture, and the routing algorithms therein. In this dissertation, we propose new protocol features and experiment novel control-plane primitives, as well as hybrid distributed-centralized routing state dissemination algorithms, to scale with different network conditions. We first design and build own open source LISP data-plane and control plane node, comparing it with other implementations, showing how our implementation can scale for large networks and reach performances suitable for real deployments. We present how our implementation served to operate all network nodes (data-plane and control-plane nodes) of a large scale experimentation testbed, the LISP-Lab testbed. Then we propose a novel LISP-based solution for VM live migrations across geographically separated datacenters over wide area IP networks. Experimenting it at large scale, we show that with our approach we can easily reach sub-second downtimes upon Internet-wide migration, even for very distant clients. Moreover, we investigate cross-layer network optimization protocols, in particular in relation with the Multipath Transport Control Protocol (MPTCP) to which LISP can deliver path diversity in support of bandwidth increase, confidentiality support and connection reliability, also using LISP traffic engineering network overlays. Despite we could benefit from only few overlay network nodes, we could experimentally evaluate our proposals showing the positive impact by using our solution, the negative impact of long round-trip times on some MPTCP subflows, and the strong correlation between the differential round-trip time among subflows and the throughput performance. Finally, we worked on a framework to improve LISP operation at the Internet scale, by facilitating cooperation between LISP Mapping Systems and introducing more automation in the LISP connectivity service delivery procedure. We believe such optimization could raise awareness among the service providers’ community, yielding new business opportunities related to LISP mapping services and the enforcement of advanced inter-domain traffic engineering policies for the sake of better quality of service guarantees
46
chiluka, srikanthreddy. "Traffic Sign Recognition." Thesis, Blekinge Tekniska Högskola, Institutionen för matematik och naturvetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-21343.
Full textAbstract:
Smart vehicles with capabilities of autonomous driving are a big revolution in automobile industry. The vehicles can sense their environment and react based on it. It replaces the manual driver. Recognition of traffic sign is an important enabler for autonomous driving. Camera installed in the vehicle captures the traffic sign on the road and they must be recognized accurately for triggering the suitable action. In this thesis both image processing and Euclidean distance matching are used to pre-process and classify the traffic signs and thresholding and thinning are applied on image for feature extraction. In this work, a simple, efficient traffic sign recognition system with low computational time and to achieve good accuracy is proposed. Time to classify the traffic sign is achieved in milliseconds and accuracy is maintained using the proposed system. Keywords: Autonomous Driving, Image processing, Thresholding, Thinning, Euclidean distance matching.
47
Vaze, Vikrant (Vikrant Suhas). "Calibration of dynamic traffic assignment models with point-to-point traffic surveillance." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/39282.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2007.<br>Includes bibliographical references (p. 173-180).<br>Accurate calibration of demand and supply simulators within a Dynamic Traffic Assignment (DTA) system is critical for the provision of consistent travel information and efficient traffic management. Emerging traffic surveillance devices such as Automatic Vehicle Identification (AVI) technology provide a rich source of disaggregate traffic data. This thesis presents a methodology for calibration of demand and supply model parameters using travel time measurements obtained from these emerging traffic sensing technologies. The calibration problem has been formulated in two different frameworks, viz. in a state-space framework and in a stochastic optimization framework. Three different algorithms are used for solving the calibration problem, a gradient approximation based path search method (SPSA), a random search meta-heuristic (GA) and a Monte-Carlo simulation based technique (Particle Filter). The methodology is first tested using a small synthetic study network to illustrate its effectiveness. Later the methodology is applied to a real traffic network in the Lower Westchester County region in New York to demonstrate its scalability.<br>(cont.) The estimation results are tested using a calibrated Microscopic Traffic Simulator (MITSIMLab). The results are compared to the base case of calibration using only the conventional point sensor data. The results indicate that the utilization of AVI data significantly improves the calibration accuracy.<br>by Vikrant Vaze.<br>S.M.
48
Cappiello, Alessandra 1972. "Modeling traffic flow emissions." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/84328.
Full text
49
Jun, Insung. "A study of effective traffic control and management schemes based on traffic measurement for VBR traffic sources on ATM networks." Thesis, King's College London (University of London), 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368926.
Full text
50
Weir, Jennifer Anne. "Active learning in transportation engineering education." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-12214-155616/.
Full text