کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481898 | 1446192 | 2007 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Internet packet routing: Application of a K-quickest path algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Internet packet routing: Application of a K-quickest path algorithm Internet packet routing: Application of a K-quickest path algorithm](/preview/png/481898.png)
چکیده انگلیسی
This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely its self-similar stochastic nature. Results concerning the average CPU times of the algorithm for the different sets of experiments will be presented and discussed.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 181, Issue 3, 16 September 2007, Pages 1045–1054
Journal: European Journal of Operational Research - Volume 181, Issue 3, 16 September 2007, Pages 1045–1054
نویسندگان
João C.N. Clímaco, Marta M.B. Pascoal, José M.F. Craveirinha, M. Eugénia V. Captivo,