distributed frequency allocation algorithms for cellular
play

Distributed frequency allocation algorithms for cellular networks: - PowerPoint PPT Presentation

Distributed frequency allocation algorithms for cellular networks: Trade-offs and tuning strategies Marina Papatriantafilou, David Rutter and Philippas Tsigas Chalmers University of Technology Gothenburg, Sweden. What did we do ?


  1. Distributed frequency allocation algorithms for cellular networks: Trade-offs and tuning strategies Marina Papatriantafilou, David Rutter and Philippas Tsigas Chalmers University of Technology Gothenburg, Sweden.

  2. What did we do ? •Frequency Allocation in cellular networks •Distributed solutions: •How do they perform in practice ? •How can we tune them ? •What are the trade-offs ? •What happens when the load is dynamic and non uniform ? •What happens if there are failures in the network ?

  3. Base station Free Freq. 1 Freq. 2 . . Busy . Freq. n

  4. Cellular Network

  5. Deterministic Distributed List Colouring (DET_DLC) •Based on vertex-colouring by Alon & Tarsi and advanced mutual exclusion due to Choy & Singh. •Introduced by Garg, Papatriantafilou and Tsigas.

  6. Randomised Distributed List Colouring (RAND_DLC) •Avoids sychronisation by randomising the frequencies that are chosen by a base station. •Also introduced by Garg, Papatriantafilou and Tsigas.

  7. Tuning Strategies •Dynamically determining the number of frequencies to acquire, and retain. Free Busy

  8. Tuning Strategies Little’s Law: •Mean number of requests at a base station ( λ i T) •LittlesLawStrategy = λ i T-| Busy i | QueueRatio: • min_ratio = min ( λ i T) ≠ 0 • QueueRatio = r i (1+1/ ∆ ))(1- free_ratio ) •QueueRatio Strategy = max ( QueueRatio , min_ratio )

  9. Experiment Design •Network size: 49 cells •Spectrum size: 500 frequencies •Arrival rate: Poisson distribution. Hot-cells λ = 85/min, normal cells λ = 45/min, cold cells λ = 20/min •Total number of requests: 100,000 •Failures: Up to 3 crash failures at arbitrary stations. •Network load: based on hot-cell configurations that are changed during the experiment execution.

  10. The Trade-offs… Response Time Dropped Calls Total Messages Bandwidth Utilisation

  11. Response Time vs Dropped Requests

  12. Total Messages vs Utilisation

  13. Conclusions • By designing appropriate tuning strategies, we can balance the trade-offs so that the performance gains can be substantial, while the losses are small. • Fault tolerance: our results confirm the theoretic results. Also, the tuning strategies actually improve the performance of the algorithms in some respects.

  14. Future Work • To develop algorithms that can make use of the frequency reuse information, while maintaining the performance and fault tolerant properties of the previous solutions. • Continuing the current study, looking at priority schemes, frequency reservation schemes (for hand- offs), etc.

  15. Dropped Requests

  16. Response Time

  17. Bandwidth Utilisation

  18. Total Messages

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend