Determination of delay bound over multi-hop real-time switches with virtual output queuing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Sanghwa | - |
dc.contributor.author | Kang, Kyungtae | - |
dc.contributor.author | Ryu, Junhee | - |
dc.date.accessioned | 2021-06-23T01:24:26Z | - |
dc.date.available | 2021-06-23T01:24:26Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2014-05 | - |
dc.identifier.issn | 1550-445X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/25469 | - |
dc.description.abstract | Predictable and guaranteed response is an essential characteristic of safety-critical real-time systems. Thus we need to guarantee that the end-to-end latency of data exchange within such a system is always bounded and controlled, so that the overall system behavior is predictable and safe. In this paper, we propose a method for determining the worst-case delay when a packet traverses a network that consists of real-time crossbar switches. These switches guarantee that any feasible traffic can be switched in two clock periods by adopting an optimal clearance-time switching policy together with clock-driven scheduling. We also propose a switching architecture that introduces a delay buffer and virtual output queues to meet the one-shot traffic assumption required for optimal clearance-time switching. By removing the impractical assumptions made in previous works, we are able to derive a more accurate delay bound for real-world scenarios. © 2014 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Determination of delay bound over multi-hop real-time switches with virtual output queuing | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kang, Kyungtae | - |
dc.identifier.doi | 10.1109/AINA.2014.144 | - |
dc.identifier.scopusid | 2-s2.0-84903841962 | - |
dc.identifier.wosid | 000358605300118 | - |
dc.identifier.bibliographicCitation | Proceedings - International Conference on Advanced Information Networking and Applications, AINA, pp.892 - 898 | - |
dc.relation.isPartOf | Proceedings - International Conference on Advanced Information Networking and Applications, AINA | - |
dc.citation.title | Proceedings - International Conference on Advanced Information Networking and Applications, AINA | - |
dc.citation.startPage | 892 | - |
dc.citation.endPage | 898 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 3 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | other | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | Clocks | - |
dc.subject.keywordPlus | Crossbar equipment | - |
dc.subject.keywordPlus | Electronic data interchange | - |
dc.subject.keywordPlus | Queueing theory | - |
dc.subject.keywordPlus | Real time systems | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Switching networks | - |
dc.subject.keywordPlus | Crossbar switch | - |
dc.subject.keywordPlus | Essential characteristic | - |
dc.subject.keywordPlus | Real-world scenario | - |
dc.subject.keywordPlus | Switching architectures | - |
dc.subject.keywordPlus | Traversal time | - |
dc.subject.keywordPlus | Virtual output queue | - |
dc.subject.keywordPlus | Virtual output queuing | - |
dc.subject.keywordPlus | Worst-case analysis | - |
dc.subject.keywordPlus | Time switches | - |
dc.subject.keywordAuthor | packet traversal time | - |
dc.subject.keywordAuthor | real-time crossbar switch | - |
dc.subject.keywordAuthor | virtual output queuing | - |
dc.subject.keywordAuthor | Worst-case analysis | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6838758 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.