Forager bees intelligence Inspired bandwidth driven dynamic Queue scheduling for classified Flows in internet traffic

Abstract

Internet has become fundamental part of our life The successful newlineevolution of internet applications such as Simple Mail Transfer Protocol newline SMTP HTTPS Hypertext Transfer Protocol Secure Telnet VoIP and Peer newlineto Peer P2P have brought new challenges to the research community newlineInternet traffic can be classified as short flows and long flows They are also newlinereferred as mice and elephants In internet a flow is defined as a group of newlinepackets with a common set of attributes such as source address destination newlineaddress source port destination port The short flows are mainly generated by newlineWeb SMTP Telnet and HTTPS and the long flows are generated in the newlineinternet that originates from P2P file sharing application newlineRecent internet traffic measurement studies show that most of the newlineflows are short while more than 50 of the total bytes are carried by less newlinethan 5 of the long flows The average size of short flow is only 10 20 newlinepackets As a result it is necessary to classify the flows to achieve throughput newlineguarantee The service that the current internet provides is referred as a best newlineeffort service Best effort service is the simplest type of service that a network newlinecan offer It treats all packets equally and does not provide any form of newlineguarantee to traffic flows When a link is congested packets are simply newlinedropped Transmission Control Protocol TCP assures the retransmission for newlinethe dropped packets newline