{"title":"有时钟同步时TSN调度的时延限制","authors":"Aviroop Ghosh;Saleh Yousefi;Thomas Kunz","doi":"10.1109/LNET.2024.3507792","DOIUrl":null,"url":null,"abstract":"The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"7 1","pages":"41-45"},"PeriodicalIF":0.0000,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10770262","citationCount":"0","resultStr":"{\"title\":\"Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization\",\"authors\":\"Aviroop Ghosh;Saleh Yousefi;Thomas Kunz\",\"doi\":\"10.1109/LNET.2024.3507792\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"7 1\",\"pages\":\"41-45\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-11-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10770262\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10770262/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10770262/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization
The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity.