Leaky bucket algorithm

Oct 21, 2012Download as docx, pdf13 likes48,622 views

The document summarizes two algorithms for regulating network traffic: 1. The Leaky Bucket Algorithm models traffic as water entering a bucket with a hole, limiting output to a constant rate regardless of input rate. Packets are discarded if the bucket is full. 2. The Token Bucket Algorithm generates tokens periodically that must be removed from the bucket before packets can be transmitted, allowing bursts up to the token capacity. This is less restrictive than the Leaky Bucket Algorithm.

DATA COMMUNICATION AND
COMPUTER NETWORKS

ASSIGNMENT-III

SUBMITTED BY:

UMESH GUPTA
B.TECH (CSE/IT)

CONTENTS

Leaky Bucket Algorithm
Token Bucket Algorithm

Leaky Bucket Algorithm
Consider a Bucket with a small hole at the bottom, whatever may be the rate of
water pouring into the bucket, the rate at which water comes out from that small
hole is constant. This scenario is depicted in figure 1(a). Once the bucket is full,
any additional water entering it spills over the sides and is lost (i.e. it doesn’t
appear in the output stream through the hole underneath).

The same idea of leaky bucket can be applied to packets, as shown in Fig. 1(b).
Conceptually each network interface contains a leaky bucket. And the following
steps are performed:

When the host has to send a packet, the packet is thrown into the bucket.
The bucket leaks at a constant rate, meaning the network interface
transmits packets at a constant rate.
Bursty traffic is converted to a uniform traffic by the leaky bucket.
In practice the bucket is a finite queue that outputs at a finite rate.

This arrangement can be simulated in the operating system or can be built into
the hardware. Implementation of this algorithm is easy and consists of a finite
queue. Whenever a packet arrives, if there is room in the queue it is queued up
and if there is no room then the packet is discarded

.
(a) (b)
Figure 1.(a) Leaky bucket (b) Leaky bucket implementation

Token Bucket Algorithm
The leaky bucket algorithm described above, enforces a rigid pattern at the
output stream, irrespective of the pattern of the input. For many applications it
is better to allow the output to speed up somewhat when a larger burst arrives
than to loose the data. Token Bucket algorithm provides such a solution. In this
algorithm leaky bucket holds token, generated at regular intervals. Main steps of
this algorithm can be described as follows:
In regular intervals tokens are thrown into the bucket.
The bucket has a maximum capacity.
If there is a ready packet, a token is removed from the bucket, and
thepacket is send.
If there is no token in the bucket, the packet cannot be send.

Figure 2.1 shows the two scenarios before and after the tokens present in the
bucket have been consumed. In Fig. 2.1(a) the bucket holds two tokens, and
three packets are waiting to be sent out of the interface, in Fig. 2.1(b) two
packets have been sent out by consuming two tokens, and 1 packet is still left.
The token bucket algorithm is less restrictive than the leaky bucket algorithm, in
a sense that it allows bursty traffic. However, the limit of burst is restricted by
the number of tokens available in the bucket at a particular instant of time.
The implementation of basic token bucket algorithm is simple; a variable is
used just to count the tokens. This counter is incremented every t seconds and is
decremented whenever a packet is sent. Whenever this counter reaches zero, no
further packet is sent out as shown in Fig. 1.2

Figure 2.1(a) Token bucket holding two tokens, before packets are send out, (b) Token
bucket after two packets are send, one packet still remains as no token is left

Figure 2.2 Implementation of the Token bucket algorithm

Quality of service aims to provide different levels of priority to different applications, users, or data flows. It is achieved through techniques like scheduling, traffic shaping, resource reservation, and admission control. Scheduling methods include FIFO queuing, priority queuing, and weighted fair queuing. Traffic shaping uses leaky bucket and token bucket algorithms. Resource reservation reserves buffer space, bandwidth, and other resources beforehand. Admission control restricts packet admission based on specifications. Models for QoS include the Integrated Services Model, which requires resource reservation in advance using RSVP, and the Differentiated Services Model, which differentiates traffic into classes.

Data link layer Mukesh Chinta

The medium access sublayerLal Bahadur Gehlot

The document discusses the Medium Access Control (MAC) sublayer of the data link layer and various protocols for determining which device can access a shared communication channel. It focuses on static and dynamic channel allocation problems in local area networks (LANs) and wireless networks. Static allocation wastes bandwidth by assigning each user a fixed portion of the channel even when they are not transmitting. Dynamic protocols like ALOHA and carrier sense multiple access (CSMA) aim to improve channel utilization by allowing users to transmit only when the channel is idle.

Flow & Error Controltameemyousaf

The document discusses various topics related to flow and error control in computer networks, including stop-and-wait ARQ, sliding window protocols, and selective reject ARQ. Stop-and-wait ARQ allows transmission of one frame at a time, while sliding window protocols allow multiple outstanding frames using sequence numbers and acknowledgments. Go-back-N ARQ requires retransmission of frames from the lost frame onward, while selective reject ARQ only retransmits the lost frame to minimize retransmissions.

Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESSDr. SELVAGANESAN S

The document discusses data link layer framing and protocols. It describes: 1) Two main approaches to framing - byte-oriented (using sentinel characters) and bit-oriented (using bit stuffing). Protocols discussed include BISYNC, DDCMP, and HDLC. 2) Features of PPP framing including negotiated field sizes and use of LCP control messages. 3) Functions of data link layer including framing, flow control, error control, and media access control. The relationship between the logical link control and media access control sublayers is also covered.

data-link layer protocols BE Smârt

This document provides an overview of data link control (DLC) and data link layer protocols. It discusses the key functions of DLC including framing, flow control, and error control. Framing involves encapsulating data frames with header information like source and destination addresses. Flow control manages the flow of data between nodes while error control handles detecting and correcting errors. Common data link layer protocols described include simple protocol, stop-and-wait protocol, and High-Level Data Link Control (HDLC). HDLC is a bit-oriented protocol that supports full-duplex communication over both point-to-point and multipoint links. It uses three types of frames: unnumbered, information, and supervisory frames.

Framing in data link layerAhtesham Ullah khan

Token ringselvakumar_b1985

Framming data link layerPREMAL GAJJAR

Network layer logical addressingSri Manakula Vinayagar Engineering College

Network Layer addresses data at the logical and physical levels. Logical addresses are generated by CPUs and allow virtual addressing, while physical addresses map to specific memory locations. The network layer provides routing across multiple physical links from one device to another. IP addresses uniquely identify devices on the Internet, though they can change over time as connections change. IPv6 was developed to address the impending exhaustion of IPv4 addresses by expanding the address space to 128 bits.

Ethernet Computer networkmiteshppt

Ethernet is a family of networking technologies commonly used in LANs, MANs and WANs. It was first standardized in 1983 at 10 Mbps and has since been updated to support higher speeds up to 10 Gbps. Fast Ethernet runs at 100 Mbps using the same frame format as standard Ethernet. Gigabit Ethernet runs at 1 Gbps while maintaining compatibility. Ten-Gigabit Ethernet operates at 10 Gbps while keeping the same frame format as prior standards.

Wlan architectureVishal Verma

This document provides an overview of wireless local area networks (WLANs), including their architecture and components. It defines key terms like basic service set (BSS), extended service set (ESS), stations, and access points. It describes the two types of BSS architectures - ad-hoc and infrastructure networks. Infrastructure networks use access points to connect stations and form a star topology, while ad-hoc networks connect stations directly without an access point in a peer-to-peer topology. An ESS connects multiple BSSs through a distribution system to increase network coverage.

Network layer tanenbaumMahesh Kumar Chelimilla

This document provides an overview of key concepts in network layer design, including: - Store-and-forward packet switching and the services provided to the transport layer. - Implementation of connectionless and connection-oriented services, and comparison of virtual circuits and datagrams. - Routing algorithms like shortest path, flooding, distance vector, link state, and hierarchical routing. - Quality of service techniques including integrated services, differentiated services, and MPLS. - Internetworking issues such as connecting different networks, concatenated virtual circuits, tunneling, and fragmentation. - An overview of the network layer in the Internet including IP, addressing, routing protocols like OSPF and BGP, and

Application layer protocolsJUW Jinnah University for Women

The application layer allows users to interface with networks through application layer protocols like HTTP, SMTP, POP3, FTP, Telnet, and DHCP. It provides the interface between applications on different ends of a network. Common application layer protocols include DNS for mapping domain names to IP addresses, HTTP for transferring web page data, and SMTP/POP3 for sending and receiving email messages. The client/server and peer-to-peer models describe how requests are made and fulfilled over the application layer.

