1 A Flexible Bandwidth Management Scheme in Bluetooth Chin-Fu Liu Multimedia and Communications Laboratory Department of Computer Science and Information Engineering National Chi Nan University Taiwan, R.O.C. Advisor : Chun-Chuan Yang
2 Outline Introduction Basic Version of Bandwidth-Based Polling (BBP-bas) Scheme Extended Version (BBP-ext) Scheduling algorithm for BBP-ext Performance Evaluation Conclusion
3 Introduction - Bluetooth Low cost Low complexity In a small area Piconet
4 Introduction Time Division Duplex Master based polling
5 Introduction
6 Introduction – QoS Support in BT. Goals of bandwidth management 1.Bandwidth satisfaction 2.Fairness Goal of Bandwidth-Based Polling (BBP) 1.Bandwidth management 2.Minimal Control signaling 3.Lower Jitter on SCO links
7 BBP notation QoS-slave SCO-slave BE-slave (best effort slaves) BBP-bas BBP-ext
8 Bandwidth Based Polling Scheme - Basic version Basic idea and slots allocation for QoS slaves Framing structure of time slots Dynamic frame for flexibility Polling many times
9 Bandwidth Based Polling Scheme - Basic version Basic idea and slots allocation for QoS slaves DH11 = DH5+DH5+DH1 DH5 > DH3 >> DH1 Maximum polling times
10 Bandwidth Based Polling Scheme - Basic version Basic idea and slots allocation for QoS slaves Progressive bandwidth allocation Negotiation process Master Slave i (BwRq i ) PicoFrameSize & PicoFrameLimit RequestSlot & Framelimit
11 Bandwidth Based Polling Scheme - Basic version QoS slave actions #Bytes i = BwRQ i * PicoFrameLimit * 625μs Payload type : ByteCount >= #Bytes i or DH5*K
12 Bandwidth Based Polling Scheme - Basic version QoS slave actions FrameLimit i =(RequestSlot i Byte#)/(BwRQ i *625μs)
13 Bandwidth Based Polling Scheme - Basic version Master actions PicoFrameSize - by RequestSlot i PicoFrameLimit - by FrameLimit i
14 Bandwidth Based Polling Scheme - Extended version Support SCO-Slave SCO link - Isochronous service by T SCO HV3 T SCO =6 (64Kbps CBR service) Adaptive T SCO Ex:T SCO =16 (24Kbps) Soft SCO links - Jitters due to shifting
15 Bandwidth Based Polling Scheme - Extended version Support SCO-Slave
16 Bandwidth Based Polling Scheme - Extended version Support Best Effort Slave (BE-Slave) Equilibrium state Unused Slots = PicoFrameLimit - PicoFrameSize Slots quantum = (PFL-PFS)/(# of BE-slaves)
17 Bandwidth Based Polling Scheme - Extended version Packet format in BBP-Ext Original Packet Master→QoS slave QoS slave→Master Master→BE slave BE slave→Master
18 Scheduling algorithm for BBP-ext Scheduling all kinds of slaves Round Robin S1=DH3 S2=DH8 S3=DH10 T SCO =10
19 Scheduling algorithm for BBP-ext Delay/Jitter analysis Reasons for shifting: (1) Undividable packet of QoS-slave (2) Other SCO-slaves Maximum shift → 4+(N-1)*2 Slots T sniff =T SCO N sniff-attempt =Maximum shift
20 Performance Evaluation Simulation Env & Performance Criteria 1 slot=625μs Bandwidth utilization Fairness and flexibility with QoS slaves Maximum shift in SCO links (Kbps)Slave 1Slave 2Slave 3Slave 4Slave 5Slave 6Slave 7Remarks Test case N/A6 QoS Test case T sco =10N/A5 QoS, 1 SCO Test case T sco =10BEN/A4 QoS, 1 SCO, 1 BE Test case 450 (0 ~ 2s) 75 (0 ~ 2s) 200 (0 ~ 2s) 150 (0 ~ 2s) 100 (0 ~ 2s) 150 (0 ~ 1s) N/ASlave 6 leaves early
21 Performance Evaluation Simulation Result & Discussion K=4 Req=150K
22 Performance Evaluation – Case 1 Simulation Result & Discussion K=1
23 Performance Evaluation – Case 1 Simulation Result & Discussion K=4
24 Performance Evaluation - Case 2 Simulation Result & Discussion K=4 TSCO=10
25 Performance Evaluation – Case 3 Simulation Result & Discussion K=4 TSCO=10
26 Performance Evaluation – Case 4 Simulation Result & Discussion
27 Performance Evaluation Simulation Result & Discussion K=1K=2 K=4K=8
28 Conclusion A dynamic framing structure Distributed Mechanism Minimal Control signaling Good performance and flexibility by BBP Future Work Master’s request Admission control Bluetooth 2.0