1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/*
* Copyright (c) 1996-1997 The Regents of the University of California.
* 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 the Network Research
* Group at Lawrence Berkeley National Laboratory.
* 4. Neither the name of the University nor of the Laboratory may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 THE REGENTS 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.
*
* @(#) $Header: /cvsroot/nsnam/ns-2/queue/queue.h,v 1.35 2005/01/13 18:33:48 haldar Exp $ (LBL)
*/
#ifndef ns_queue_h
#define ns_queue_h
#include "connector.h"
#include "packet.h"
#include "ip.h"
class Packet;
class PacketQueue : public TclObject {
public:
PacketQueue() : head_(0), tail_(0), len_(0), bytes_(0) {}
virtual int length() const { return (len_); }
virtual int byteLength() const { return (bytes_); }
virtual Packet* enque(Packet* p) { // Returns previous tail
Packet* pt = tail_;
if (!tail_) head_= tail_= p;
else {
tail_->next_= p;
tail_= p;
}
tail_->next_= 0;
++len_;
bytes_ += hdr_cmn::access(p)->size();
return pt;
}
virtual Packet* deque() {
if (!head_) return 0;
Packet* p = head_;
head_= p->next_; // 0 if p == tail_
if (p == tail_) head_= tail_= 0;
--len_;
bytes_ -= hdr_cmn::access(p)->size();
return p;
}
Packet* lookup(int n) {
for (Packet* p = head_; p != 0; p = p->next_) {
if (--n < 0)
return (p);
}
return (0);
}
/* remove a specific packet, which must be in the queue */
virtual void remove(Packet*);
/* Remove a packet, located after a given packet. Either could be 0. */
void remove(Packet *, Packet *);
Packet* head() { return head_; }
Packet* tail() { return tail_; }
// MONARCH EXTNS
virtual inline void enqueHead(Packet* p) {
if (!head_) tail_ = p;
p->next_ = head_;
head_ = p;
++len_;
bytes_ += hdr_cmn::access(p)->size();
}
void resetIterator() {iter = head_;}
Packet* getNext() {
if (!iter) return 0;
Packet *tmp = iter; iter = iter->next_;
return tmp;
}
protected:
Packet* head_;
Packet* tail_;
int len_; // packet count
int bytes_; // queue size in bytes
// MONARCH EXTNS
private:
Packet *iter;
};
class Queue;
class QueueHandler : public Handler {
public:
inline QueueHandler(Queue& q) : queue_(q) {}
void handle(Event*);
private:
Queue& queue_;
};
class Queue : public Connector {
public:
virtual void enque(Packet*) = 0;
virtual Packet* deque() = 0;
virtual void recv(Packet*, Handler*);
virtual void updateStats(int queuesize);
void resume();
int blocked() const { return (blocked_ == 1); }
void unblock() { blocked_ = 0; }
void block() { blocked_ = 1; }
int limit() { return qlim_; }
int length() { return pq_->length(); } /* number of pkts currently in
* underlying packet queue */
int byteLength() { return pq_->byteLength(); } /* number of bytes *
* currently in packet queue */
/* mean utilization, decaying based on util_weight */
virtual double utilization (void);
/* max utilization over recent time period.
Returns the maximum of recent measurements stored in util_buf_*/
double peak_utilization(void);
virtual ~Queue();
protected:
Queue();
void reset();
int qlim_; /* maximum allowed pkts in queue */
int blocked_; /* blocked now? */
int unblock_on_resume_; /* unblock q on idle? */
QueueHandler qh_;
PacketQueue *pq_; /* pointer to actual packet queue
* (maintained by the individual disciplines
* like DropTail and RED). */
double true_ave_; /* true long-term average queue size */
double total_time_; /* total time average queue size compute for */
void utilUpdate(double int_begin, double int_end, int link_state);
double last_change_; /* time at which state changed/utilization measured */
double old_util_; /* current utilization */
double util_weight_; /* decay factor for measuring the link utilization */
double util_check_intv_; /* interval for reseting the current
utilization measurements (seconds) */
double period_begin_; /* time of starting the current utilization
measurement */
double cur_util_; /* utilization during current time period */
int buf_slot_; /* Currently active utilization buffer */
double *util_buf_; /* Buffer for recent utilization measurements */
int util_records_; /* Number of recent utilization measurements
stored in memory. One slot in buffer holds
period of util_check_intv_ seconds. */
// measuring #drops
};
#endif
|