IPV4 Frame FormatAditya Rawat

The document discusses IPv4 and its datagram format. It explains that IPv4 is a best-effort, connectionless protocol that provides no error control or flow control. The datagram format includes a header containing fields like version, header length, total length, protocol, source/destination addresses, and an optional data field. It describes fields related to fragmentation, checksum calculation, and optional header fields like timestamps and routing options.

Message and Stream Oriented CommunicationDilum Bandara

Fields of digital image processing slidesSrinath Dhayalamoorthy

This document discusses different types of electromagnetic radiation and their uses in digital image processing. It covers gamma rays, X-rays, ultraviolet rays, visible and infrared rays, microwaves, and radio bands. Applications described include medical imaging techniques like MRI, industrial inspection, astronomy, remote sensing, and law enforcement applications like license plate and fingerprint recognition. Radar imaging is also discussed as a key application using microwaves.

Congestion controlAman Jaiswal

The document discusses congestion control in computer networks. It defines congestion as occurring when the load on a network is greater than the network's capacity. Congestion control aims to control congestion and keep the load below capacity. The document outlines two categories of congestion control: open-loop control, which aims to prevent congestion; and closed-loop control, which detects congestion and takes corrective action using feedback from the network. Specific open-loop techniques discussed include admission control, traffic shaping using leaky bucket and token bucket algorithms, and traffic scheduling.

Network Layer,Computer Networksguesta81d4b

The document discusses the network layer in computer networking. It describes how the network layer is responsible for routing packets from their source to destination. It covers different routing algorithms like distance vector routing and link state routing. It also compares connectionless and connection-oriented services, as well as datagram and virtual circuit subnets. Key aspects of routing algorithms like optimality, stability, and fairness are defined.

Routing algorithmBushra M

The network layer is responsible for routing packets from the source to destination. The routing algorithm is the piece of software that decides where a packet goes next (e.g., which output line, or which node on a broadcast channel).For connectionless networks, the routing decision is made for each datagram. For connection-oriented networks, the decision is made once, at circuit setup time. Routing Issues The routing algorithm must deal with the following issues: Correctness and simplicity: networks are never taken down; individual parts (e.g., links, routers) may fail, but the whole network should not. Stability: if a link or router fails, how much time elapses before the remaining routers recognize the topology change? (Some never do..) Fairness and optimality: an inherently intractable problem. Definition of optimality usually doesn't consider fairness. Do we want to maximize channel usage? Minimize average delay? When we look at routing in detail, we'll consider both adaptive--those that take current traffic and topology into consideration--and nonadaptive algorithms.

Sliding window protocolShehara Abeythunga

This document describes the sliding window protocol. It discusses key concepts like both the sender and receiver maintaining buffers to hold packets, acknowledgements being sent for every received packet, and the sender being able to send a window of packets before receiving an acknowledgement. It then explains the sender side process of numbering packets and maintaining a sending window. The receiver side maintains a window size of 1 and acknowledges by sending the next expected sequence number. A one bit sliding window protocol acts like stop and wait. Merits include multiple packets being sent without waiting for acknowledgements while demerits include potential bandwidth waste in some situations.

Ethernetsijil chacko

Ethernet is a widely used networking protocol for local area networks (LANs). It uses cables to connect multiple computers together to allow them to send data to each other. Common cable types are thick coaxial cable, thin coaxial cable, and twisted pair cables. Ethernet uses encoding schemes like Manchester encoding and differential Manchester encoding to transmit data over the cables. Ethernet has evolved over time to support higher speeds through standards like Fast Ethernet that supports 100 Mbps and Gigabit Ethernet that supports 1 Gbps, while maintaining compatibility with previous versions.

Flow control and error controlBHUVIJAYAVELU

The document contains descriptions and figures about stop-and-wait, sliding window, and selective reject transmission protocols. Stop-and-wait uses acknowledgments to ensure frames are received correctly one at a time, while sliding window protocols allow multiple unacknowledged frames to be sent by keeping a window of outstanding frames. The figures demonstrate examples of how these protocols handle damaged frames, lost frames, and lost acknowledgments to ensure reliable data transmission.

