東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Models of packet switching networks ...

Zhao, Peng.

FindBook

Google Book

Amazon

博客來

Models of packet switching networks and their performance.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Models of packet switching networks and their performance./
作者:	Zhao, Peng.
面頁冊數:	170 p.
附註:	Source: Masters Abstracts International, Volume: 42-01, page: 0247.
Contained By:	Masters Abstracts International42-01.
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ80210
ISBN:	0612802108

Models of packet switching networks and their performance.
Zhao, Peng.

Models of packet switching networks and their performance. - 170 p.

Source: Masters Abstracts International, Volume: 42-01, page: 0247.

Thesis (M.Sc.)--University of Guelph (Canada), 2003.

The purpose of this thesis is to study the performance of packet switching networks under different conditions. I introduce the concept of packet switching networks in Chapter 1. In Chapter 2, a model used to study dynamics of packet switching networks is developed. First, the connection topology of packet switching networks is described by a weighted digraph, a concept from graph theory. Next, a distributed in space, synchronous and discrete time algorithm is developed for simulating packet switching networks. This algorithm employs a full-table routing with two types of routing table update: centralized and distributed. Algorithms for both types of routing table update are presented in detail in Chapter 2.

ISBN: 0612802108Subjects--Topical Terms:

515831
Mathematics.

Models of packet switching networks and their performance.
LDR:02365nmm 2200301 4500 001 1863546
005 20041216101848.5
008 130614s2003 eng d
020 $a 0612802108
035 $a (UnM)AAIMQ80210
035 $a AAIMQ80210
040 $a UnM $c UnM
100 1 $a Zhao, Peng. $3 1951064
245 1 0 $a Models of packet switching networks and their performance.
300 $a 170 p.
500 $a Source: Masters Abstracts International, Volume: 42-01, page: 0247.
500 $a Adviser: Anna T. Lawniczak.
502 $a Thesis (M.Sc.)--University of Guelph (Canada), 2003.
520 $a The purpose of this thesis is to study the performance of packet switching networks under different conditions. I introduce the concept of packet switching networks in Chapter 1. In Chapter 2, a model used to study dynamics of packet switching networks is developed. First, the connection topology of packet switching networks is described by a weighted digraph, a concept from graph theory. Next, a distributed in space, synchronous and discrete time algorithm is developed for simulating packet switching networks. This algorithm employs a full-table routing with two types of routing table update: centralized and distributed. Algorithms for both types of routing table update are presented in detail in Chapter 2.
520 $a Chapter 3 is devoted to studying the performance of the developed model. Our research is based on a periodic square lattice with 25 nodes in each spatial direction without or with, respectively, additional randomly generated links. I studied how an introduction of additional randomly generated links influences the performance of packet switching networks. Also I compared the performance of packet switching networks using centralized and distributed routing table update, and using three types of link cost functions: One, QueueSize and QueueSizePlusOne. All simulations included in Chapter 3 are executed by software called DataNetwork.exe . Chapter 4 gives a brief description of that software. Conclusion and future work are presented in Chapter 5.
590 $a School code: 0081.
650 4 $a Mathematics. $3 515831
650 4 $a Engineering, System Science. $3 1018128
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0405
690 $a 0790
690 $a 0544
710 2 0 $a University of Guelph (Canada). $3 1018650
773 0 $t Masters Abstracts International $g 42-01.
790 1 0 $a Lawniczak, Anna T., $e advisor
790 $a 0081
791 $a M.Sc.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ80210