Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication8
  4. Rate based feedback: Some experimental evaluation with NetFPGA
 
  • Details
Options

Rate based feedback: Some experimental evaluation with NetFPGA

Date Issued
02-09-2011
Author(s)
Malangadan, Nizar
Gaurav Raina 
Indian Institute of Technology, Madras
DOI
10.1109/icc.2011.5963379
Abstract
Transport protocols that use explicit rate feedback are a promising alternative to the algorithms which use implicit, packet loss based feedback. A key issue in the design of rate controlled communication networks is how new flows may be admitted at a fair and high starting rate. In this paper, for the management of new flows we present a modified NetFPGA Rate Control Protocol (RCP) implementation for a recently proposed admission management process at the routers. Using this implementation, we perform an evaluation of the admission of new flows in rate controlled networks. We conduct experimental tests across a range of bandwidth-delay product environments, and also deal with the arrival of a large number of flows. Our work serves to exhibit that the proposed admission management process appears to be an attractive method for dealing with the admission of new flows while maintaining small queues. Additionally, the algorithm allows the routers to maintain a specified target link utilisation. A consequence of such small queues is that buffers, in routers, may be dimensioned to be much smaller than the current, bandwidth-delay product, buffer sizing rule. © 2011 IEEE.
Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback