Leaky bucket alogrithm in C++ (thuva4#268)

saad1504 · thuva4 · commit 313a5bf8442f · 2017-11-04T08:35:11.000+05:30
* Leaky bucket alogrithm in C++

* Readme updated

* Rename Leaky-Bucket/C++/LeakyBucket.cpp to LeakyBucket/C/LeakyBucket.cpp
diff --git a/Leaky-Bucket/C++/a.out b/Leaky-Bucket/C++/a.out
diff --git a/LeakyBucket/C/LeakyBucket.cpp b/LeakyBucket/C/LeakyBucket.cpp
@@ -0,0 +1,37 @@
+#include <cstdlib>
+#include <iostream>
+#include <unistd.h>
+using namespace std;
+//Program to demonstrate leaky bucket algorithm
+int main()
+{
+	int bs,outr,ip,cbs=0,i;
+	//Assign zero to current bucket size
+	cout << "Enter Bucket Size and Output rate " << endl;
+	cin >> bs >> outr;
+	//input Bucket size and output rate
+	cout << " Input Packet Current Bucket Output Discarded" << endl;
+	for(i=0;i<200;i++)
+	{
+		ip=rand()%201;
+		// random functions chooses the number randomly for input packet
+		cbs+=ip;
+		if(cbs>(bs+outr))
+		{
+			cout << ip<<"\t"<<bs<<"\t"<<outr<<"\t"<<cbs-(bs+outr)<<endl;
+			cbs=bs;
+		}
+		else
+		{
+			if(cbs<outr)
+			cout << ip<<"\t"<<cbs<<"\t"<<"0\t"<<"0"<<endl;
+			else
+			{
+				cbs-=outr;
+				cout << ip<<"\t"<<cbs<<"\t"<<outr<<"\t"<<"0"<<endl;
+			}
+			sleep(1);
+		}
+	}
+	return 0;
+}
diff --git a/README.md b/README.md
@@ -41,6 +41,7 @@ Inverse Fast Fourier Transform |  |  |  |  | :+1: |  |  |  |
 Johnson algorithm | :+1: | :+1: |  |  | :+1: |  |  |  |
 Kadane's algorithm | :+1: | :+1: |  | :+1: | :+1: | :+1: | :+1: |  |
 Knuth Morris Prath Algorithm | :+1: | :+1: |  |  | :+1: |  |  |  |
+Leaky-Bucket | |  |  |  | :+1: |  |  |  |
 LinearSearch | :+1: | :+1: | :+1: |  :+1:| :+1: | :+1: | :+1: |  |  | :+1: |
 Longest common subsequence | :+1: | :+1: |  | :+1: | :+1: |  |  |  | :+1:
 Longest increasing subsequence | :+1: | :+1: |  |  | :+1: |  |  |  |
@@ -470,6 +471,8 @@ Extended Euclidean algorithm |  |  |  |  |:+1:|  |  |  |
 
 * Lesk algorithm    :    word sense disambiguation
 
+* Leaky bucket algorithm : an algorithm that demonstrates traffic control in network transmission
+
 * Levenberg&ndash;Marquardt algorithm    :    An algorithm for solving nonlinear least squares problems.
 
 * Levenshtein edit distance    :    compute a metric for the amount of difference between two sequences
