Farago, Andras2017-06-262017-06-262017-052017-05May 2017http://hdl.handle.net/10735.1/5445Traffic engineering (TE) helps to use network resources more efficiently. Network operators use TE to obtain different objectives such as load balancing, congestion avoidance and average delay reduction. We approach the issue using optimization theory and a network design game model. Also routing methods for optimal distribution of traffic in data networks that can also provide quality of service (QoS) for users is one of the challenges in recent years’ research on next generation networks. The major QoS requirement in most cases is an upper bound on end-to-end path delay. In this dissertation, we address the problem of parallelizing some network algorithms on a practical distributed memory system. Also we use approximation approach for analyzing NP hard problems in networks.application/pdfenCopyright ©2017 is held by the author. Digital access to this material is made possible by the Eugene McDermott Library. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.Quality of service (Computer networks)Mathematical optimizationTraffic engineeringTraffic congestion—ManagementLarge scale systemsAutonomous distributed systemsDissertation2017-06-26