Address resolution protocol (ARP)NetProtocol Xpert

Computer networks - ChannelizationElambaruthi Elambaruthi

Wireless transmissionSaba Rathinam

The document discusses different methods of wireless transmission across the electromagnetic spectrum. It covers radio transmission, which can travel long distances but power falls off with distance; microwave transmission, which travels in straight lines and is used for long-distance communication; and infrared transmission, which is used for short-range communication like TV remotes but does not pass through objects well. It also mentions lightwave transmission using lasers offers high bandwidth but requires precise aiming over distance.

Transport layer Mukesh Chinta

Data RedundacyPoonam Seth

The document discusses various techniques for image compression. It describes how image compression aims to reduce redundant data in images to decrease file size for storage and transmission. It discusses different types of redundancy like coding, inter-pixel, and psychovisual redundancy that compression algorithms target. Common compression techniques described include transform coding, predictive coding, Huffman coding, and Lempel-Ziv-Welch (LZW) coding. Key aspects like compression ratio, mean bit rate, objective and subjective quality metrics are also covered.

LeakybucketalgorithmHitesh Mohapatra

This document discusses two algorithms for regulating network traffic: 1) The Leaky Bucket Algorithm models traffic as water entering a bucket with a hole, limiting output to a constant rate regardless of input rate. Packets are discarded if the bucket is full. 2) The Token Bucket Algorithm generates tokens periodically and removes a token for each packet sent. This allows bursts proportional to the number of tokens, rather than rigidly limiting output. It is implemented with a counter that is incremented with new tokens and decremented when packets are sent.

Leaky bucket ASyed Shaheer Gilani

The document discusses the leaky bucket algorithm for traffic shaping. It begins with an introduction to congestion and traffic shaping. It then provides an overview of the leaky bucket algorithm, describing it as a method that converts bursty traffic into fixed-rate traffic by allowing packets to accumulate in a virtual "leaky bucket" at a set rate before entering the network. The document includes an example demonstrating how the algorithm works with different sized packets in a queue. It discusses parameters like burst rate and average rate and describes uses of the algorithm in networks including shaping bursty traffic to a sustained cell flow rate.

More Related Content

What's hot (20)

Framming data link layerPREMAL GAJJAR

Network layer logical addressingSri Manakula Vinayagar Engineering College

Ethernet Computer networkmiteshppt

Wlan architectureVishal Verma

Network layer tanenbaumMahesh Kumar Chelimilla

Application layer protocolsJUW Jinnah University for Women

IPV4 Frame FormatAditya Rawat

Message and Stream Oriented CommunicationDilum Bandara

Fields of digital image processing slidesSrinath Dhayalamoorthy

Congestion controlAman Jaiswal

Network Layer,Computer Networksguesta81d4b

Routing algorithmBushra M

Sliding window protocolShehara Abeythunga

Ethernetsijil chacko

Flow control and error controlBHUVIJAYAVELU

Address resolution protocol (ARP)NetProtocol Xpert

Computer networks - ChannelizationElambaruthi Elambaruthi

Wireless transmissionSaba Rathinam

Transport layer Mukesh Chinta

Data RedundacyPoonam Seth

Framming data link layerPREMAL GAJJAR

Network layer logical addressingSri Manakula Vinayagar Engineering College

Ethernet Computer networkmiteshppt

Wlan architectureVishal Verma

Network layer tanenbaumMahesh Kumar Chelimilla

Application layer protocolsJUW Jinnah University for Women

IPV4 Frame FormatAditya Rawat

Message and Stream Oriented CommunicationDilum Bandara

Fields of digital image processing slidesSrinath Dhayalamoorthy

Congestion controlAman Jaiswal

Network Layer,Computer Networksguesta81d4b

Routing algorithmBushra M

Sliding window protocolShehara Abeythunga

Ethernetsijil chacko

Flow control and error controlBHUVIJAYAVELU

Address resolution protocol (ARP)NetProtocol Xpert

Computer networks - ChannelizationElambaruthi Elambaruthi

Wireless transmissionSaba Rathinam

Transport layer Mukesh Chinta

Data RedundacyPoonam Seth

Similar to Leaky bucket algorithm (20)

LeakybucketalgorithmHitesh Mohapatra

