Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010107935 | TK5103.3 M57 2006 | Open Access Book | Book | Searching... |
Searching... | 30000010134772 | TK5103.3 M57 2006 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
Until now, developers and researchers interested in the design, operation, and performance of Bluetooth networks have lacked guidance about potential answers and the relative advantages and disadvantages of performance solutions.
Performance Modeling and Analysis of Bluetooth Networks: Polling, Scheduling, and Traffic Control summarizes the research on the performance of Bluetooth networks, including both piconets and scatternets, conducted since 2001. The book provides insights into the performance of Bluetooth networks through an analytical approach based upon queuing theory and discrete event simulation. It also proposes and validates solutions for common problems that are not covered by the official Bluetooth specifications.
This volume allows developers and researchers to enrich their knowledge of performance issues and become better equipped to solve problems related to the design, deployment, and operation of Bluetooth networks.
Table of Contents
1 Introduction to Bluetooth | p. 1 |
1.1 Lower layers of the architecture: RF and baseband | p. 1 |
1.2 Higher layers of the architecture: LMP and L2CAP | p. 4 |
1.3 Data transport and link types | p. 5 |
1.4 Connection state and related modes | p. 9 |
1.5 Piconet formation: inquiry and paging | p. 12 |
2 Intra-piconet polling schemes | p. 15 |
2.1 Bluetooth communications and intra-piconet polling | p. 15 |
2.2 Classification of polling schemes | p. 17 |
2.3 On segmentation and reassembly policies | p. 22 |
2.4 Piconet model and performance indicators | p. 24 |
3 Analysis of polling schemes | p. 27 |
3.1 Performance of exhaustive service | p. 27 |
3.2 Performance of 1-limited service | p. 30 |
3.3 E-limited polling | p. 34 |
3.4 Access and downlink delay | p. 46 |
4 The impact of finite buffers | p. 53 |
4.1 Queue length distribution in imbedded Markov points | p. 54 |
4.2 Uplink queue length distribution | p. 61 |
4.3 Experimental results | p. 67 |
5 Admission control | p. 73 |
5.1 Admission control based on queue stability | p. 74 |
5.2 Admission control based on access delay | p. 77 |
5.3 Admission control based on cycle time | p. 79 |
6 Performance of TCP traffic | p. 83 |
6.1 System model and related work | p. 85 |
6.2 TCP window size | p. 87 |
6.3 Queueing analysis of the token bucket filter | p. 91 |
6.4 The outgoing queue at the baseband level | p. 96 |
6.5 Performance assessment | p. 102 |
7 Piconets with synchronous traffic | p. 109 |
7.1 Why the built-in SCO links are bad | p. 109 |
7.2 pSCO: an improved scheme for synchronous traffic | p. 112 |
7.3 Performance of the pSCO scheme | p. 114 |
8 Adaptive polling and predefined delay bounds | p. 129 |
8.1 Adaptive bandwidth allocation | p. 129 |
8.2 Adaptive polling with cycle control: the ACLS scheme | p. 133 |
8.3 ACLS performance | p. 138 |
8.4 Improving the performance of ACLS | p. 142 |
9 Scatternet formation | p. 147 |
9.1 Introduction | p. 147 |
9.2 BSF in single-hop networks | p. 152 |
9.3 BSF in multi-hop networks | p. 156 |
9.4 Conclusions | p. 171 |
10 Bridge topologies and scheduling | p. 173 |
10.1 Bridge topologies | p. 173 |
10.2 Approaches to bridge scheduling | p. 179 |
10.3 Bridge scheduling in practice | p. 184 |
10.4 The queueing model and traffic assumptions | p. 185 |
11 Rendezvous-based bridge scheduling | p. 189 |
11.1 MS bridge topology | p. 189 |
11.2 Packet delays: the MS bridge case | p. 197 |
11.3 Performance of the MS bridge | p. 202 |
11.4 SS bridge topology | p. 205 |
11.5 Packet delays: the SS bridge case | p. 215 |
11.6 Performance of the SS bridge | p. 217 |
12 Adaptive bridge scheduling | p. 223 |
12.1 Minimization of delays | p. 223 |
12.2 Adaptive management: the case of the MS bridge | p. 226 |
12.3 Adaptive management: the case of the SS bridge | p. 229 |
13 Walk-in bridge scheduling | p. 233 |
13.1 Scatternet model | p. 233 |
13.2 Service, vacation, and cycle times | p. 237 |
13.3 Calculating the packet delays | p. 248 |
13.4 Stability considerations | p. 251 |
13.5 Scalability | p. 255 |
14 Scatternet with finite buffers | p. 259 |
14.1 Scatternet model with finite buffers | p. 259 |
14.2 Uplink/downlink queue length distribution in Markov points | p. 262 |
14.3 Service, vacation, and cycle times | p. 265 |
14.4 Blocking probability and packet delays | p. 268 |
14.5 Simulation results | p. 276 |
A Probability generating functions and Laplace transforms | p. 287 |
References | p. 289 |
Index | p. 307 |