/*
 * Copyright (c) 2000 Nortel Networks
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *      This product includes software developed by Nortel Networks.
 * 4. The name of the Nortel Networks may not be used
 *    to endorse or promote products derived from this software without
 *    specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY NORTEL AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL NORTEL OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * Developed by: Farhan Shallwani, Jeremy Ethridge
 *               Peter Pieda, and Mandeep Baines
 * Maintainer: Peter Pieda <ppieda@nortelnetworks.com>
 */

#include <stdio.h>
#include "ip.h"
#include "dsred.h"
#include "random.h"
#include "dsredq.h"


// redQueue() Constructor.
//     Initializes virtual queue parameters.
redQueue::redQueue() {
  numPrec = MAX_PREC;
  mredMode = rio_c;
  //underlying physical queue
  q_ = new PacketQueue();	
}

// void config(int prec, int argc, const char*const* argv)
//   Configures a virtual queue according to values supplied by the user.
//   Added option to config q_w by Thilo, 
//     xuanc (12/14/01)
void redQueue::config(int prec, int argc, const char*const* argv) {
  qParam_[prec].qlen = 0;
  qParam_[prec].edp_.th_min = atoi(argv[4]);
  qParam_[prec].edp_.th_max = atoi(argv[5]);
  qParam_[prec].edp_.max_p_inv = 1.0 / atof(argv[6]);

  // modification to set the parameter q_w by Thilo
  // it's an optional parameter to conserve backward compatibility
  if (argc > 7)  
    qParam_[prec].edp_.q_w = atof(argv[7]);
  else 
    qParam_[prec].edp_.q_w = 0.002;
  
  qParam_[prec].edv_.v_ave = 0.0;
  qParam_[prec].idle_ = 1;
  if (&Scheduler::instance() != NULL)
    qParam_[prec].idletime_ = Scheduler::instance().clock();
  else
    qParam_[prec].idletime_ = 0.0;
}

// void initREDStateVar(void)
//    Initializes each virtual queue in one physical queue.
void redQueue::initREDStateVar(void) {
  for (int i = 0; i < numPrec; i++) {
    qParam_[i].idle_ = 1;
    
    if (&Scheduler::instance() != NULL)
      qParam_[i].idletime_ = Scheduler::instance().clock();
    else
      qParam_[i].idletime_ = 0.0;
  }
}

// void updateVREDLen(int prec)
//    Updates a virtual queue's length after dequeueing
void redQueue::updateVREDLen(int prec) {
  // decrement virtual queue length
  qParam_[prec].qlen--;		
}

// void updateIdleFlag(int)
//    Called by enque() to set idle_ to 0 
//      if a packet was enqueued successfully
void redQueue::updateIdleFlag(int prec) {
  if (mredMode == rio_c) { 
    for (int i = prec; i < numPrec; i++) 
      qParam_[i].idle_ = 0;
  } else if (mredMode == rio_d) { 
    qParam_[prec].idle_ = 0; 
  } else {
    qParam_[0].idle_ = 0;
  } 
}

// void updateREDStateVar(int prec)
//    Updates a virtual queue's state variables after dequing.
void redQueue::updateREDStateVar(int prec) {
  int idle = 1;
  int i;
  
  double now = Scheduler::instance().clock();
  
  //qParam_[prec].qlen--;		// decrement virtual queue length
  
  if (qParam_[prec].qlen == 0) {
    if (mredMode == rio_c) {
      for(i=0; i<prec; i++) 
	if(qParam_[i].qlen != 0) idle = 0;
      if (idle) {
	for (i=prec;i<numPrec;i++) {
	  if (qParam_[i].qlen == 0) {
	    qParam_[i].idle_ = 1;
	    qParam_[i].idletime_ = now;
	  } else break;
	}			
      }
    } else if (mredMode == rio_d) {
      qParam_[prec].idle_ = 1;
      qParam_[prec].idletime_ = now;
    } else if (mredMode == wred) { //wred
      qParam_[0].idle_ = 1;
      qParam_[0].idletime_ = now;
    }			
  }
}

// void enque(Packet *pkt, int prec, int ecn)
//    Enques a packet associated with one of the precedence levels of
//      the physical queue.
//    Fix the bug that idle_ flag may be set to 0 when 
//      the incoming packet is actually dropped (xuanc, 12/08/01)
//      Reported and fixed by T. Wagner <wagner@panasonic.de>
int redQueue::enque(Packet *pkt, int prec, int ecn) {
  int m = 0;
  double now, u;
  double pa,pb;
  
  if (q_->length() > (qlim-1))
    return PKT_DROPPED;
  
  now = Scheduler::instance().clock();
  
  //now determining the avg for that queue
  // fix to correct behavior of droptail mode
  // contributed by  Alexander Sayenko <sayenko@cc.jyu.fi>
  if (mredMode == dropTail) {
    if (qParam_[prec].qlen >= qParam_[prec].edp_.th_min) {
      return PKT_DROPPED;
    }
  } else if (mredMode == rio_c) {
    // Can't set idle_ flag to 0 now, because the incoming packet
    //   may be actually dropped.
    for (int i = prec; i < numPrec; i++) {	
      m = 0;
      if (qParam_[i].idle_) {
	//qParam_[i].idle_ = 0;
	m = int(qParam_[i].edp_.ptc * (now - qParam_[i].idletime_));
      }
      calcAvg(i, m+1); 
    }
  } else if (mredMode == rio_d) {
    if (qParam_[prec].idle_) {
      //qParam_[prec].idle_ = 0;
      m = int(qParam_[prec].edp_.ptc * (now - qParam_[prec].idletime_));
    }	
    calcAvg(prec, m+1);
  } else { //wred
    if (qParam_[0].idle_) {
      //qParam_[0].idle_ = 0;
      m = int(qParam_[0].edp_.ptc * (now - qParam_[0].idletime_));
    }	
    calcAvg(0, m+1);
  }
  
  // enqueu packet if we are using ecn
  if (ecn) {
    q_->enque(pkt);	
    
    //virtually, this new packet is queued in one of the multiple queues,
    //thus increasing the length of that virtual queue
    qParam_[prec].qlen++;
  }
  
  //if the avg is greater than the min threshold,
  //there can be only two cases.....
  if (qParam_[prec].edv_.v_ave > qParam_[prec].edp_.th_min) {
    //either the avg is less than the max threshold
    if (qParam_[prec].edv_.v_ave <= qParam_[prec].edp_.th_max) {
      //in which case determine the probabilty for dropping the packet,
      
      qParam_[prec].edv_.count++;
      qParam_[prec].edv_.v_prob = (1/qParam_[prec].edp_.max_p_inv) *
	(qParam_[prec].edv_.v_ave-qParam_[prec].edp_.th_min) /
	(qParam_[prec].edp_.th_max-qParam_[prec].edp_.th_min);
      
      pb = qParam_[prec].edv_.v_prob;
      pa = pb/(1.0 - qParam_[prec].edv_.count*pb);

      //now determining whether to drop the packet or not
      u = Random::uniform(0.0, 1.0);
      
      //drop it
      if (u <= pa) {
	// When average queue length is between min. threshold and max. threshold 
	// and the packet is dropped, the value of edv_.count should be set to 0.
	// by Janusz Gozdecki <gozdecki@kt.agh.edu.pl>, 7/13/2002
	qParam_[prec].edv_.count = 0; 
	if (ecn) {
	  // set idle_ to 0
	  updateIdleFlag(prec); 
	  return PKT_MARKED;
	}
	return PKT_EDROPPED;
      }
    } else { //if avg queue is greater than max. threshold
      qParam_[prec].edv_.count = 0;
      if (ecn) {
	// set idle_ to 0
	updateIdleFlag(prec); 
	return PKT_MARKED;
      }
      return PKT_DROPPED;
    }
  } else {
    // When average queue length is between min. threshold and max. threshold 
    // and the packet is not dropped the value of edv_.count should be unchanged
    // rather than -1 (which causes a significant impact on the number of early packet drops).
    // by Janusz Gozdecki <gozdecki@kt.agh.edu.pl>, 7/13/2002
    qParam_[prec].edv_.count = -1;
  }

  // if ecn is on, then the packet has already been enqueued
  if(ecn) { 
    // set idle_ to 0
    updateIdleFlag(prec); 
    return PKT_ENQUEUED;
  }
  
  //if the packet survives the above conditions it
  //is finally queued in the underlying queue
  q_->enque(pkt);
  
  //virtually, this new packet is queued in one of the multiple queues,
  //thus increasing the length of that virtual queue
  qParam_[prec].qlen++;

  // set idle_ to 0
  updateIdleFlag(prec); 
  
  return PKT_ENQUEUED;
}

//  Packet* deque()
//    Deques a packet from the physical queue.
Packet* redQueue::deque() {
  return(q_->deque());
}

// void calcAvg(int prec, int m)
//   This method calculates avg queue length, given the prec number, 
//   m (a value used to adjust the queue size appropriately during idle times).
//   If mredMode is rio_c, each virtual queue size is calculated independently.
//   If it is true, the calculated size of queue n includes the sizes of all 
//   virtual queues up to and including n.
void redQueue::calcAvg(int prec, int m) {
  float f;
  int i;
  
  f = qParam_[prec].edv_.v_ave;
  
  while (--m >= 1) {
    f *= 1.0 - qParam_[prec].edp_.q_w;
  }
  f *= 1.0 - qParam_[prec].edp_.q_w;
  
  if (mredMode == rio_c)
    for (i = 0; i <= prec; i ++)
      f += qParam_[i].edp_.q_w * qParam_[i].qlen;
  else if (mredMode == rio_d)
    f += qParam_[prec].edp_.q_w * qParam_[prec].qlen;
  else //wred
    f += qParam_[prec].edp_.q_w * q_->length();
  
  if (mredMode == wred)
    for (i = 0; i < numPrec; i ++)
      qParam_[i].edv_.v_ave = f;
  else //rio_c, rio_d
    qParam_[prec].edv_.v_ave = f;
}

// double getWeightedLength()
//    Returns the weighted RED queue length for the entire physical queue, 
//       in packets.
double redQueue::getWeightedLength() {
  double sum = 0.0;
  
  if (mredMode == rio_c)
    return qParam_[numPrec-1].edv_.v_ave;
  else {
    for (int prec = 0; prec < numPrec; prec++)
      sum += qParam_[prec].edv_.v_ave;
    return(sum);
  }
}

// int getRealLength(void)
//    Returns the length of the physical queue, in packets.
int redQueue::getRealLength(void) {
  return(q_->length());
}

// Returns the weighted RED queue length for one virtual queue in packets
// Added by Thilo (12/14/2001), xuanc
double redQueue::getWeightedLength_v(int prec) {
  return qParam_[prec].edv_.v_ave;
}

// Returns the length of one virtual queue, in packets
// Added by Thilo (12/14/2001), xuanc
int redQueue::getRealLength_v(int prec) {
  return qParam_[prec].qlen;
}

//  void setPTC(int outLinkBW)
//    Sets the packet time constant, given the outgoing link bandwidth from the
//    router.
void redQueue::setPTC(double outLinkBW) {
  for (int i = 0; i < numPrec; i++)
    qParam_[i].edp_.ptc = outLinkBW/(8.0*qParam_[i].edp_.mean_pktsize);
}

//  void setMPS(int mps)
//    Sets the mean packet size for each of the virtual queues.
void redQueue::setMPS(int mps) {
  for (int i = 0; i < numPrec; i++)
    qParam_[i].edp_.mean_pktsize = mps;
}