Scribd
Upload
123 views3 pages

Leaky Bucket

This Java program simulates a leaky bucket algorithm for controlling network traffic. It defines a LeakyBucket class that reads in packet arrival times and bucket parameters, and uses separate thread classes to simulate packet insertion into and leakage from the bucket over time. The main method creates LeakyBucket, InsertThread, and DeleteThread objects to model the concurrent processes of the leaky bucket algorithm.

Uploaded by

Chethan Narayana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
123 views3 pages

Leaky Bucket

This Java program simulates a leaky bucket algorithm for controlling network traffic. It defines a LeakyBucket class that reads in packet arrival times and bucket parameters, and uses separate thread classes to simulate packet insertion into and leakage from the bucket over time. The main method creates LeakyBucket, InsertThread, and DeleteThread objects to model the concurrent processes of the leaky bucket algorithm.

Uploaded by

Chethan Narayana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

import java.util.

*;

public class LeakyBucket


{
int I, B, N;
int dt[];
int t, p, bs;
boolean inCtrl = true;
boolean outCtrl = true;
void read()
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the value of I (size of packet in bytes)");
I = sc.nextInt();
System.out.println("Enter the Bucket Size");
B = sc.nextInt();
System.out.println("Enter number of packets of size I to transfer");
N = sc.nextInt();
dt = new int[N];
System.out.println("Enter the arrival time (in seconds) for all to
packets in acending order");
for(int i = 0; i < N; i++)
dt[i] = sc.nextInt();
p = bs = 0;
t = 0;
sc.close();
}
void insert()
{
if(p < N)
{
if(dt[p] == t)
{
if(bs+I <= B)
{
bs+=I;
System.out.println("Packet recievd at t = " + t + ".
" + bs + " Bytes still left in Bucket");
}
else
System.out.println("Bucket overflow. Packet Lost at t
= " + t);
p++;
}
t++;
}
else
inCtrl = false;
}
void delete()
{
if(bs > 0)
{
bs--;
System.out.println("1 Byte Leaked.\t\t " + bs + " Bytes still
left in Bucket");
}
else
{
System.out.println("Bucket is Empty. Waiting for Incoming
Packets");
}
if(p == N && bs == 0)
outCtrl = false;
}
public static void main(String[] args)
{
LeakyBucket bkt = new LeakyBucket();
bkt.read();
InsertThread insThread = new InsertThread(bkt); //Call insert thread
DeleteThread delThread = new DeleteThread(bkt); //Call delete thread
}
}

class InsertThread implements Runnable


{
LeakyBucket bkt1;
public InsertThread(LeakyBucket bkt)
{
bkt1 = bkt;
Thread insThread = new Thread(this);
insThread.start();
}
public void run()
{
try
{
while(bkt1.inCtrl)
{
bkt1.insert();
Thread.sleep(1000);
}
}
catch(Exception e)
{
e.printStackTrace();
}
}
}

class DeleteThread implements Runnable


{
LeakyBucket bkt1; //bkt1 is an instance of Bucket class

public DeleteThread(LeakyBucket bkt)


{
this.bkt1 = bkt; //create a reference
Thread delThread = new Thread(this);
delThread.start();
}
public void run()
{
try
{
while(bkt1.outCtrl)
{
bkt1.delete();
Thread.sleep(1000);
}
System.out.println("\nAll Packets Have Been Sent");
}
catch(Exception e)
{
e.printStackTrace();
}
}
}

You might also like