ul-job.h

Go to the documentation of this file.

/*
 * Copyright (c)
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation;
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Author:  Juliana Freitag Borin, Flavio Kubota and Nelson L.
 * S. da Fonseca - wimaxgroup@lrc.ic.unicamp.br
 */
 
#ifndef UL_JOB_H
#define UL_JOB_H
 
#include "service-flow-record.h"
#include "service-flow.h"
#include "ss-record.h"
 
#include "ns3/header.h"
 
#include <stdint.h>
 
namespace ns3
{
 
class SSRecord;
class ServiceFlow;
 
enum ReqType
{
    DATA,
    UNICAST_POLLING
};
 
class UlJob : public Object
{
  public:
    enum JobPriority
    {
        LOW,
        INTERMEDIATE,
        HIGH
    };
 
    UlJob();
    ~UlJob() override;
    SSRecord* GetSsRecord() const;
    void SetSsRecord(SSRecord* ssRecord);
    ServiceFlow::SchedulingType GetSchedulingType() const;
    void SetSchedulingType(ServiceFlow::SchedulingType schedulingType);
    ServiceFlow* GetServiceFlow() const;
    void SetServiceFlow(ServiceFlow* serviceFlow);
 
    ReqType GetType() const;
    void SetType(ReqType type);
 
    Time GetReleaseTime() const;
    void SetReleaseTime(Time releaseTime);
 
    Time GetPeriod() const;
    void SetPeriod(Time period);
 
    Time GetDeadline() const;
    void SetDeadline(Time deadline);
 
    uint32_t GetSize() const;
    void SetSize(uint32_t size);
 
  private:
    friend bool operator==(const UlJob& a, const UlJob& b);
 
    Time m_releaseTime;                           
    Time m_period;                                
    Time m_deadline;                              
    uint32_t m_size;                              
    ServiceFlow::SchedulingType m_schedulingType; 
 
    SSRecord* m_ssRecord; 
 
    ReqType m_type;             
    ServiceFlow* m_serviceFlow; 
};
 
class PriorityUlJob : public Object
{
  public:
    PriorityUlJob();
    int GetPriority() const;
    void SetPriority(int priority);
 
    Ptr<UlJob> GetUlJob() const;
    void SetUlJob(Ptr<UlJob> job);
 
  private:
    int m_priority;   
    Ptr<UlJob> m_job; 
};
 
struct SortProcess
{
    bool operator()(PriorityUlJob& left, PriorityUlJob& right) const
    {
        if (left.GetPriority() < right.GetPriority())
        {
            return true;
        }
        else if (left.GetPriority() == right.GetPriority())
        {
            int32_t leftBacklogged =
                left.GetUlJob()->GetServiceFlow()->GetRecord()->GetBacklogged();
            int32_t rightBacklogged =
                left.GetUlJob()->GetServiceFlow()->GetRecord()->GetBacklogged();
            return leftBacklogged <= rightBacklogged;
        }
        else
        {
            return false;
        }
    }
};
 
struct SortProcessPtr
{
    bool operator()(Ptr<PriorityUlJob>& left, Ptr<PriorityUlJob>& right) const
    {
        if (left->GetPriority() < right->GetPriority())
        {
            return true;
        }
        else if (left->GetPriority() == right->GetPriority())
        {
            int32_t leftBacklogged =
                left->GetUlJob()->GetServiceFlow()->GetRecord()->GetBacklogged();
            int32_t rightBacklogged =
                left->GetUlJob()->GetServiceFlow()->GetRecord()->GetBacklogged();
            return leftBacklogged <= rightBacklogged;
        }
        else
        {
            return false;
        }
    }
};
 
} // namespace ns3
 
#endif /* UL_JOB_H */