MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "228b7fa9-b54f-4c8c-905b-4766758602c5"}, "_deposit": {"id": "4539", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4539"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4539", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Flow Path Computing in Software Defined Networking", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "With the rapid growth of current network, the demand of resources is growing significantly. Insufficient bandwidth results unstable throughput in a network. Software-defined network (SDN) has been proposed to provide optimal routing decision in the presence of congestion. Equal Cost Multi-path (ECMP) routing cannot guarantee optimal resource utilization. ECMP causes the long flow collision in network because it does not consider the network parameter such as bandwidth. In this paper, the Flow Path Computing Algorithm (FPCA) is proposed to minimize the network congestion by rerouting the flows in SDN. This algorithm mainly focuses on rerouting the traffic flows over the alternative path when the network congestion is detected. If the flow demand is exceeded 10% of link bandwidth, the algorithm computes the light loaded path based on the port statistics and it shifts from the congested path to light loaded path. Simulation results are presented to show the effectiveness of the FPCA algorithm over ECMP."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Software Defined Network"}, {"interim": "Equal Cost Multi-path"}, {"interim": "OpenFlow"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-12-27"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "ICAIT 2019-OMMM.pdf", "filesize": [{"value": "13645 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 13645000.0, "url": {"url": "https://meral.edu.mm/record/4539/files/ICAIT 2019-OMMM.pdf"}, "version_id": "25867f6e-f5f6-4389-9937-fd30647f41c1"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Proceedings of 2019 International Conference on Advanced Information technologies (ICAIT 2019)", "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": "Mon, Ohnmar Min"}, {"subitem_authors_fullname": "Mon, Myat Thida"}]}]}, "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": "2019-11-07"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "978-9971-0-774-9"}, "item_title": "Flow Path Computing in Software Defined Networking", "item_type_id": "21", "owner": "1", "path": ["1597824203644"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004539", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-12-27"}, "publish_date": "2019-12-27", "publish_status": "0", "recid": "4539", "relation": {}, "relation_version_is_last": true, "title": ["Flow Path Computing in Software Defined Networking"], "weko_shared_id": -1}
Flow Path Computing in Software Defined Networking
http://hdl.handle.net/20.500.12678/0000004539
http://hdl.handle.net/20.500.12678/0000004539cec35483-38dc-46d3-8c8b-99e4cf3e78c0
228b7fa9-b54f-4c8c-905b-4766758602c5
Name / File | License | Actions |
---|---|---|
![]() |
|
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Flow Path Computing in Software Defined Networking | |||||
Language | en | |||||
Publication date | 2019-11-07 | |||||
Authors | ||||||
Mon, Ohnmar Min | ||||||
Mon, Myat Thida | ||||||
Description | ||||||
With the rapid growth of current network, the demand of resources is growing significantly. Insufficient bandwidth results unstable throughput in a network. Software-defined network (SDN) has been proposed to provide optimal routing decision in the presence of congestion. Equal Cost Multi-path (ECMP) routing cannot guarantee optimal resource utilization. ECMP causes the long flow collision in network because it does not consider the network parameter such as bandwidth. In this paper, the Flow Path Computing Algorithm (FPCA) is proposed to minimize the network congestion by rerouting the flows in SDN. This algorithm mainly focuses on rerouting the traffic flows over the alternative path when the network congestion is detected. If the flow demand is exceeded 10% of link bandwidth, the algorithm computes the light loaded path based on the port statistics and it shifts from the congested path to light loaded path. Simulation results are presented to show the effectiveness of the FPCA algorithm over ECMP. | ||||||
Keywords | ||||||
Software Defined Network, Equal Cost Multi-path, OpenFlow | ||||||
Identifier | 978-9971-0-774-9 | |||||
Journal articles | ||||||
Proceedings of 2019 International Conference on Advanced Information technologies (ICAIT 2019) | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |