12.LeakyBucket.java

/*
12. Write a program for congestion control using leaky bucket algorithm.   
*/

import java.util.Scanner;
import java.util.TreeSet;

class LeakyBucket {
    public static void main(String[] args) {
        TreeSet<Integer> arrivalTimes = new TreeSet<Integer>();
        Scanner scanner = new Scanner(System.in);

        System.out.println("Enter Burstiness in Network");
        int L = scanner.nextInt();

        System.out.println("Enter Packet Inter Arrival");
        int I = scanner.nextInt();

        System.out.println("Enter Arrival Times of Packets (Enter non integer value at end)");
        while (scanner.hasNextInt()) {
            arrivalTimes.add(scanner.nextInt());
        }

        int LCT = arrivalTimes.first();
        int X = 0;

        for (Integer t : arrivalTimes) {
            int temp = X - (t - LCT);
            if (temp > L) {
                System.out.println("Packet at time " + t + " is Non Conforming");
            } else {
                X = temp + I;
                LCT = t;
                System.out.println("Packet at time " + t + " is Conforming");
            }
        }
    }
}

////////////
// Output
// Enter Burstiness in Network
// 6
// Enter Packet Inter Arrival
// 4
// Enter Arrival Times of Packets (Enter non integer value at end)
// 1 2 3 5 6 8 11 12 13 15 19 q
// Packet at time 1 is Conforming
// Packet at time 2 is Conforming
// Packet at time 3 is Conforming
// Packet at time 5 is Non Conforming
// Packet at time 6 is Non Conforming
// Packet at time 8 is Conforming
// Packet at time 11 is Conforming
// Packet at time 12 is Non Conforming
// Packet at time 13 is Non Conforming
// Packet at time 15 is Conforming
// Packet at time 19 is Conforming