اخبار و اعلانات

 آمار

تعداد نشریات43
تعداد شماره‌ها1,686
تعداد مقالات13,785
تعداد مشاهده مقاله32,348,008
تعداد دریافت فایل اصل مقاله12,782,128
Shabanian, Touraj, Hashemi, Massoud, Askarian, Ahmad, Omoomi, Behnaz. (1392). An Optimal Traffic Distribution Method Supporting End-to-End Delay Bound. , 1(1), 61-71.
Touraj Shabanian; Massoud Reza Hashemi; Ahmad Askarian; Behnaz Omoomi. "An Optimal Traffic Distribution Method Supporting End-to-End Delay Bound". , 1, 1, 1392, 61-71.
Shabanian, Touraj, Hashemi, Massoud, Askarian, Ahmad, Omoomi, Behnaz. (1392). 'An Optimal Traffic Distribution Method Supporting End-to-End Delay Bound', , 1(1), pp. 61-71.
Shabanian, Touraj, Hashemi, Massoud, Askarian, Ahmad, Omoomi, Behnaz. An Optimal Traffic Distribution Method Supporting End-to-End Delay Bound. , 1392; 1(1): 61-71.

An Optimal Traffic Distribution Method Supporting End-to-End Delay Bound

Journal of Computing and Security
مقاله 6، دوره 1، شماره 1، فروردین 2014، صفحه 61-71    اصل مقاله (1019.18 K)
نویسندگان
Touraj Shabanian* 1؛ Massoud Reza Hashemi2؛ Ahmad Askarian2؛ Behnaz Omoomi3
1Isfahan University of Technology
2Department of Electrical and Computer Engineering , Isfahan University of Technology, Isfahan, Iran.
3Department of Mathematical Science, Isfahan University of Technology, Isfahan, Iran.
چکیده
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 multipath virtual circuit switched networks each session distributes its traffic among a set of available paths. If all possible paths are considered available, then the source's decision on its traffic distribution can be considered as routing. A model of the routing function as a mathematical problem which distributes the input traffic over possible paths for each session is proposed here. A distributed and iterative algorithm which will keep the average end-to-end delay for individual paths below a required bound is introduced. This algorithm minimizes the total average delay of all packets in the network. The convergence of the algorithm is illustrated. 
کلیدواژه‌ها
Traffic Distribution؛ Routing؛ Convex Optimization؛ Subgradient Method
آمار
تعداد مشاهده مقاله: 1,757
تعداد دریافت فایل اصل مقاله: 359


سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب