"

開戸|礼唫【135e.cn】bo123彩票网官网✅顶级正规遊戏平台✅业内最顶尖原生APP,一站体验所有遊戏,bo123彩票网官网✅7*24H在线服务✅值得您信赖|期待您加入我们!

<acronym id="iaukw"></acronym>
<rt id="iaukw"><small id="iaukw"></small></rt>
<acronym id="iaukw"></acronym>
<acronym id="iaukw"></acronym>
<rt id="iaukw"></rt>
<acronym id="iaukw"><optgroup id="iaukw"></optgroup></acronym><rt id="iaukw"><center id="iaukw"></center></rt>
"
臺北商業大學特聘教授張肇明學術報告 11月25日下午
發布時間: 2019-11-21 訪問次數: 192

學術講座【A Protection Routing with Secure Mechanism in Networks】

時間:2019年11月25日 (星期一) 14:30 ~ 16:30

地點:旗山校區理工北樓601報告廳

主講:臺北商業大學特聘教授,張肇明

主辦:福建省分析數學及應用重點實驗室, 數學研究中心

參加對象:數信學院相關教師與研究生


報告人簡介: 張肇明,男,生于 1958 年臺灣臺北市。1987 年畢業于臺灣中國文化大學應用數學系,獲頒理學士學位。 1992 年畢業于臺灣新竹交通大學資訊管理研究所,獲頒碩士學位。 2001 年畢業于臺灣桃園中央大學資訊工程研究所,獲頒博士學位。目前,任教于臺北商業大學資訊與決策科學研究所,擔任特聘教授一職,并于 2011  2013 年擔任研究所所長,2014 2015年擔任臺北商業大學管理學院院長。同時,也兼任「演算法與計算理論學會」理事一職。到目前為止,已經連續 18  () 獲得臺灣科技部 (前國科會) 專題研究計畫主持人。其中,包括 3 個兩年期計畫與 3 個三年期計畫。另外,于 2012  2013 年獲得臺灣教育部補助技專校院建立特色典范計畫,擔任臺北商業大學總計畫主持人。在學術研究上,曾任許多國際學術期刊審稿人與國際學術會議特定議程委員會委員,并發表 80 余篇 SCI 收錄期刊論文與 90 余篇研討會論文。目前,主要的研究領域包括算法設計與分析、圖論、平行與分散式計算等主題。


報告摘要:Kwong et al. (2011) proposed a reactive routing scheme using the multi-paths technique for integrating two mechanisms of route discovery and route maintenance in intra-domain IP networks. They further defined a route to be a protection routing if there is a loop-free alternate path for packet forwarding when a single failed component (including link or node) occurs. Later on, Tapolcai (2013) showed that a network possessing two completely independent spanning trees (CISTs for short) suffices to configure a protection routing. A set of k (k>1) spanning trees in a network is called CISTs if they are pairwise edge-disjoint and inner-node-disjoint. Particularly, if k=2, such a set of CISTs is called a dual-CIST. In the early stage, Hasunuma (2002) already pointed out that the problem of determining whether there exists a dual-CIST in a graph is NP-complete. This talk includes the following topics:

  (1) We show how to construct three CISTs in a network with connectivity at most 6 by a two-stages tree-searching algorithm. In particular, we demonstrate the case in a kind of hypercube-variant networks, called crossed cubes.

  (2) We show how to configure a routing scheme called secure-protection routing as an application of CISTs such that the routing is not only protected but also secure (i.e., no other node except the destination in the network can receive the complete message).

  (3) We provide simulation results to show the performance evaluation of the proposed routing.



bo123彩票网官网 <acronym id="iaukw"></acronym>
<rt id="iaukw"><small id="iaukw"></small></rt>
<acronym id="iaukw"></acronym>
<acronym id="iaukw"></acronym>
<rt id="iaukw"></rt>
<acronym id="iaukw"><optgroup id="iaukw"></optgroup></acronym><rt id="iaukw"><center id="iaukw"></center></rt>