東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Adaptive algorithms for routing and ...

Misra, Sudip.

FindBook

Google Book

Amazon

博客來

Adaptive algorithms for routing and traffic engineering in stochastic networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Adaptive algorithms for routing and traffic engineering in stochastic networks./
作者:	Misra, Sudip.
面頁冊數:	260 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-03, Section: B, page: 1525.
Contained By:	Dissertation Abstracts International67-03B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR13394
ISBN:	9780494133941

Adaptive algorithms for routing and traffic engineering in stochastic networks.
Misra, Sudip.

Adaptive algorithms for routing and traffic engineering in stochastic networks. - 260 p.

Source: Dissertation Abstracts International, Volume: 67-03, Section: B, page: 1525.

Thesis (Ph.D.)--Carleton University (Canada), 2006.

In this Thesis, we document the results of our investigation of four important problems in the domain of telecommunication network routing and traffic engineering. The techniques we use involve stochastic learning and Learning Automata (LA).

ISBN: 9780494133941Subjects--Topical Terms:

626642
Computer Science.

Adaptive algorithms for routing and traffic engineering in stochastic networks.
LDR:02436nmm 2200301 4500 001 1830237
005 20070413143119.5
008 130610s2006 eng d
020 $a 9780494133941
035 $a (UnM)AAINR13394
035 $a AAINR13394
040 $a UnM $c UnM
100 1 $a Misra, Sudip. $3 1002528
245 1 0 $a Adaptive algorithms for routing and traffic engineering in stochastic networks.
300 $a 260 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-03, Section: B, page: 1525.
502 $a Thesis (Ph.D.)--Carleton University (Canada), 2006.
520 $a In this Thesis, we document the results of our investigation of four important problems in the domain of telecommunication network routing and traffic engineering. The techniques we use involve stochastic learning and Learning Automata (LA).
520 $a Our first contribution consists of two efficient solutions for maintaining single-source shortest path routing trees in networks, where the weights of the links connecting the nodes of the network change continuously in a random manner following an unknown stochastic distribution.
520 $a In the second problem, we were interested in maintaining shortest paths between all pairs of nodes in a dynamically changing network. Again, for this problem, we have proposed two LA-based efficient solutions.
520 $a Our third contribution was in the area of QoS routing and traffic engineering in networks. More specifically, we have proposed an adaptive online routing algorithm that computes bandwidth-guaranteed paths in MPLS-based networks, using a Random-Race-based learning scheme that computes an optimal ordering of routes.
520 $a The last problem that we studied was that of designing routing schemes that would successfully operate in the presence of adversarial environments in Mobile Ad Hoc Networks (MANETs). The need for fault tolerant routing protocols for MANETS was identified recently by Xue and Nahrstedt, and in our research, we have proposed a new fault-tolerant routing scheme that uses a stochastic learning-based weak estimation procedure.
520 $a All our proposed solutions have been demonstrated to be superior to the state-of-the-art.
590 $a School code: 0040.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Carleton University (Canada). $3 1018407
773 0 $t Dissertation Abstracts International $g 67-03B.
790 $a 0040
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR13394