Hybrid Scheduling is a class of scheduling mechanisms that mix different scheduling criteria or disciplines in one
algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specificat ...
. For example, scheduling
uplink
In a telecommunications network, a link is a communication channel that connects two or more devices for the purpose of data transmission. The link may be a dedicated physical link or a virtual circuit that uses one or more physical links or shar ...
and
downlink
In a telecommunications network, a link is a communication channel that connects two or more devices for the purpose of data transmission. The link may be a dedicated physical link or a virtual circuit that uses one or more physical links or shar ...
traffic in a
WLAN
A wireless LAN (WLAN) is a wireless computer network that links two or more devices using wireless communication to form a local area network (LAN) within a limited area such as a home, school, computer laboratory, campus, or office building ...
(Wireless Local Area Network, such as
IEEE 802.11e
IEEE 802.11e-2005 or 802.11e is an approved amendment to the IEEE 802.11 standard that defines a set of quality of service (QoS) enhancements for wireless LAN applications through modifications to the media access control (MAC) layer.M. Benveni ...
) using a single discipline or framework is an instance of hybrid scheduling. Other examples include a scheduling scheme that can provide differentiated and integrated (guaranteed) services in one discipline. Another example could be scheduling of
node
In general, a node is a localized swelling (a "knot") or a point of intersection (a vertex).
Node may refer to:
In mathematics
*Vertex (graph theory), a vertex in a mathematical graph
*Vertex (geometry), a point where two or more curves, lines, ...
communications where centralized communications and distributed communications coexist.
Further examples of such schedulers are found in the following articles:
References
{{Reflist
1- Y. Pourmohammadi Fallah, H. Alnuweir
"Hybrid Polling and Contention Access Scheduling in IEEE 802.11e WLANs" Journal of Parallel and Distributed Computing, Elsevier, Vol 67, Issue 2, Feb. 2007, pp. 242–256.
Computer networking