Cited 0 time in
Deadline-Aware Redundant Transmission on Multi-Paths for Real-Time Service
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kang, Hyeonwoo | - |
| dc.contributor.author | Hong, Seungwoo | - |
| dc.contributor.author | Kang, Donghyun | - |
| dc.contributor.author | An, Donghyeok | - |
| dc.date.accessioned | 2025-04-15T01:00:12Z | - |
| dc.date.available | 2025-04-15T01:00:12Z | - |
| dc.date.issued | 2025 | - |
| dc.identifier.issn | 2169-3536 | - |
| dc.identifier.issn | 2169-3536 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/58218 | - |
| dc.description.abstract | This study addresses the challenge of meeting deadlines in real-time applications such as video streaming and online gaming, in which data block delivery is time sensitive. Traditional loss-recovery solutions such as retransmission are inadequate, particularly in multi-path networks with long round-trip times, resulting in delays and missed deadlines. The proposed deadline-aware redundant transmission (DART) approach proactively transmits redundant packets across multiple paths, considering the next transmission time and one-way delay on each path to meet deadlines with minimal overhead. It also addresses deadlocks caused by insufficient network capacity by prioritizing the transmission of the smallest data block in the queue. DART, which operates independently of existing schedulers, simplifies implementation and reduces disturbances to existing schedulers. Simulation results demonstrate that DART increases the block transmission success rates by 5% to 10%, depending on the network conditions, while requiring minimal overheads. | - |
| dc.format.extent | 14 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | IEEE | - |
| dc.title | Deadline-Aware Redundant Transmission on Multi-Paths for Real-Time Service | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1109/ACCESS.2025.3553539 | - |
| dc.identifier.scopusid | 2-s2.0-105001647092 | - |
| dc.identifier.wosid | 001455525600010 | - |
| dc.identifier.bibliographicCitation | IEEE Access, v.13, pp 51589 - 51602 | - |
| dc.citation.title | IEEE Access | - |
| dc.citation.volume | 13 | - |
| dc.citation.startPage | 51589 | - |
| dc.citation.endPage | 51602 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalResearchArea | Telecommunications | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
| dc.relation.journalWebOfScienceCategory | Telecommunications | - |
| dc.subject.keywordAuthor | Real-time systems | - |
| dc.subject.keywordAuthor | Delays | - |
| dc.subject.keywordAuthor | Streaming media | - |
| dc.subject.keywordAuthor | Propagation losses | - |
| dc.subject.keywordAuthor | Quality of experience | - |
| dc.subject.keywordAuthor | Dams | - |
| dc.subject.keywordAuthor | System recovery | - |
| dc.subject.keywordAuthor | Protocols | - |
| dc.subject.keywordAuthor | Packet loss | - |
| dc.subject.keywordAuthor | MPTCP | - |
| dc.subject.keywordAuthor | Deadline awareness | - |
| dc.subject.keywordAuthor | redundant transmission | - |
| dc.subject.keywordAuthor | multi-path | - |
| dc.subject.keywordAuthor | real-time | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
30, Pildong-ro 1-gil, Jung-gu, Seoul, 04620, Republic of Korea+82-2-2260-3114
Copyright(c) 2023 DONGGUK UNIVERSITY. ALL RIGHTS RESERVED.
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.
