Enhanced open shortest path first (OSPF) protocol using parallel tabu search - ring in wimax mesh network
Wireless mesh networks (WMNs) considered as self – organized, self – configured networks, and easily deployed ad hoc networks. Many ad hoc routing protocols were applied to WMNs and many studies were conducted to analyse the functionality of such networks. Many studies have been done on ad hoc rout...
محفوظ في:
المؤلف الرئيسي: | Ahmed, Bilal Abdulhaq |
---|---|
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2013
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/47580/1/FK%202013%2054.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A genetic algorithm solution to the shortest path problem in OSPF and MPLS /
بواسطة: Tee, Wee Jing
منشور في: (2002) -
Shortest Path Routing Using Heuristic Search
بواسطة: Alaiwan, Ahmed Omran A.
منشور في: (2006) -
Scheduling of routing table calculation schemes in open shortest path first using artificial neural network
بواسطة: Abu Yazid, Mohamad Haider
منشور في: (2013) -
Solving shortest path problem using gravitational search algorithm and neural networks
بواسطة: Sinaie, Saman
منشور في: (2010) -
Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems
بواسطة: Uvaraja, Vikneswary
منشور في: (2018)