Leaky bucket ASyed Shaheer Gilani

Conjestion controlBarani Tharan

Tcp Congestion AvoidanceRam Dutt Shukla

The document discusses several algorithms used for congestion control in TCP/IP networks, including slow start, congestion avoidance, fast retransmit, fast recovery, random early discard (RED), and traffic shaping using leaky bucket and token bucket algorithms. Slow start and congestion avoidance control the transmission rate by adjusting the congestion window size. Fast retransmit and fast recovery allow quicker retransmission of lost packets without waiting for timeouts. RED proactively discards packets before buffer overflow. Leaky bucket and token bucket algorithms shape traffic flow through use of buffers and tokens to smooth bursts and control transmission rates.

A018120105IOSR Journals

The document evaluates a tightly coupled router architecture for network-on-chip (NoC) using different routing mechanisms. It proposes a hybrid router design that uses virtual cut-through (VCT), wormhole (WH), and XY routing algorithms together with dynamic priority round robin scheduling. The experimental results show that this approach can reduce latency by 75% and energy consumption by 31.5% under heavy traffic loads compared to traditional designs. It also improves latency by 20% and energy savings of 25% across different buffer depths.

Unit 2 data link controlVishal kakade

This document summarizes key topics related to data link control and protocols. It discusses framing methods like fixed-size and variable-size framing. It also covers flow control, error control, and protocols for both noiseless and noisy channels. Specific protocols described include the Simplest Protocol, Stop-and-Wait Protocol, Stop-and-Wait ARQ, Go-Back-N ARQ, and Selective Repeat ARQ. The document provides details on their design, algorithms, and flow diagrams to illustrate how each protocol handles framing, flow control, and error control.

congestion ujjwal matoliya.pptxujjwalmatoliya

Congestion control 1Aman Jaiswal

The document discusses congestion control in computer networks. It defines congestion as occurring when the load on a network is greater than the network's capacity. Congestion control aims to control congestion and keep the load below capacity. The document separates congestion control mechanisms into two categories: open-loop control, which aims to prevent congestion; and closed-loop control, which detects congestion and takes corrective actions through feedback. Specific open-loop techniques discussed are admission control, traffic shaping using leaky bucket and token bucket algorithms, and traffic scheduling.

Congestion control algorithms.pptxujjwalmatoliya

Leaky Bucket & Tocken Bucket - Traffic shapingVimal Dewangan

Congestion controlKrishna Ranjan

This document discusses congestion control in computer networks. It begins by defining congestion as occurring when the number of packets entering a network exceeds its carrying capacity. Several open-loop and closed-loop techniques for congestion control are then described, including leaky bucket algorithms, token bucket algorithms, choke packets, and slow start. The effects of congestion like reduced throughput and increased delay are also covered. The document provides an in-depth look at strategies for detecting and mitigating congestion in computer networks.

congestion control.pdfJayaprasanna4

This document discusses congestion control techniques. It begins by explaining what network congestion is and its causes, including bursty traffic patterns that exceed network capacity. Open-loop techniques like leaky bucket and token bucket algorithms aim to prevent congestion by shaping traffic. Closed-loop techniques detect congestion and provide feedback to reduce it, such as choke packets which notify sources to decrease their transmission rates. The document covers various congestion control categories and algorithms in detail.

Congestion control Assignment HelpJosephErin

We at Global web tutors provide expert help for Congestion control assignment or Congestion control homework. Our Congestion control online tutors are expert in providing homework help to students at all levels. Please post your assignment at [email protected] to get the instant Congestion controlhomework help. Congestion controlonline tutors are available 24/7 to provide assignment help as well as Congestion control homework help.

Network layerBathshebaparimala

The document discusses the network layer of the OSI model. It describes the functions of the network layer, including routing, addressing devices and networks, populating routing tables, queuing and forwarding data, internetworking between subnets, and delivering packets with best efforts. It also discusses routing algorithms like static routing, default routing, and dynamic routing. Dynamic routing protocols like RIP, OSPF, and BGP are mentioned. Congestion control algorithms like leaky bucket and token bucket are also summarized. The transport layer is briefly introduced as providing process-to-process delivery between computers connected in a network.

congestion_control: types, uses and applicationkhushboos0911

