现代计算机网络4a1：动态频道分配问题

The modern computer network lecture 4a1 discusses the Channel Allocation Problem and focuses on dynamic channel allocation in the Multi Medium Access Control Sublayer. The problem of sharing broadcasting medium and the concept of multiplexing are introduced in this lecture. It compares and contrasts static and dynamic channel allocation, and provides a detailed discussion on static channel allocation using Frequency Division Multiplexing (FDM) and Time Division Multiplexing (TDM). The lecture also delves into the challenges of constant number of users and heavy and steady load of traffic in static channel allocation, as well as its inefficiency for burst data. It introduces queue theory, mean time delay (T), channel capacity (C) in bits per second, arrival rate (λ) of frames per second, 1/µ bits per frame and service rate (µC) frames per second. The lecture explores the Poisson arrival and service times, and how to calculate T using the formula T=1/(µC- λ). In summary, the lecture 4a1 on modern computer network discusses the channel allocation problem, its solutions and their applications in the context of dynamic channel allocation in the Multi Medium Access Control Sublayer. It provides an in-depth understanding of static and dynamic channel allocation, queue theory, mean time delay (T), channel capacity (C) in bits per second, arrival rate (λ) of frames per second and service rate (µC) frames per second. It highlights the challenges and inefficiencies of constant number of users and heavy and steady load of traffic in static channel allocation, and the need for efficient solutions for burst data. Overall, the lecture offers a comprehensive overview of the channel allocation problem and its implications in modern computer networks.