Advanced Computer Networks Week 4 Quiz
Advanced Computer Networks Week 4 Quiz
Integrated services involve prior reservation of resources to guarantee Quality of Service, while differentiated services assign packet priorities and send them without prior reservation, providing flexibility and scalability in network traffic management .
Integrated services typically provide controlled-load service and guaranteed service. These contrast with differentiated services, which focus on marking packets for priority handling rather than pre-reserving network resources .
The max-min fair scheduling algorithm allocates bandwidth starting from the smallest to the largest demands, ensuring each user (e.g., U9 with a demand of 9 Mbps) receives no more than their requested share, with equitable distribution across total available bandwidth until fully saturated .
The minimum buffer size required is 32 Megabytes. This accounts for the burst size managed by the leaky bucket, ensuring data generated at a peak demand of 15 Mbps does not overflow when the sustain rate is 7 Mbps .
The max-min fair share algorithm requires that no source gets a resource share larger than its demand, it allocates resources in order of increasing demand, and ensures that resources are fairly distributed to sources with unsatisfied demands .
An engineer may choose expedited forwarding to prioritize high-importance traffic that requires low latency and jitter; its associated DSCP value is '101110', providing high-quality service for time-sensitive data transmission .
The number of packets transmitted per second can be determined by calculating the total byte capacity allowed by the token rate, which is 200 tokens/second × 50 bytes/token = 10,000 bytes/second. Then, by dividing the total byte capacity by the packet size (2000 bytes/packet), we find that 10,000 / 2000 = 5 packets per second can be transmitted .
The DSCP uses the first three bits for Class Selector and the next three bits for Drop Precedence to signify the priority and handling strategy for packets in a network, ensuring efficient data flow management and prioritization under different network loads .
The token bucket algorithm regulates network traffic by controlling the amount of data a network can send at any time, allowing bursts while capping transmission to average rates. Factors such as token arrival rate, packet size, and token sizes significantly influence packet management and transmission ability .
Circuit-switched networks employ dedicated paths for communication, reserving resources for the session, while packet-switched networks use shared paths, supporting dynamic resource allocation. Circuit-switched channels are predefined, unlike flexible, shared paths in packet-switched networks .