tcp-wireless-tutorial.pptRadwan Mahmoud

The document discusses TCP performance over wireless networks. It outlines that random transmission errors in wireless networks can cause TCP to trigger its fast retransmit mechanism. This occurs when errors cause duplicate acknowledgements to be generated, which TCP interprets as an indication of packet loss even if the errors are random in nature. The document provides examples of how random errors can generate enough duplicate ACKs to trigger fast retransmit unintentionally.

Congestion controlNithin Raj

When network congestion occurs, routers become overloaded and either cannot forward packets fast enough or must discard queued packets to make room for new arrivals. Congestion is caused by packet arrival rates exceeding link capacity, insufficient memory, bursty traffic, or slow processors. Congestion control aims to efficiently use the network at high load and involves all routers and hosts, while flow control operates point-to-point between sender and receiver. Congestion control techniques include warning bits, choke packets, load shedding, random early discard, and traffic shaping to detect, recover from, and avoid congestion.

connecting devices part-2: Router and its useskhushboos0911

VTU 6TH SEM CSE COMPUTER NETWORKS 2 SOLVED PAPERS OF JUNE-2013 JUNE-14 & JUNE...vtunotesbysree

This document contains solved questions from a Computer Networks II exam paper from June 2013 administered by VTU. It includes answers to questions on connection-oriented vs connectionless services, datagram packet switching delays, the Bellman-Ford routing algorithm, FIFO and priority queue scheduling, leaky bucket traffic policing, traffic management at the flow aggregate level, the IPv4 header format, the UDP datagram format, the ICMP protocol, the TCP segment format, the Border Gateway Protocol (BGP), and Network Address Translation (NAT). The document provides detailed explanations and diagrams for each question answer.

Q010228189IOSR Journals

This document describes the implementation of a QCA binary adder on an FPGA. It begins with background on half adders, full adders, ripple carry adders, and carry look ahead adders. It then discusses existing QCA adder designs and proposes a new design using majority gates, sum, and carry chains with reduced complexity. The document outlines metal, molecular, and magnetic approaches to physically implementing QCA. It compares the proposed design to previous work in terms of cell counts, delay, and power and density. Finally, it provides context on VLSI, Verilog, and the Spartan3E FPGA kit used.

LeakybucketalgorithmHitesh Mohapatra

Leaky bucket ASyed Shaheer Gilani

Conjestion controlBarani Tharan

Tcp Congestion AvoidanceRam Dutt Shukla

A018120105IOSR Journals

Unit 2 data link controlVishal kakade

congestion ujjwal matoliya.pptxujjwalmatoliya

Congestion control 1Aman Jaiswal

Congestion control algorithms.pptxujjwalmatoliya

Leaky Bucket & Tocken Bucket - Traffic shapingVimal Dewangan

Congestion controlKrishna Ranjan

congestion control.pdfJayaprasanna4

Congestion control Assignment HelpJosephErin

Network layerBathshebaparimala

congestion_control: types, uses and applicationkhushboos0911

tcp-wireless-tutorial.pptRadwan Mahmoud

Congestion controlNithin Raj

connecting devices part-2: Router and its useskhushboos0911

VTU 6TH SEM CSE COMPUTER NETWORKS 2 SOLVED PAPERS OF JUNE-2013 JUNE-14 & JUNE...vtunotesbysree

Q010228189IOSR Journals

More from Umesh Gupta (6)

SOFTWARE modelsUmesh Gupta

AIDSUmesh Gupta

The document discusses AIDS/HIV, including: 1) It summarizes what AIDS is, how it is caused by HIV, and its symptoms like immune deficiency and increased risk of infections and cancers. 2) It provides an overview of HIV testing methods, treatment which involves combination antiretroviral drug therapy, and prevention through condom use and education. 3) It notes the global impact of AIDS, efforts to raise awareness, and challenges faced in India where stigma and lack of access to treatment remain issues.

Risk-managementUmesh Gupta

The document discusses risk management and provides details on risk identification, projection (estimation), and mitigation. It defines risk and outlines two key characteristics - uncertainty and loss. Risks are categorized by project, technical, and business types. Steps for risk management include identifying possible risks, analyzing each risk's probability and impact, ranking risks, and developing contingency plans for high probability/impact risks.

Transmission mediaUmesh Gupta

