A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007)
Includes bibliographical references (l. 44-46).
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | masterThesis |
| منشور في: |
2007
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/930 https://doi.org/10.26756/th.2007.45 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513455362408448 |
|---|---|
| author | Fares, Joseph |
| author_facet | Fares, Joseph |
| author_role | author |
| dc.creator.none.fl_str_mv | Fares, Joseph |
| dc.date.none.fl_str_mv | 2007 2007-06-29 2011-10-27T09:47:29Z 2011-10-27T09:47:29Z 2011-10-27 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/930 https://doi.org/10.26756/th.2007.45 |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Lebanese American University |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Fault-tolerant computing System design Computer network protocols |
| dc.title.none.fl_str_mv | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| dc.type.none.fl_str_mv | Thesis info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/masterThesis |
| description | Includes bibliographical references (l. 44-46). |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | LAURepo_a5238a741ee21096fe058798eb322fb7 |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/930 |
| publishDate | 2007 |
| publisher.none.fl_str_mv | Lebanese American University |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007)Fares, JosephFault-tolerant computingSystem designComputer network protocolsIncludes bibliographical references (l. 44-46).This work proposes a solution for the shortest path algorithm for large spectrum graphs. The problem is of particular interest for applications in computer networks as well as in road networks. We tackle this problem in two stages. In the first stage an evolutionary algorithm for networks-based applications is formulated with a special interest emphasis on fault-tolerance, an important issue due to dynamic changes in routing configuration. In the second phase, we tackle large spectrum graphs where the evolutionary algorithm is applied using database constructs. Thus, the graph is stored in a database and the evolutionary algorithm is formulated using SQL queries. The operators as well as the selection operators are all database-based. The algorithm is attempted on the DIMACS challenge for the USA routes and favorable results are reported.1 bound copy: iii, 48 leaves; 30 cm. Available at RNL.Lebanese American University2011-10-27T09:47:29Z2011-10-27T09:47:29Z20072011-10-272007-06-29Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/930https://doi.org/10.26756/th.2007.45eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/9302020-05-18T14:53:53Z |
| spellingShingle | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) Fares, Joseph Fault-tolerant computing System design Computer network protocols |
| status_str | publishedVersion |
| title | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| title_full | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| title_fullStr | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| title_full_unstemmed | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| title_short | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| title_sort | A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) |
| topic | Fault-tolerant computing System design Computer network protocols |
| url | http://hdl.handle.net/10725/930 https://doi.org/10.26756/th.2007.45 |