Abstract
dc:description.abstractThis thesis proposes a new distributed, dynamic routing approach for communication networks involving high traffic. In such a network, load factor {amount of traffic) plays a key role in deciding the optimum path for sending a message from one node to another. A more practical method to estimate the load factor is proposed. The network is divided into several virtual areas and monitors are assigned to each area. The monitors keep track of area and network loads. Routing decisions are based on: load factors of relevant areas; urgency of the message; and the distance from the sending node to the receiving node. The routing technique proposed in this thesis reduced the time required, reduced network overflow, and realistically estimated the load factor. Our technique also utilizes the network capacity to near maximum when a critical message is delivered.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - University Access Only
- Discipline thesis:degree_discipline
- Computer Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Pampati, Sreedhar
- Contributors dc:contributor
-
- Bin Cong
Subjects
dc:subject × 2Rights
dc:rights- Language dc:language
- English
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd2/132