7.2: Reasoning Behind the Algorithms
This thesis presents two algorithms: The Broadband Pipeline Physical Feasibility Algorithm, and The Broadband Last Mile Infrastructure Physical Feasibility Algorithm. Because pipelines and last mile networks are independent of each other, these two algorithms are designed to be used independently of each other.
The Pipeline Algorithm (for short) is designed to operate using event-driven programming and to be implemented using HTML. There are two phases to this algorithm: user data entry, and summary. The user data entry phase poses a number of clearly-worded yes/no questions to the user, one at a time. These yes/no questions ask the user if specific physical requirements (rules) are met for different types of pipelines: fibre, BPL, wireless, and satellite. Following each question, the user must choose “yes” or “no”, then continue on to the next question. With each step, the user's reply is stored in a variable. Three questions require the user to enter positive integers before continuing to the next question: fibre pipeline path length, BPL pipeline path length, and line of sight pipeline length. These numbers are also stored in variables. After the last question is answered, the summary phase of the algorithm is entered. The summary phase looks at each yes/no variable and prints a “technology is feasible” message if the variable's value is “yes”, or prints a “technology is not feasible” message if the variable's value is “no”. If fibre is feasible, the estimated cost range of the pipeline is displayed, based on the fibre pipeline path length number multiplied by the $10,000 to $20,000 price range printed earlier in this paper. Similar calculations are also made for BPL and wireless. The line of sight distance additionally allows the physical feasibility of WiFi, Canopy and WiMAX to be determined based on their maximum ranges printed earlier in this paper. This is the entire functionality of this algorithm.
The Last Mile Algorithm (for short) is also designed to operate using event-driven programming and to be implemented using HTML. There are also two parts to this algorithm: user data entry, and summary. The user data entry phase poses a number of clearly-worded questions to the user, one at a time. To take care of users looking for a technology to just cover a single building, the first question asks the user if their target area is a single building, or a community. If they choose “building”, a message will be displayed telling them a wired or wireless Ethernet LAN is the best choice for networking within a building. The algorithm ends there. If instead they choose “community”, the algorithm continues as follows. A number of yes/no questions ask the user if specific physical requirements (rules) are met for different types of last mile networks: DSL, cable, BPL, WiFi Mesh, and Canopy/WiMAX. Canopy and WiMAX are combined because of their similar abilities and requirements. Cellular networks were omitted because of their private and proprietary nature, and MMDS/LMDS were omitted because they are likely to soon be replaced by Canopy or WiMAX networks. Following each question, the user must choose “yes” or “no”, then continue on to the next question. With each step, the user's reply is stored in a variable. After the last question is answered, the summary phase of the algorithm is entered. The summary phase looks at each yes/no variable and prints a “technology is feasible” message if the variable's value is “yes”, or prints a “technology is not feasible” message if the variable's value is “no”. If available, an estimate on the deployment cost of each technology is also displayed. These numbers are stored in constants. This is the entire functionality of this algorithm.
© Jake Cormier, 2006 [jake (at) stormcloudstudios.com]
Completed as a partial requirement for the degree of Bachelor of Science (specialized)
Department of Computer Science :: Algoma University College :: Sault Ste. Marie, Ontario :: Spring 2006