133:(DCA), on a packet-by-packet or slot-by-slot basis, a user that is situated in the overlap between the coverage areas of several base stations would cause, or would be affected by, interference to/from nearby cells. The DCA algorithm would prevent the nearby cells from using the same frequency channel simultaneously. The cost function would correspond to the number of blocked nearby base station sites.
117:, the power control will cause high interference level to signals from other users. This will prevent other more efficient data flows, since there is a maximum allowed interference level in the cell, and reduce the throughput. Consequently, for maximum throughput scheduling, data flows that suffer from high
141:
If there are large differences between the "cost" of each data flow, which is the case especially in wireless networking, resources may be assigned to only one or very few data flows per physical channel in the network. If there are many simultaneously active data flows, a majority of the data flows
56:
queuing to take advantage of favourable channel conditions to make best use of available radio conditions. Maximum throughput scheduling may be tempting in this context, especially in simulations where throughput of various schemes are compared. However, maximum throughput scheduling is normally not
188:
algorithms, a maximum throughput scheduling algorithm relies on the calculation of a cost function, which in wireless networks may require fast and truthful measurement of the path loss.
45:
in a wireless network. This is achieved by giving scheduling priority to the least "expensive" data flows in terms of consumed network resources per transferred amount of information.
145:
A maximum throughput scheduling policy may be tempting since it would optimize the resource utilization in a given network, but it would not be likely to maximize
90:. For maximum throughput scheduling, links that are affected by low attenuation should be considered as inexpensive, and should be given scheduling priority.
247:
142:
will have to wait until the most inexpensive flows have no more data to transfer, and will suffer from scheduling starvation.
232:
252:
49:
53:
234:”Evaluation of Packet-by-Packet Downlink Radio Resource Management Schemes”, VTC’01, 6-9 May 2001, Rhodes, Greece.
102:
106:
222:
130:
42:
210:
86:(CNR), which depends on the attenuation on the link between the transmitter and receiver, i.e. the
185:
83:
227:
193:
150:
57:
desirable, and channel-dependent scheduling should be used with care, as we will see below.
173:, meaning that the service quality that each data flow achieves would be even more stable.
8:
189:
160:
30:
146:
205:
170:
166:
71:
34:
228:
Optimal techniques for maximum throughput scheduling in packet switching networks
99:
75:
27:
16:
Procedure for scheduling data packets in a packet switched best-effort network
241:
110:
181:
177:
78:, and without co-channel interference from nearby wireless networks, the
23:
38:
52:
3.5G cellular system, channel-dependent scheduling is used instead of
118:
114:
87:
163:
would result in lower throughput, but starvation would be avoided.
154:
79:
136:
60:
121:
should be considered as the most expensive, also in this case.
196:
also require measurement or calculation of the cost function.
223:
Maiximum throughput scheduling in packet switching networks
169:
would result in even lower throughput, but higher level of
124:
48:In advanced packet radio systems, for example the
113:for all users. For a user that suffers from high
239:
157:experiencing long or permanent service outages.
137:Comparison with other resource sharing policies
61:Cost function in wireless packet radio systems
93:
65:
149:for the network operator. The levels of
240:
125:Example 3: Dynamic channel allocation
13:
14:
264:
216:
37:, in view to maximize the total
129:In wireless network with fast
109:(CIR) is held constant by the
22:is a procedure for scheduling
1:
248:Network scheduling algorithms
153:would remain low due to many
107:carrier-to-interference ratio
20:Maximum throughput scheduling
7:
199:
10:
269:
131:dynamic channel allocation
94:Example 2: Spread spectrum
66:Example 1: Link adaptation
43:system spectral efficiency
253:Radio resource management
211:Radio resource management
180:scheduling based on the
82:depends heavily on the
41:of the network, or the
84:carrier to noise ratio
194:weighted fair queuing
190:Proportional fairness
161:Proportional fairness
151:customer satisfaction
98:In the uplink of a
31:best-effort network
260:
206:Fairness measure
167:Max-min fairness
72:wireless network
35:wireless network
268:
267:
263:
262:
261:
259:
258:
257:
238:
237:
219:
202:
139:
127:
103:cellular system
100:spread spectrum
96:
76:link adaptation
68:
63:
28:packet-switched
17:
12:
11:
5:
266:
256:
255:
250:
236:
235:
230:
225:
218:
217:External links
215:
214:
213:
208:
201:
198:
138:
135:
126:
123:
95:
92:
67:
64:
62:
59:
33:, typically a
15:
9:
6:
4:
3:
2:
265:
254:
251:
249:
246:
245:
243:
233:
231:
229:
226:
224:
221:
220:
212:
209:
207:
204:
203:
197:
195:
191:
187:
183:
179:
174:
172:
168:
164:
162:
158:
156:
152:
148:
143:
134:
132:
122:
120:
116:
112:
111:power control
108:
104:
101:
91:
89:
85:
81:
77:
73:
58:
55:
51:
46:
44:
40:
36:
32:
29:
25:
21:
182:fair queuing
178:max-min fair
175:
165:
159:
144:
140:
128:
97:
69:
47:
24:data packets
19:
18:
186:round robin
242:Categories
39:throughput
192:based on
155:customers
119:path loss
115:path loss
88:path loss
200:See also
171:fairness
80:bit rate
176:Unlike
147:profit
105:, the
74:with
70:In a
50:HSDPA
26:in a
54:FIFO
184:or
244::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.