Dynamic Channel Allocation
Abstract
Dynamic Channel Allocation (DCA) offers the possibility of capturing unused channel capacity by allocating unused resources between competing network nodes. This can reduce or possibly eliminate channels sitting idle while information awaits transmission. This holds potential for increasing throughput on bandwidth constrained networks. This thesis begins by examining channel allocation techniques currently used. Following this, a solution is proposed that utilizes two types of algorithms to dynamically allocate channels from which a computer simulation is devised. Upon gathering the results, an analysis is conducted and suggestions are given for future work in channel allocation. Chapter II discusses and compares fixed channel allocation with dynamic channel allocation. In addition, some of the algorithms used to achieve channel allocation are explored. This chapter also looks at techniques used, such as inverse multiplexing, time division multiplexed on demand, hybrid channel allocation in wireless networks, and Beowulf Ethernet channel bonding. The background information presented in this chapter gives an indication that channel allocation is still being examined and several implementations are proposed. Chapter III proposes a solution with two scheduling algorithms. One algorithm is a First Come First Serve, which gives all free dynamic channels to the first requesting fixed channel. The other algorithm is a Fair Distribution, which gives a portion of the free dynamic channels to the requesting fixed channels. A computer program is devised that simulates these algorithms, and the methods used in the program classes are described in this chapter. (27 tables, 19 figures, 38 refs.)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 2003
- Accession Number
- ADA418595
Entities
People
- Andrew D. Kaminsky
Organizations
- Naval Postgraduate School