Document Type

Thesis - University Access Only

Award Date

1995

Degree Name

Master of Science (MS)

Department / School

Computer Science

First Advisor

Bin Cong

Abstract

This 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.

Library of Congress Subject Headings

Computer networks
Telecommunication -- Traffic

Format

application/pdf

Publisher

South Dakota State University

Download

Share

COinS
 

Rights Statement

In Copyright