Thesis (MSc)--University of Stellenbosch, 2005. / ENGLISH ABSTRACT: The majority of tra c on the Internet uses the Transmission Control Protocol (TCP) as a transport layer protocol for the end-to-end control of information transfer. Measurement, simulation and analytical models are the techniques and tools that can be used to understand and investigate the Internet and its performance. Measurements can only be used to explore existing network scenario or otherwise become costly and in exible with the growth and complexity of the Internet. Simulation models do not scale with the growth of network capacities and the number of users. Computationally e cient analytical models are therefore important tools for investigating, designing, dimensioning and planning IP (Internet Protocol) networks. Existing analytical models of TCP performance are either too simple to capture the internal dynamics of TCP or are too complex to be used to analyze realistic network topologies with several bottleneck links. The literature shows that the xed point algorithm (FPA) is a very useful way of solving analytical models of Internet performance. This thesis presents fast and accurate analytical models of TCP performance with the FPA used to solve them. Apart from what is observed in experimental literature, no comprehensive proof of the convergence and uniqueness of the FPA is given. In this thesis we show how the FPA of analytical models of reliable Internet protocols such as TCP converges to a unique xed point. The thesis speci es the conditions necessary in order to use the FPA for solving analytical models of reliable Internet protocols. We also develop a general implementation algorithm of the FPA of analytical models of TCP performance for realistic and arbitrary network topologies involving heterogenous TCP connections crossing many bottleneck links. The models presented in this thesis give Internet performance metrics, assuming that only basic network parameters such as the network topology, the number of TCP connections, link capacity, distance between network nodes and router bu er sizes are known. To obtain the performance metrics, TCP and network sub{models are used. A closed network of :=G=1 queues is used to develop each TCP sub-model where each queue represents a state of a TCP connection. An M=M=1=K queue is used for each network sub{model which represents the output interface of an IP router with a bu er capacity of K 􀀀��������1 packets. The two sub-models are iteratively solved. We also give closed form expressions for important TCP performance values and distributions. We show how the geometric, bounded geometric and truncated geometric distributions can be used to model reliable protocols such as TCP. We give models of the congestion window cwnd size distribution by conditioning on the slow start threshold ssthresh distribution and vice-versa. We also present models of the probabilities of TCP timeout and triple duplicate ACK receptions. Numerical results based on comparisons against ns2 simulations show that our models are more accurate, simpler and computationally more e cient than another well known TCP model. Our models can therefore be used to rapidly analyze network topologies with several bottlenecks and obtain detailed performance metrics. / AFRIKAANSE OPSOMMING: Die meerderheid van die verkeer op die Internet gebruik die Transmission Control Protocol (TCP) as `n vervoer laag protokol vir die einde-tot-einde kontrole van inligting oordrag. Meting, simulasie en analitiese modelle is die tegnieke en gereedskap wat gebruik kan word om die Internet te ondersoek en verstaan. Meting kan slegs gebruik word om bestaande netwerke scenarios te verken. Meting is duur en onbuigsaam met die groei en samegesteldheid van die Internet. Simulasie modelle skaal nie met die groei van netwerk kapasiteit en gebruikers nie. Analitiese modelle wat berekening e ektief is is dus nodige gereedskap vir die ondersoek, ontwerp, afmeting en beplanning van IP (Internet Protocol) netwerke. Bestaande analitiese TCP modelle is of te eenvoudig om die interne dinamiek van die TCP saam te vat of hulle is te ingewikkeld om realistiese netwerk topologie met heelwat bottelnek skakels te analiseer. Literatuur toon dat die xed point algorithm (FPA) baie handig is vir die oplos van analitiese modelle van Internet verrigting. In hierdie tesis word vinnige en akkurate analitiese modelle van TCP verrigting opgelos deur FPA weergegee. Buiten wat deur eksperimentele literatuur aangedui word is daar geen omvattende bewyse van die konvergensie en uniekheid van die FPA nie. In hierdie tesis word aangedui hoe die FPA van analitiese modelle van betroubare Internet protokolle soos die TCP konvergeer na `n unieke vaste punt. Hierdie tesis spesi seer die voorwaardes benodig om die FPA te gebruik vir die oplos van analitiese modelle van realistiese Internet protokolle. `n Algemene uitvoer algoritme van die FPA van analitiese modelle van TCP vir realistiese en arbitr^ere netwerk topogra e insluitende heterogene TCP konneksies oor baie bottelnek skakels is ontwikkel. Die model in hierdie tesis gee Internet verrigting metodes met die aanname dat slegs basiese netwerk parameters soos netwerk topologie, die aantal TCP konneksies, die konneksie kapasiteit, afstand tussen netwerk nodusse en die roete bu er grotes bekend is. Om die verrigting metodes te verkry, word TCP en netwerk sub-modelle gebruik. `n Geslote netwerk van :=G=1 rye is gebruik om elke TCP sub-model, waar elke ry 'n toestand van `n TCP konneksie voorstel, te ontwikkel. `n M=M=1=K ry is gebruik vir elke netwerk sub-model wat die uitset koppelvlak van `n IP roetemaker met `n bu er kapasiteit van K 􀀀������� 1 pakkies voorstel. Die twee submodelle word iteratief opgelos. Geslote vorm uitdrukkings vir belangrike TCP verrigting waardes en verspreidings word gegee. Daar word getoon hoe geometriese, begrensde geometriese en geknotte geometriese verspreidings gebruik kan word om betroubare protokolle soos die TCP te modelleer. Modelle van die kongestie venster cwnd grootte verspreiding word gegee deur die kondisionering van die stadige aanvang drempel ssthresh verspreiding en andersom. Modelle van die voorspelling van TCP tyduit en trippel duplikaat ACK resepsie word weergegee. Numeriese resultate gebaseer op vergelykings met ns2 simulasies wys dat ons modelle meer akkuraat, eenvoudiger en berekeningsgewys meer e ektief is as ander wel bekende TCP modelle. Ons modelle kan dus gebruik word vir vinnig analise van netwerk topologie met verskeie bottelnekke en om gedetailleerde verrigting metodes te bekom.

Thesis (MSc)--University of Stellenbosch, 2007. / ENGLISH ABSTRACT: We use Evolutionary Multi-Objective Optimisation (EMOO) algorithms to optimise objective functions that reflect situations in communication networks. These include functions that optimise Network Engineering (NE) objective functions in core, metro and wireless sensor networks. The main contributions of this thesis are threefold. Routing and Wavelength Assignment (RWA) for IP backbone networks. Routing and Wavelength Assignment (RWA) is a problem that has been widely addressed by the optical research community. A recent interest in this problem has been raised by the need to achieve routing optimisation in the emerging generation multilayer networks where data networks are layered above a Dense Wavelength Division Multiplexing (DWDM) network. We formulate the RWA as both a single and a multi-objective optimisation problem which are solved using a two-step solution where (1) a set of paths are found using genetic optimisation and (2) a graph coloring approach is implemented to assign wavelengths to these paths. The experimental results from both optimisation scenarios reveal the impact of (1) the cost metric used which equivalently defines the fitness function (2) the algorithmic solution adopted and (3) the topology of the network on the performance achieved by the RWA procedure in terms of path quality and wavelength assignment. Optimisation of Arrayed Waveguide Grating (AWG) Metro Networks. An Arrayed Waveguide Grating (AWG) is a device that can be used as a multiplexer or demultiplexer in WDM systems. It can also be used as a drop-and-insert element or even a wavelength router. We take a closer look at how the hardware and software parameters of an AWG can be fine tuned in order to maximise throughput and minimise the delay. We adopt a multi-objective optimisation approach for multi-service AWG-based single hop metro WDM networks. Using a previously proposed multi-objective optimisation model as a benchmark, we propose several EMOO solutions and compare their efficiency by evaluating their impact on the performance achieved by the AWG optimisation process. Simulation reveals that (1) different EMOO algorithms can exhibit different performance patterns and (2) good network planning and operation solutions for a wide range of traffic scenarios can result from a well selected EMOO algorithm. Wireless Sensor Networks (WSNs) Topology (layout) Optimisation. WSNs have been used in a number of application areas to achieve vital functions in situations where humans cannot constantly be available for certain tasks such as in hostile areas like war zones, seismic sensing where continuous inspection and detection are needed, and many other applications such as environment monitoring, military operations and surveillance. Research and practice have shown that there is a need to optimise the topology (layout) of such sensors on the ground because the position on which they land may affect the sensing efficiency. We formulate the problem of layout optimisation as a multi-objective optimisation problem consisting of maximising both the coverage (area) and the lifetime of the wireless sensor network. We propose different algorithmic evolutionary multi-objective methods and compare their performance in terms of Pareto solutions. Simulations reveal that the Pareto solutions found lead to different performance patterns and types of layouts. / AFRIKAANSE OPSOMMING: Ons gebruik ”Evolutionary Multi-Objective Optimisation (EMOO)” algoritmes om teiken funksies, wat egte situasies in kommunikasie netwerke voorstel, te optimiseer. Hierdie sluit funksies in wat ”Network Engineering” teiken funksies in kern, metro en wireless sensor netwerke optimiseer. Die hoof doelwitte van hierdie tesis is dus drievuldig. RWA vir IP backbone netwerke ”Routing and Wavelength Assignment (RWA)” is ’n probleem wat al menigte kere in die optiese navorsings kringe aangespreek is. Belangstelling in hierdie veld het onlangs ontstaan a.g.v. die aanvraag na die optimisering van routering in die opkomende generasie van veelvuldige vlak netwerke waar data netwerke in ’n vlak ho¨er as ’n ”Dense Wavelength Division Multiplexing (DWDM)” netwerk gele is. Ons formuleer die RWA as beide ’n enkele and veelvuldige teiken optimiserings probleem wat opgelos word deur ’n 2-stap oplossing waar (1) ’n stel roetes gevind word deur genetiese optimisering te gebruik en (2) ’n grafiek kleuring benadering geimplementeer word om golflengtes aan hierdie roetes toe te ken. Die eksperimentele resultate van beide optimiserings gevalle vertoon die impak van (1) die koste on wat gebruik word wat die ekwalente fitness funksie definieer , (2) die algoritmiese oplossing wat gebruik word en (3) die topologie van die netwerk op die werkverrigting van die RWA prosedure i.t.v. roete kwaliteit en golflengte toekenning. Optimisering van AWG Metro netwerk ’n ”Arrayed Waveguide Grating (AWG)” is ’n toestel wat gebruik kan word as ’n multipleksor of demultipleksor in WDM sisteme. Dit kan ook gebruik word as ’n val-en-inplaas element of selfs ’n golflengte router. Kennis word ingestel na hoe die hardeware en sagteware parameters van ’n AWG ingestel kan word om die deurset tempo te maksimeer en vertragings te minimiseer. Ons neem ’n multi-teiken optimiserings benadering vir multi diens, AWG gebaseerde, enkel skakel, metro WDM netwerke aan. Deur ’n vooraf voorgestelde multi teiken optimiserings model as ”benchmark” te gebruik, stel ons ’n aantal EMOO oplossings voor en vergelyk ons hul effektiwiteit deur hul impak op die werkverrigting wat deur die AWG optimiserings proses bereik kan word, te vergelyk. Simulasie modelle wys dat (1) verskillende EMOO algoritmes verskillende werkverrigtings patrone kan vertoon en (2) dat goeie netwerk beplanning en werking oplossings vir ’n wye verskeidenheid van verkeer gevalle kan plaasvind a.g.v ’n EMOO algoritme wat reg gekies word. ”Wireless Sensor Network” Topologie Optimisering WSNs is al gebruik om belangrike funksies te verrig in ’n aantal toepassings waar menslike beheer nie konstant beskikbaar is nie, of kan wees nie. Voorbeelde van sulke gevalle is oorlog gebiede, seismiese metings waar aaneenlopende inspeksie en meting nodig is, omgewings meting, militˆere operasies en bewaking. Navorsing en praktiese toepassing het getoon dat daar ’n aanvraag na die optimisering van die topologie van sulke sensors is, gebaseer op gronde van die feit dat die posisie waar die sensor beland, die effektiwiteit van die sensor kan affekteer. Ons formuleer die probleem van uitleg optimisering as ’n veelvuldige vlak optimiserings probleem wat bestaan uit die maksimering van beide die bedekkings area en die leeftyd van die wireless sensor netwerk. Ons stel verskillende algoritmiese, evolutionˆere, veelvuldige vlak oplossings voor en vergelyk hul werkverrigting i.t.v Pareto oplossings. Simulasie modelle wys dat die Pareto oplossings wat gevind word lei na verskillende werkverrigtings patrone en uitleg tipes.

Wireless Sensor Networks(WSNs) have gained a lot of attention because of their potential to immerse deeper into people' lives. The applications of WSNs range from small home environment networks to large habitat monitoring. These highly diverse scenarios impose different requirements on WSNs and lead to distinct design and implementation decisions. This thesis presents an optimization framework for WSN design which selects a proper set of protocols and number of nodes before a practical network deployment. A Genetic Algorithm(GA)-based Sensor Network Design Tool(SNDT) is proposed in this work for wireless sensor network design in terms of performance, considering application-specific requirements, deployment constrains and energy characteristics. SNDT relies on offine simulation analysis to help resolve design decisions. A GA is used as the optimization tool of the proposed system and an appropriate fitness function is derived to incorporate many aspects of network performance. The configuration attributes optimized by SNDT comprise the communication protocol selection and the number of nodes deployed in a fixed area. Three specific cases : a periodic-measuring application, an event detection type of application and a tracking-based application are considered to demonstrate and assess how the proposed framework performs. Considering the initial requirements of each case, the solutions provided by SNDT were proven to be favourable in terms of energy consumption, end-to-end delay and loss. The user-defined application requirements were successfully achieved.

Software-Defined Networking (SDN) is a network architecture that differs from traditionalnetwork planes. SDN has tree layers: infrastructure, controller, and application. Thegoal of SDN is to simplify management of larger networks by centralizing control into thecontroller layer instead of having it in the infrastructure. Given the known advantages ofSDN networks, and the flexibility of cloud computing. We are interested if this combinationof SDN and cloud services affects network performance, and what affect the cloud providersphysical location have on the network performance. These points are important whenSDN becomes more popular in enterprise networks. This seems like a logical next step inSDN, centralizing branch networks into one cloud-based SDN controller. These questionswere created with a literature studies and answered with an experimentation method. Theexperiments consist of two network topologies both locally hosted SDN (baseline) and cloudhosted SDN. The topology used Zodiac FX switches and Linux hosts. The following metricswas measured: throughput, latency, jitter, packet loss, and time to add new hosts. Theconclusion is that SDN as a cloud service is possible and does not significantly affect networkperformance. One limitation with this thesis was the hardware, resulting in big fluctuationin throughput and packet loss.

This research is concerned with the technoeconomic aspects of modern and next-generation telecommunications including the Internet service. The goal of this study thereof is tailored to address the following: (i) Reviewing the technoeconomic considerations prevailing in telecommunication (telco) systems and their implicating futures; (ii) studying relevant considerations by depicting the modern/next-generation telecommunications as a digital ecosystem viewed in terms of underlying complex system evolution (akin to biological systems); (iii) pursuant to the digital ecosystem concept, co-evolution modeling of competitive business structures in the technoeconomics of telco services using dichotomous (flip-flop) states as seen in prey-predator evolution; (iv) specific to Internet pricing economics, deducing the profile of consumer surplus versus pricing model under DiffServ QoS architecture pertinent to dynamic- , smart- and static-markets; (v) developing and exemplifying decision-making pursuits in telco business under non-competitive and competitive markets (via gametheoretic approach); (vi) and modeling forecasting issues in telco services addressed in terms of a simplified ARIMA-based time-series approach, (which includes seasonal and non-seasonal data plus goodness-fit estimations in time- and frequency-domains). Commensurate with the topics indicated above, necessary analytical derivations/models are proposed and computational exercises are performed (with MatLabTM R2006b and other software as needed). Extensive data gathered from open literature are used thereof and, ad hoc model verifications are performed. Lastly, results are discussed, inferences are made and open-questions for further research are identified. / by Renata Cristina Tourinho Sardenberg. / Thesis (Ph.D.)--Florida Atlantic University, 2010. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web.

Sun Weng Hong. / Thesis submitted in: October 2002. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 116-121). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.7 / Chapter 2. --- Ant Colony Optimization (ACO) --- p.9 / Chapter 2.1 --- ACO vs. Traditional Routing --- p.10 / Chapter 2.1.1 --- Routing information --- p.10 / Chapter 2.1.2 --- Routing overhead --- p.12 / Chapter 2.1.3 --- Adaptivity and Stagnation --- p.14 / Chapter 2.2 --- Approaches to Mitigate Stagnation --- p.15 / Chapter 2.2.1 --- Pheromone control --- p.15 / Chapter 2.2.1.1 --- Evaporation: --- p.15 / Chapter 2.2.1.2 --- Aging: --- p.16 / Chapter 2.2.1.3 --- Limiting and smoothing pheromone: --- p.17 / Chapter 2.2.2 --- Pheromone-Heuristic Control --- p.18 / Chapter 2.2.3 --- Privileged Pheromone Laying --- p.19 / Chapter 2.2.4 --- Critique and Comparison --- p.21 / Chapter 2.2.4.1 --- Aging --- p.22 / Chapter 2.2.4.2 --- Limiting pheromone --- p.22 / Chapter 2.2.4.3 --- Pheromone smoothing --- p.23 / Chapter 2.2.4.4 --- Evaporation --- p.25 / Chapter 2.2.4.5 --- Privileged Pheromone Laying --- p.25 / Chapter 2.2.4.6 --- Pheromone-heuristic control --- p.26 / Chapter 2.3 --- ACO in Routing and Load Balancing --- p.27 / Chapter 2.3.1 --- Ant-based Control and Its Ramifications --- p.27 / Chapter 2.3.2 --- AntNet and Its Extensions --- p.35 / Chapter 2.3.3 --- ASGA and SynthECA --- p.40 / Chapter 3. --- Multiple Ant Colony Optimization (MACO) --- p.45 / Chapter 4. --- MACO vs. ACO --- p.51 / Chapter 4.1 --- Analysis of MACO vs. ACO --- p.53 / Chapter 5. --- Applying MACO in Load Balancing --- p.89 / Chapter 5.1 --- Applying MACO in Load-balancing --- p.89 / Chapter 5.2 --- Problem Formulation --- p.91 / Chapter 5.3 --- Types of ant in MACO --- p.93 / Chapter 5.3.1 --- Allocator. --- p.94 / Chapter 5.3.2 --- Destagnator. --- p.95 / Chapter 5.3.3 --- Deallocator. --- p.100 / Chapter 5.4 --- Global Algorithm --- p.100 / Chapter 5.5 --- Discussion of the number of ant colonies --- p.103 / Chapter 6. --- Experimental Results --- p.105 / Chapter 7. --- Conclusion --- p.114 / Chapter 8. --- References --- p.116 / Appendix A. Ants in MACO --- p.122 / Appendix B. Ants in SACO. --- p.123

Although the overall levels of harmonics in modern power supply systems are in most of the practical cases still below the prescribed tolerance limits and thresholds (e.g. these stipulated in [IEC 61000-3-2 and 61000-3-12]), the sources of harmonics are constantly increasing in numbers and are expected to increase even more in the future. Some of the examples of modern non-linear power electronic (PE) devices that are expected to be employed on a much wider scale in LV networks in the future include: light-emitting diode (LED) lamps, switched-mode power supplies (SMPS'), electric vehicle battery chargers (EVBCs) and photovoltaic inverters (PVIs), which are all analysed in this thesis. The thesis first reviews the conventional harmonic analysis methods, investigating their applicability to modern PE devices. After that, the two most widely used forms of harmonic models, i.e. component-based models (CBMs) and frequency-domain models (FDMs), are applied for modelling of the four abovementioned types of modern PE devices and their models are fully validated by measurements. The thesis next investigates the impact of supply voltage conditions and operating modes (e.g. low vs high operating powers) on the device characteristics and performance, using both measurements and developed CBMs and FDMs. The obtained results confirm that both supply conditions and operating modes have an impact on the characteristics of most of the considered PE devices, which is taken into account in the developed models and demonstrated on a number of case studies. As the next contribution, the thesis proposes new indices for the evaluation of current waveform distortions, allowing for a separate analysis of contributions of low and high frequency harmonics and interharmonics to the total waveform distortion of PE devices. As the modern PE devices are normally based on high-frequency switching converters or inverters, the impact of circuit topologies and control algorithms on their harmonic emission characteristics and performance is also investigated. Special attention is given to the operation of PE devices at low powers, when there is a significant increase of current waveform distortion, a substantial decrease of efficiency and power factors and when input ac current might lose its periodicity with the supply voltage frequency. This is analysed in detail for SMPS', resulting in the proposal of a new methodology ("operating cycle based method") for evaluating overall performance of PE devices across the entire range of operating powers. Finally, a novel and simple hybrid harmonic modelling technique, allowing for the use of both time-domain and frequency-domain models in the same simulation environment, is proposed and illustrated on the selected case studies. This is accompanied with a frequency-domain aggregation approach, which is applied in the thesis to investigate the impact of increasing numbers of different types of modern PE devices on the LV network. The implementation of the developed hybrid harmonic modelling approach and frequency-domain aggregation technique is demonstrated on the example of a typical (UK) urban generic LV distribution network and used for the analysis of different deployment levels of EVs and PVIs. The presented harmonic modelling framework for individual PE devices and, particularly, for their aggregate models, fills the gap in the existing literature on harmonic modelling and characterisation of modern PE devices, which is important for the correct evaluation of their harmonic interactions and analysis of the impact of their large-scale deployment on the overall network performance.

The Internet Engineering Task Force (IETF) has recently released network mobility standards that allow deployment of TCP/IP networks onboard a vehicle and maintain permanent network connectivity to the Internet via a vehicular mobile router. This recent development opens up new opportunities for providing efficient mobile computing for users on the move, especially for commuters traveling on public transports. Moreover, central and coordinated management of mobility in a single router, rather than by each user device individually, has numerous advantages. In this architecture, however, it becomes challenging to guarantee network performance due to the mobility of the network and inherently vulnerable nature of wireless links. In this thesis, a detailed performance study of onboard networks is conducted. It has been shown that disruptions in the mobile router connectivity can significantly degrade network throughput. Moreover, factors such as the limited wireless bandwidth of the access link, variations in the bandwidth due to technology switching, and the communication diversity of onboard users all contribute to the problem of unfair sharing of wireless bandwidth. By leveraging the fact that all onboard communications go through the mobile router, performance enhancing solutions are proposed that can be deployed in the mobile router to transparently address the throughput and fairness problems. In this architecture, when the route is known in advance and repetitive (e.g. for public transport or a regularly commuting private vehicle), a certain degree of prediction of impending link disruptions is possible. An anticipatory state freezing mechanism is proposed that relies on the prediction of link disruptions to freeze and unfreeze the state machine of TCP, the widely used transport protocol in the Internet. Simulation study shows that TCP throughput has a non-linear relationship with the prediction accuracy. As prediction accuracy increases, throughput problem diminishes quickly. An adaptive mobile router based fairness control mechanism is proposed to address the unfair sharing of wireless bandwidth in highly dynamic scenarios. The fairness is controlled by dynamically estimating the round-trip-times of all onboard TCP connections and transparently adjusting the protocol control parameters at the router. The thesis also discusses implementation issues for the proposed solutions.

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. Due to the limitations in the wireless environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The basic access method in IEEE 802.11 ad hoc networks is the Distributed Coordination Function (DCF), which provides a fair medium access. Enhanced Distributed Coordination Function (EDCF) has been developed to provide service differentiation among different traffic flows. In this thesis, we investigate the performance of the EDCF with routing protocols / Direct Sequenced Distance Vector (DSDV) and Dynamic Source Routing (DSR) by simulations.

The MultiProtocol Label Switching (MPLS) framework is used in many networks to provide efficient load balancing which distributes the traffic for efficient Quality of Service (QoS) provisioning in the network. If the MPLS framework is combined with Differentiated Services (DiffServ) architecture, together they can provide aggregate-based service differentiation and QoS. The combined use of DiffServ and MPLS in a network is called DiffServ-aware Traffic Engineering (DS-TE). Such DiffServ-based MPLS networks demand development of efficient methods for QoS provisioning. In this thesis, an automated manager for management of these DiffServ-based MPLS networks is proposed. This manager, called Traffic Engineering Automated Manager (TEAM), is a centralized authority for adaptively managing a DiffServ/MPLS domain and it is responsible for dynamic bandwidth and route management. TEAM is designed to provide a novel and unique architecture capable of managing large scale MPLS/DiffServ domains without any human interference. TEAM constantly monitors the network state and reconfigures the network for efficient handling of network events. Under the umbrella of TEAM, new schemes for Label Switched Path (LSP) setup/teardown, traffic routing, and network measurement are proposed and evaluated through simulations. Also, extensions to include Generalized MPLS (GMPLS) networks and inter-domain management are proposed.