跳到正文
研踪PaperTrail

论文库

检索计算机领域论文，按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描：2026-11-16 01:34 · 全站最近入库：2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 01:36 — 2026-11-16 01:36（北京时间） · 点击数字查看对应简报；AI 相关包含在新增论文内。

最近完成检查：2026-11-16 01:34最近发现新增版本：2026-11-14 15:09库内论文最新更新时间：2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常；新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

研究日报 / 周报 →按信源浏览 →

时间范围跟随排序：版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常，查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33（北京时间）
新论文 · v1arXiv:2611.15622

Quota-Based Traffic Classification for Bounded Jitter in Multi-CQF under Redundancy Mechanisms

Mohamed Elattar, Zhe Lou, Georg Carle

原文摘要

The demand for deterministic and reliable communication is rapidly increasing in industrial networks. Time-Sensitive Networking (TSN) addresses these requirements through deterministic scheduling and redundancy mechanisms such as Multiple Cyclic Queuing and Forwarding (Multi-CQF) and Frame Replication and Elimination for Reliability (FRER). Multi-CQF guarantees bounded end-to-end (E2E) latency and jitter, while FRER provides seamless fault tolerance through redundant forwarding. With static traffic classification, redundant paths with different hop counts can exhibit different E2E latency ranges. This can amplify jitter when a failure causes packets to be delivered over a longer redundant path. To address this, we propose a quota-based traffic classification mechanism that adapts class assignments hop-by-hop using a common E2E latency budget derived from the primary path, thereby mitigating jitter amplification. Simulation results show that the proposed mechanism reduces jitter amplification by up to 70% and latency degradation by up to 41% compared to static classification.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.15577

Orthogonal Code-Based Parallel Signaling for PLCA in Shared-Medium Ethernet

Mohamed Elattar, Ahmed Abdelkader, Zhe Lou, Georg Carle

原文摘要

Physical Layer Collision Avoidance (PLCA) enables collision-free channel access in shared-medium Ethernet by granting each node an exclusive transmission opportunity (TO) in a sequential, cyclic manner. This sequential, node-based access structure, however, is the root cause of PLCA's fundamental limitations, causing access latency to grow with network size and idle TOs to accumulate when traffic is sparse, a limitation inherited by existing PLCA extensions. To address this, we propose OC-PLCA, an orthogonal code-based parallel signaling mechanism for PLCA. Rather than signaling sequentially, all nodes with pending traffic transmit their unique Walsh-Hadamard code simultaneously to signal their intent to transmit. Since these codes are mutually orthogonal, each node independently identifies the complete set of active nodes, allowing the transmission cycle to include only active nodes and eliminating idle TOs entirely. We further investigate the impact of quantization on active node detection, and propose a grouping-based extension that preserves unambiguous detection for networks of an arbitrary number of nodes. Theoretical analysis shows that OC-PLCA reduces signaling overhead by 88% for an 8-node network, with the reduction growing as network size increases. Simulation results confirm significant reductions in observed access latency across a range of network loads and heterogeneous node activity.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.15281

Priority-Based Network Access with Strict-Priority Scheduling in PLCA Multidrop Networks

Mohamed Elattar, Zhe Lou, Georg Carle

原文摘要

Shared-medium Ethernet is gaining renewed attention across industrial domains, driven by the adoption of 10BASE-T1S. In such multidrop networks, collision-free and deterministic medium access is achieved through Physical Layer Collision Avoidance (PLCA). However, PLCA follows a node-based cyclic access structure that does not account for traffic priority, leading to high access latency for time-sensitive traffic and limited scalability with increasing network size. Existing PLCA extensions improve latency for selected devices but remain restricted to node-based access and do not support network-wide traffic differentiation. To address these limitations, this paper introduces a priority-based network access and scheduling mechanism for multidrop networks. The proposed approach decouples medium access from node-based ordering and enables class-based prioritization, allowing high-priority traffic from any device to be transmitted ahead of lower-priority traffic. It further supports a configuration that emulates Strict Priority (SP) scheduling, providing low and bounded access latency for highest-priority traffic. Analytical bounds on the worst-case access latency are derived, validated, and shown to be tight. Performance evaluation demonstrates that the proposed mechanism reduces the maximum observed access latency for high-priority traffic by over 65% compared to PLCA, with latency increasing by less than 1% as the network grows from 8 to 40 devices.

cs.NI

查看论文
arXiv ↗PDF ↗