An algorithm for acquiring reliable path in abnormal traffic condition
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Do-Hyeon | - |
dc.contributor.author | Kim, Doo-Young | - |
dc.contributor.author | Jung, Jaeil | - |
dc.contributor.author | An, Young-Soo | - |
dc.date.accessioned | 2022-12-21T01:39:17Z | - |
dc.date.available | 2022-12-21T01:39:17Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2008-08 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/178053 | - |
dc.description.abstract | Most Reliable Paths algorithm make it enable to select the most stable path on network by considering not only link cost but also link capacity, link operation probability and the size of message to be sent. But this algorithm uses a fixed value as link operation probability so that it can be applicable in the normal network state, not in the network state that traffic abnormally increase. To solve this problem, this thesis applies the packet drop probability of RED (Random Early Detection) method to the operation probability of the most reliable path algorithm so that the most reliable path can be guaranteed. For this purpose, we propose an All-Pairs Most Reliable Paths acquiring algorithm having time complexity θ(n3) based on the All-Pairs Shortest Paths algorithm proposed by Floyd-Warshall. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | An algorithm for acquiring reliable path in abnormal traffic condition | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jung, Jaeil | - |
dc.identifier.doi | 10.1109/ICHIT.2008.284 | - |
dc.identifier.scopusid | 2-s2.0-55849099618 | - |
dc.identifier.bibliographicCitation | Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008, pp.682 - 686 | - |
dc.relation.isPartOf | Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 | - |
dc.citation.title | Proceedings - 2008 International Conference on Convergence and Hybrid Information Technology, ICHIT 2008 | - |
dc.citation.startPage | 682 | - |
dc.citation.endPage | 686 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Computer networks | - |
dc.subject.keywordPlus | Information technology | - |
dc.subject.keywordPlus | Mergers and acquisitions | - |
dc.subject.keywordPlus | Probability | - |
dc.subject.keywordPlus | Random processes | - |
dc.subject.keywordPlus | As links | - |
dc.subject.keywordPlus | Link capacities | - |
dc.subject.keywordPlus | Link costs | - |
dc.subject.keywordPlus | Network states | - |
dc.subject.keywordPlus | Packet drops | - |
dc.subject.keywordPlus | PATH algorithms | - |
dc.subject.keywordPlus | Random Early Detections | - |
dc.subject.keywordPlus | Shortest paths | - |
dc.subject.keywordPlus | Stable paths | - |
dc.subject.keywordPlus | Time complexities | - |
dc.subject.keywordPlus | Traffic conditions | - |
dc.subject.keywordPlus | Algorithms | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/4622906/ | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.