This document discusses different types of transmission media used for data communication. It describes guided media like twisted pair wires, coaxial cables, and optical fibers. It also covers wireless or unguided media such as terrestrial microwave, satellite microwave, broadcast radio, and infrared. For each medium, it provides details on characteristics, advantages, disadvantages, and applications. The key factors that affect the quality of a transmission medium are its bandwidth, interference levels, and transmission impairments. Optical fiber has the highest bandwidth capacity but was initially more expensive over short distances.

Calculating the hamming codeUmesh Gupta

The Hamming Code allows for the detection and correction of single bit errors by adding parity bits to the data word. The parity bits are placed in bit positions that are powers of two. Each parity bit checks some subset of the data/parity bits based on its position, and is set to 1 if the number of ones in the checked bits is odd, or 0 if it is even. To locate the position of an error, the parity bits are checked and the positions of any incorrect ones are summed to find the data/parity bit position with the error.

HdlcUmesh Gupta

SOFTWARE modelsUmesh Gupta

AIDSUmesh Gupta

Risk-managementUmesh Gupta

Transmission mediaUmesh Gupta

Calculating the hamming codeUmesh Gupta

HdlcUmesh Gupta

Leaky bucket algorithm

1. DATA COMMUNICATION AND COMPUTER NETWORKS ASSIGNMENT-III SUBMITTED BY: UMESH GUPTA B.TECH (CSE/IT)

2. CONTENTS Leaky Bucket Algorithm Token Bucket Algorithm

3. Leaky Bucket Algorithm Consider a Bucket with a small hole at the bottom, whatever may be the rate of water pouring into the bucket, the rate at which water comes out from that small hole is constant. This scenario is depicted in figure 1(a). Once the bucket is full, any additional water entering it spills over the sides and is lost (i.e. it doesn’t appear in the output stream through the hole underneath). The same idea of leaky bucket can be applied to packets, as shown in Fig. 1(b). Conceptually each network interface contains a leaky bucket. And the following steps are performed: When the host has to send a packet, the packet is thrown into the bucket. The bucket leaks at a constant rate, meaning the network interface transmits packets at a constant rate. Bursty traffic is converted to a uniform traffic by the leaky bucket. In practice the bucket is a finite queue that outputs at a finite rate. This arrangement can be simulated in the operating system or can be built into the hardware. Implementation of this algorithm is easy and consists of a finite queue. Whenever a packet arrives, if there is room in the queue it is queued up and if there is no room then the packet is discarded . (a) (b) Figure 1.(a) Leaky bucket (b) Leaky bucket implementation

4. Token Bucket Algorithm The leaky bucket algorithm described above, enforces a rigid pattern at the output stream, irrespective of the pattern of the input. For many applications it is better to allow the output to speed up somewhat when a larger burst arrives than to loose the data. Token Bucket algorithm provides such a solution. In this algorithm leaky bucket holds token, generated at regular intervals. Main steps of this algorithm can be described as follows: In regular intervals tokens are thrown into the bucket. The bucket has a maximum capacity. If there is a ready packet, a token is removed from the bucket, and thepacket is send. If there is no token in the bucket, the packet cannot be send. Figure 2.1 shows the two scenarios before and after the tokens present in the bucket have been consumed. In Fig. 2.1(a) the bucket holds two tokens, and three packets are waiting to be sent out of the interface, in Fig. 2.1(b) two packets have been sent out by consuming two tokens, and 1 packet is still left. The token bucket algorithm is less restrictive than the leaky bucket algorithm, in a sense that it allows bursty traffic. However, the limit of burst is restricted by the number of tokens available in the bucket at a particular instant of time. The implementation of basic token bucket algorithm is simple; a variable is used just to count the tokens. This counter is incremented every t seconds and is decremented whenever a packet is sent. Whenever this counter reaches zero, no further packet is sent out as shown in Fig. 1.2

5. Figure 2.1(a) Token bucket holding two tokens, before packets are send out, (b) Token bucket after two packets are send, one packet still remains as no token is left Figure 2.2 Implementation of the Token bucket algorithm

Leaky bucket algorithm

Recommended

More Related Content

What's hot (20)

Similar to Leaky bucket algorithm (20)

More from Umesh Gupta (6)

Leaky bucket algorithm