Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm

Win, Zin Me Me; Maw, Tin Win

MERAL Myanmar Education Research and Learning Portal

Index Tree

RootNode
- Co-operative College, Mandalay
- Cooperative College, Phaunggyi
- Co-operative University, Sagaing
- Co-operative University, Thanlyin
- Dagon University
- Kyaukse University
- Laquarware Technological college
- Mandalay Technological University
- Mandalay University of Distance Education
- Mandalay University of Foreign Languages
- Maubin University
- Mawlamyine University
- Meiktila University
- Mohnyin University
- Myanmar Institute of Information Technology
- Myanmar Maritime University
- National Management Degree College
- Naypyitaw State Academy
- Pathein University
- Sagaing University
- Sagaing University of Education
- Taunggyi University
- Technological University, Hmawbi
- Technological University (Kyaukse)
- Technological University Mandalay
- University of Computer Studies, Mandalay
- University of Computer Studies Maubin
- University of Computer Studies, Meikhtila
- University of Computer Studies Pathein
- University of Computer Studies, Taungoo
- University of Computer Studies, Yangon
- University of Dental Medicine Mandalay
- University of Dental Medicine, Yangon
- University of Information Technology
- University of Mandalay
- University of Medicine 1
- University of Medicine 2
- University of Medicine Mandalay
- University of Myitkyina
- University of Public Health, Yangon
- University of Veterinary Science
- University of Yangon
- West Yangon University
- Yadanabon University
- Yangon Technological University
- Yangon University of Distance Education
- Yangon University of Economics
- Yangon University of Education
- Yangon University of Foreign Languages
- Yezin Agricultural University
- New Index

Item

{"_buckets": {"deposit": "f884e3b5-f5e8-40fe-8ce9-6c5d07a3367b"}, "_deposit": {"id": "3389", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3389"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3389", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "With the significant increment of today’s network, there is a decrease in the efficiency of the network. The performance and reliability of the Internet depend, in large part, on the operation of the routing protocols. Routing protocols compute paths based on the network topology and configuration parameters. This paper presents the enhancing network routing by using modified Dijkstra’s shortest path algorithm and focuses on distance. The proposed system identifies the shortest route faster than Dijkstra’s algorithm. It provides optimized route by refining the steps in the Dijkstra’s algorithm for computing and network efficiency. Simulation system is implemented for routers using java programming language."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-22"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (206).pdf", "filesize": [{"value": "382 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 382000.0, "url": {"url": "https://meral.edu.mm/record/3389/files/psc2010paper (206).pdf"}, "version_id": "0cc43aba-0108-42da-973b-9451a04b7b95"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fifth Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Win, Zin Me Me"}, {"subitem_authors_fullname": "Maw, Tin Win"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2010-12-16"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1145"}, "item_title": "Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003389", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-22"}, "publish_date": "2019-07-22", "publish_status": "0", "recid": "3389", "relation": {}, "relation_version_is_last": true, "title": ["Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm"], "weko_shared_id": -1}