29 relations: Best-effort delivery, Central processing unit, Channel access method, Computing, Cyclic executive, Deficit round robin, Fair queuing, Guowang Miao, John Wiley & Sons, Link adaptation, Max-min fairness, Maximum throughput scheduling, Multilevel queue, Network scheduler, Operating system, Packet switching, Polling (computer science), Proportionally fair, Queueing theory, Round-robin, Scheduling (computing), Spectral efficiency, Starvation (computer science), Statistical time-division multiplexing, Time-sharing, Token passing, Token ring, Weighted fair queueing, Weighted round robin.
Best-effort delivery describes a network service in which the network does not provide any guarantee that data is delivered or that delivery meets any quality of service.
A central processing unit (CPU) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.
In telecommunications and computer networks, a channel access method or multiple access method allows several terminals connected to the same multi-point transmission medium to transmit over it and to share its capacity.
Computing is any goal-oriented activity requiring, benefiting from, or creating computers.
A cyclic executive is an alternative to a real-time operating system.
Deficit Round Robin (DRR), also Deficit Weighted Round Robin (DWRR), is a scheduling algorithm for the network scheduler.
Fair queuing is a family of scheduling algorithms used in some process and network schedulers.
Guowang Miao is an associate professor at KTH Royal Institute of Technology, Sweden, working on design and optimization of wireless communications and networking and the author of Fundamentals of Mobile Data Networks and Energy and Spectrum Efficient Wireless Network Design.
John Wiley & Sons, Inc., also referred to as Wiley, is a global publishing company that specializes in academic publishing.
Link adaptation, or adaptive coding and modulation (ACM), is a term used in wireless communications to denote the matching of the modulation, coding and other signal and protocol parameters to the conditions on the radio link (e.g. the pathloss, the interference due to signals coming from other transmitters, the sensitivity of the receiver, the available transmitter power margin, etc.). For example, WiMAX uses a rate adaptation algorithm that adapts the modulation and coding scheme (MCS) according to the quality of the radio channel, and thus the bit rate and robustness of data transmission.
In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if the allocation is feasible and an attempt to increase the allocation of any participant necessarily results in the decrease in the allocation of some other participant with an equal or smaller allocation.
Maximum throughput scheduling is a procedure for scheduling data packets in a packet-switched best-effort communications network, typically a wireless network, in view to maximize the total throughput of the network, or the system spectral efficiency in a wireless network.
Multi-level queueing, used at least since the late 1950s/early 1960s, is a queue with a predefined number of levels.
A network scheduler, also called packet scheduler, queueing discipline, qdisc or queueing algorithm, is an arbiter on a node in packet switching communication network.
An operating system (OS) is system software that manages computer hardware and software resources and provides common services for computer programs.
Packet switching is a method of grouping data which is transmitted over a digital network into packets which are made of a header and a payload.
Polling, or polled operation, in computer science, refers to actively sampling the status of an external device by a client program as a synchronous activity.
Proportional fair is a compromise-based scheduling algorithm.
Queueing theory is the mathematical study of waiting lines, or queues.
Round-robin may refer to.
In computing, scheduling is the method by which work specified by some means is assigned to resources that complete the work.
Spectral efficiency, spectrum efficiency or bandwidth efficiency refers to the information rate that can be transmitted over a given bandwidth in a specific communication system.
In computer science, starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work.
Statistical multiplexing is a type of communication link sharing, very similar to dynamic bandwidth allocation (DBA).
In computing, time-sharing is the sharing of a computing resource among many users by means of multiprogramming and multi-tasking at the same time.
On a local area network, token passing is a channel access method where a signal called a token is passed between nodes to authorize that node to communicate.
MAU b) Using several MAUs connected to each other Token ring network IBM hermaphroditic connector with locking clip Token Ring local area network (LAN) technology is a communications protocol for local area networks.
Weighted fair queueing (WFQ) is a network scheduler scheduling algorithm.
Weighted round robin (WRR) is a network scheduling discipline.