8345

585 دكتري

دكتري

برق

اصفهان: دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر

1392

دوازده،127ص.: مصور،جدول،نمودار

ص.ع.به فارسي و انگليسي

مسعودرضا هاشمي

بهناز عمومي

9/10/92

جمال الدين گلستاني، نغمه السادات مويديان، ناصر موحدي نيا

مهندسي برق و كامپيوتر

ID585 دكتري

به فارسي و انگليسي: قابل رويت در نسخه هاي ديجيتالي

Distributed Routing and Optimal Traffic Distribution Supporting End to End Delay Bounds Tooraj Shabanian Boroujeni shabanian@ec iut ac ir Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan Iran Degree Ph D Language Farsi Supervisor M R Hashemi hashemim@cc iut ac ir Advisor B Omoomi Omoomi@ec iut ac ir Department Graduate Program Coordinator M Omoomi Isfahan University of technology Isfahan Abstract 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 a distributed and iterative algorithm which will keep the end to end cost for individual paths below a required bound is introduced which also minimizes the total average delay of all packets in the network This algorithm is introduced based on analytical solution of a routing problem The routing problem is modeled as a multicommodity network flow problem with an extra constraint on end to end cost Eventually the convergence of the algorithm is shown using analysis and simulations PDF created with pdfFactory trial version www pdffactory com

مسعودرضا هاشمي

بهناز عمومي

جمال الدين گلستاني، نغمه السادات مويديان، ناصر موحدي نيا