| دانلود رایگان مقاله انگلیسی + خرید ترجمه فارسی
|
|
| عنوان فارسی مقاله: |
معرفی روشی جدید برای حل مسیریابی چند بخشی QoS براساس الگوریتم جستجوی هارمونی |
| عنوان انگلیسی مقاله: |
Presenting a New Method to Solve QoS Multicast Routing Based on Harmony Search Algorithm |
|
|
| مشخصات مقاله انگلیسی (PDF) | |
| سال انتشار مقاله | 2013 |
| تعداد صفحات مقاله انگلیسی | 13 صفحه با فرمت pdf |
| رشته های مرتبط با این مقاله | مهندسی کامپیوتر و مهندسی فناوری اطلاعات |
| گرایش های مرتبط با این مقاله | شبکه های کامپیوتری، مهندسی الگوریتم ها و محاسبات، نرم افزار و سخت افزار |
| مجله مربوطه | مجله بین المللی علوم کامپیوتر و راه حل های شبکه(International journal of Computer Science & Network Solutions) |
| دانشگاه تهیه کننده | گروه مهندسی کامپیوتر، دانشگاه آزاد اسلامی، واحد دزفول |
| کلمات کلیدی این مقاله | مسیریابی چندبخشی، درخت مقید Steiner ، کیفیت سرویس، الگوریتم های جستجوی هارمونی |
| رفرنس | دارد |
| نشریه | Ijcsns |
| مشخصات و وضعیت ترجمه فارسی این مقاله (Word) | |
| تعداد صفحات ترجمه تایپ شده با فرمت ورد با قابلیت ویرایش و فونت 14 B Nazanin | 15 صفحه |
| ترجمه عناوین تصاویر و جداول | ترجمه شده است |
| ترجمه متون داخل تصاویر و جداول | ترجمه نشده است |
| درج تصاویر در فایل ترجمه | درج شده است |
| درج جداول در فایل ترجمه | درج شده است |
| درج فرمولها و محاسبات در فایل ترجمه به صورت عکس | درج شده است |
- فهرست مطالب:
چکیده
۱ مقدمه
۲ توصیف و فرمول نویسی مسئله
A ارزیابی راه حل ها
۳ الگوریتم جستجوی هارمونی
۴ نمایش روش پیشنهادی
A نمایش
B تولید جمعیت اولیه
C تولید جمعیت اولیه
۵ نتایج شبیه سازی
۶ نتایج
- بخشی از ترجمه:
در این مقاله، ابتدا مسئله مسیریابی چند بخشی را با در نظر گرفتن محدودیت های QoS شرح داده و سپس الگوریتم پیشنهادی، براساس جستجوی هارمونی برای حل این مسئله مطرح گردید. نتایج شبیه سازی نشان داد که الگوریتم پیشنهادی، در بهینه محلی گیر نیفتاد، و هرچند نسبت رشد زمان اجرا متناسب با افزایش اعضای گروه چند بخشی بزرگتر از الگوریتم بهینه سازی ازدحام ذرات است، اما به طور کلی، با توجه به نرخ خطای نسبی، کیفیت راه حل ها و همچنین زمان برای رسیدن به راه حل بهینه کلی، عملکرد درست تری در مقایسه با الگوریتم بهینه سازی ازدحام ذرات و سایر الگوریتم های مقایسه شده از خود به معرض نمایش می گذارد.
- بخشی از مقاله انگلیسی:
Introduction Most of network applications in the past, had been unicast applications in which the quality of service (QoS) wasn’t considered, significantly. For this reason, the routing algorithms were very simple and elementary. But today, by expanding the technology in real-time multimedia applications such as video conference, virtual universities, on web multimedia games and etc. this format won’t be responsible; because in these applications, data’s are received by more than one user in which each of them has different QoS requirements, in various times. So, the resources must be managed in a manner that the QoS requirements can be reached for each user. Thus it can be said the key for solving this problem is having a proper scheme and method for routing while considering QoS criterions. Supporting a resource to communicate with several destinations requires applying and developing the multicast routing in the network. Regarding this fact that multicast algorithms have tree structures, it should be possible to find a tree with minimum cost in the network, such that it can connect a source node to all destination nodes, and Simultaneously, reach the intended constraints of QoS. Finding such tree in the network has been known as constrained Steiner tree problem and is included as NP-Complete problems (Karp, 1972). Hitherto, several innovative methods have been presented for solving this problem, among which the Kompella–Pasquale–Polyzos KPP heuristic (Kompella et al., 1993) and the bounded shortest multicast algorithm BSMA heuristic (Qing et al., 1995) can be mentioned. These two algorithms have solved this problem by regarding the delay, as a QoS parameter. But the simulation results performed by Salama (1997) showed that most innovative algorithms either perform very slowly or are not able to compute the minimal multicast tree with mentioned constraint. Also, it must be noted that the above algorithms have been designed for some special applications and have taken to consideration one constraint only, without can be generalized for real time applications, with more QoS constraints. So, using meta-heuristic algorithms inspired from the nature appeared to be more proper option for solving such these complex problems. As the advantages of using these algorithms, their wide application in solving diverse problems, high flexibility and easy implementation can be indexed. Although these algorithms don’t guarantee the reaching to global optimal solutions, but in most cases, they can generate proper approximated solutions. For example, Haghighat et al. (2004) have tried to solving multicast routing problem while considering the constraints the delay and the bandwidth, by using genetic algorithm. They presented two novel methods for crossover operator, and by investigating different combinations of genetic algorithm operators and some kinds of coding usable in it, they presented a method that could generate appropriate multicast tree in most cases. But by increasing the size of network, sometime while computing global optimal solution, this method had been caught in local optima. Wang et al. (2004), presented a method named TSDLMRA that tries to solving Qos multicast routing problem with considering the delay as a constraint, by using Tabu search algorithm, In their proposed method, a set of supply paths were created by using the K-th shortest path algorithm and selecting the neighborhood for each destination node were done among these paths. The low time complexity, O (Kmn 3 ), was one of strength points of this algorithm. Wang et al. (2007) have tried to solving the mentioned problem with considering the delay and bandwidth, by using the particle swarm optimization algorithm. In their proposed algorithm, each particle was introduced as a solution for the problem and the particles, by knowing their current optimal position and the global optimal position, try to change their position and search the whole solution space. The advantage of their algorithm is an appropriate speed and relatively appropriate quality in term of generated solutions. TayebTaher and Rahmani (2012) have solved the problem by using Bee algorithm, while considering two constraints the delay and the bandwidth. They performed neighbor searching based on grading the space regions and designating the bees to these regions. Also, they presented a novel fitness function which could evaluate the solutions qualities, very well. There proposed method also had a proper performance in escaping from local minima. But disadvantage of their proposed method was slow converging. Kun et al. (2005), have tried to solving the distributed multicast routing problem with considering the delay and delay variation, as constraints, by using the simulated annealing algorithm. Their proposed method had two phases.
| دانلود رایگان مقاله انگلیسی + خرید ترجمه فارسی
|
|
| عنوان فارسی مقاله: |
کاربرد الگوریتم جستجوی هارمونی در حل مسیریابی چندگانه QoS |
| عنوان انگلیسی مقاله: |
Presenting a New Method to Solve QoS Multicast Routing Based on Harmony Search Algorithm |
|
|
