Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks Wireless Ad Hoc and Sensor Networks
Admission Controller Design for High-Speed Networks 153If the traffic is estimated accurately, then the traffic flow modeling errorcan be made very small, which results in a small estimation error in bufferoccupancy. By minimizing the buffer occupancy estimation error, it isshown that the accumulated traffic at the switch is estimated accurately.In high-speed networks, each source should be able to use the availablebandwidth up to its peak bit/cell rate (PBR/PCR). The goal of a bandwidthestimation and allocation scheme, then, is to enable the availablebandwidth to be fully utilized while maintaining a good QoS, where theQoS parameters are the packet or cell loss ratio (PLR/CLR), and transferdelay. In this chapter, the objective of selecting a suitable traffic estimationscheme is to estimate the current bandwidth usage, predict the futurebandwidth requirement, and to identify the available capacity for newsources in the next measurement interval.Equation 4.5 calculates the packet/cell losses encountered at the switchfabric because of the traffic estimation scheme. In this chapter, it is envisionedthat by appropriately using an adaptive estimator in discrete timeto provide the traffic estimate, f ˆ( x( k)), the error in buffer length, and hencethe packet/cell losses, can be minimized. The actual packet/cell lossesare related to the bandwidth requirement for the next measurement interval.By appropriately combining the bandwidth estimated using the predictedtraffic conditions, packet/cell losses, along with the queued data at theswitch, one can estimate the bandwidth required to satisfy the target QoSin the next measurement interval.The buffer occupancy estimation error system expressed in Equation4.5 is used to focus on selecting discrete-time parameter-tuning algorithmsthat guarantee the QoS by appropriately assigning the adequate bandwidthto the existing sources, provided no congestion exists. The proposedadaptive methodology can be best described as follows: The adaptivescheme at the ingress node/switch fabric estimates the network traffic;this estimated traffic, packet/cell losses, and target transfer delay are usedto compute the equivalent bandwidth required to meet the target QoS.4.3 Adaptive Traffic Estimator DesignIn the two-layer NN case, the tunable weights enter in a nonlinear fashion.Stability analysis by Lyapunov’s direct method is performed using novelweight-tuning algorithms that are developed in this chapter. Assume, therefore,that there exist some constant ideal weights W and V for a two-layerNN so that the nonlinear traffic accumulation function can be written asT Tf( x( k)) = W ϕ ( V ϕ ( x( k))) + ε( k)2 1(4.6)
154 Wireless Ad Hoc and Sensor Networkswhere ϕ2( k)is the vector of hidden-layer activation functions, ϕ1( k)is avector linear function, and |( ε k)|≤ εNwith the bounding constant, ε N ,known. For suitable approximation properties, it is necessary to select alarge enough number of hidden-layer neurons. It is not known how tocompute this number for general multilayer NN. Typically, the numberof hidden-layer neurons is selected by a trial-and-error procedure.4.3.1 Estimator StructureDefining the NN traffic estimate in the buffer occupancy estimator byˆ( ( )) ˆ TTf x k = W ( k) ϕ ( V ϕ ( x( k)))2 1(4.7)with Wk ˆ ( ) and Vk ˆ ( ) being the current NN weights, the next step is todetermine the weight updates so that the performance of the closed-loopbuffer occupancy estimation error dynamics at the switch is guaranteed.The structure of the estimator is shown in Figure 4.3, where the currentand past values of buffer occupancy are used as inputs to the NN modelso that an accurate estimate of the network traffic accumulation isobtained. The current and past traffic estimates are used to derive thebandwidth equivalent.Let W and V be the unknown target NN weights required for theapproximation to hold in Equation 4.5 and assume that they are boundedso thatW ≤W , V ≤Vmaxmax. (4.8)d(k)u(k)Buffer dynamicsx(k+1)e(k+1)+−Estimatorx(k + 1)z −1f (x(k))f (x(k − 1))+−∆f(x(k))1/tBandwidthequivalent∆Bw(k)FIGURE 4.3Neural network bandwidth estimator structure.
- Page 125 and 126: 102 Wireless Ad Hoc and Sensor Netw
- Page 127 and 128: 104 Wireless Ad Hoc and Sensor Netw
- Page 129 and 130: 106 Wireless Ad Hoc and Sensor Netw
- Page 131 and 132: 108 Wireless Ad Hoc and Sensor Netw
- Page 133 and 134: 110 Wireless Ad Hoc and Sensor Netw
- Page 135 and 136: 112 Wireless Ad Hoc and Sensor Netw
- Page 137 and 138: 114 Wireless Ad Hoc and Sensor Netw
- Page 139 and 140: 116 Wireless Ad Hoc and Sensor Netw
- Page 141 and 142: 118 Wireless Ad Hoc and Sensor Netw
- Page 143 and 144: 120 Wireless Ad Hoc and Sensor Netw
- Page 145 and 146: 122 Wireless Ad Hoc and Sensor Netw
- Page 147 and 148: 124 Wireless Ad Hoc and Sensor Netw
- Page 149 and 150: 126 Wireless Ad Hoc and Sensor Netw
- Page 151 and 152: 128 Wireless Ad Hoc and Sensor Netw
- Page 153 and 154: 130 Wireless Ad Hoc and Sensor Netw
- Page 155 and 156: 132 Wireless Ad Hoc and Sensor Netw
- Page 157 and 158: 134 Wireless Ad Hoc and Sensor Netw
- Page 159 and 160: 136 Wireless Ad Hoc and Sensor Netw
- Page 161 and 162: 138 Wireless Ad Hoc and Sensor Netw
- Page 163 and 164: 140 Wireless Ad Hoc and Sensor Netw
- Page 165 and 166: 142 Wireless Ad Hoc and Sensor Netw
- Page 167 and 168: 144 Wireless Ad Hoc and Sensor Netw
- Page 170 and 171: 4Admission Controller Design for Hi
- Page 172 and 173: Admission Controller Design for Hig
- Page 174 and 175: Admission Controller Design for Hig
- Page 178 and 179: Admission Controller Design for Hig
- Page 180 and 181: Admission Controller Design for Hig
- Page 182 and 183: Admission Controller Design for Hig
- Page 184 and 185: Admission Controller Design for Hig
- Page 186 and 187: Admission Controller Design for Hig
- Page 188 and 189: Admission Controller Design for Hig
- Page 190 and 191: Admission Controller Design for Hig
- Page 192 and 193: Admission Controller Design for Hig
- Page 194 and 195: Admission Controller Design for Hig
- Page 196 and 197: Admission Controller Design for Hig
- Page 198: Admission Controller Design for Hig
- Page 201 and 202: 178 Wireless Ad Hoc and Sensor Netw
- Page 203 and 204: 180 Wireless Ad Hoc and Sensor Netw
- Page 205 and 206: 182 Wireless Ad Hoc and Sensor Netw
- Page 207 and 208: 184 Wireless Ad Hoc and Sensor Netw
- Page 209 and 210: 186 Wireless Ad Hoc and Sensor Netw
- Page 211 and 212: 188 Wireless Ad Hoc and Sensor Netw
- Page 213 and 214: 190 Wireless Ad Hoc and Sensor Netw
- Page 215 and 216: 192 Wireless Ad Hoc and Sensor Netw
- Page 217 and 218: 194 Wireless Ad Hoc and Sensor Netw
- Page 219 and 220: 196 Wireless Ad Hoc and Sensor Netw
- Page 221 and 222: 198 Wireless Ad Hoc and Sensor Netw
- Page 223 and 224: 200 Wireless Ad Hoc and Sensor Netw
- Page 225 and 226: 202 Wireless Ad Hoc and Sensor Netw
<strong>Ad</strong>mission Controller Design for High-Speed <strong>Networks</strong> 153If the traffic is estimated accurately, then the traffic flow modeling errorcan be made very small, which results in a small estimation error in bufferoccupancy. By minimizing the buffer occupancy estimation error, it isshown that the accumulated traffic at the switch is estimated accurately.In high-speed networks, each source should be able to use the availableb<strong>and</strong>width up to its peak bit/cell rate (PBR/PCR). The goal of a b<strong>and</strong>widthestimation <strong>and</strong> allocation scheme, then, is to enable the availableb<strong>and</strong>width to be fully utilized while maintaining a good QoS, where theQoS parameters are the packet or cell loss ratio (PLR/CLR), <strong>and</strong> transferdelay. In this chapter, the objective of selecting a suitable traffic estimationscheme is to estimate the current b<strong>and</strong>width usage, predict the futureb<strong>and</strong>width requirement, <strong>and</strong> to identify the available capacity for newsources in the next measurement interval.Equation 4.5 calculates the packet/cell losses encountered at the switchfabric because of the traffic estimation scheme. In this chapter, it is envisionedthat by appropriately using an adaptive estimator in discrete timeto provide the traffic estimate, f ˆ( x( k)), the error in buffer length, <strong>and</strong> hencethe packet/cell losses, can be minimized. The actual packet/cell lossesare related to the b<strong>and</strong>width requirement for the next measurement interval.By appropriately combining the b<strong>and</strong>width estimated using the predictedtraffic conditions, packet/cell losses, along with the queued data at theswitch, one can estimate the b<strong>and</strong>width required to satisfy the target QoSin the next measurement interval.The buffer occupancy estimation error system expressed in Equation4.5 is used to focus on selecting discrete-time parameter-tuning algorithmsthat guarantee the QoS by appropriately assigning the adequate b<strong>and</strong>widthto the existing sources, provided no congestion exists. The proposedadaptive methodology can be best described as follows: The adaptivescheme at the ingress node/switch fabric estimates the network traffic;this estimated traffic, packet/cell losses, <strong>and</strong> target transfer delay are usedto compute the equivalent b<strong>and</strong>width required to meet the target QoS.4.3 <strong>Ad</strong>aptive Traffic Estimator DesignIn the two-layer NN case, the tunable weights enter in a nonlinear fashion.Stability analysis by Lyapunov’s direct method is performed using novelweight-tuning algorithms that are developed in this chapter. Assume, therefore,that there exist some constant ideal weights W <strong>and</strong> V for a two-layerNN so that the nonlinear traffic accumulation function can be written asT Tf( x( k)) = W ϕ ( V ϕ ( x( k))) + ε( k)2 1(4.6)