Many current and future multimedia and industrial applications, like video streaming, eXtended Reality or remote robot control, are characterized by periodic data transmissions with strict latency and reliability constraints. In an effort to meet the stringent demand of such traffic sources, the WiGig standards support a contention-free channel access mechanism, named Service Period, that makes it possible to allocate dedicated time intervals to certain wireless stations. However, the standard only covers the fundamental aspects that ensure interoperability, while the actual schedule logic is left to vendors. In this paper, we propose two algorithms for joint admission control and scheduling of periodic traffic streams with contrasting performance objectives, specifically a simple scheduler and a max-min fair scheduler. The schemes are compared in two different scenarios, in order to characterize and highlight some fundamental trade-offs. As expected from their design principles, the simple scheduler tends to trade acceptance rate for resource availability, contrary to the max-min fair scheduler, giving to implementers a clear performance trade-off, although performance cannot be balanced by means of a tunable parameter.
翻译:许多当前和未来的多媒体和工业应用,如视频流、电子现实或远程机器人控制,其特点是定期传输数据,且有严格的延迟性和可靠性限制,为了满足这种交通来源的严格需求,WiGig标准支持一个无争议的频道接入机制,称为服务期,使某些无线站能够分配专用时间间隔,然而,标准仅涵盖确保互操作性的基本方面,而实际时间表逻辑则留给供应商。在本文件中,我们提出了两种算法,用于联合接收控制和定期交通流的时间安排,与业绩目标对比,特别是一个简单的排程器和一个最大限度公平的排程器。这些算法以两种不同的情况进行比较,以便描述和突出一些基本的权衡。根据设计原则的预期,简单的排程程序倾向于将资源供应的接受率用于交易,这与最大限度的公平排程规则相反,给执行者一个明确的性交易,尽管业绩不能通过金枪鱼参数来平衡。