%0 Journal Article
%T Research on Node-State Independence in Autonomous Systems with Limited Node Number<br>有限自治域网络节点状态独立性研究
%A WANG Chun-Fang
%A WANG Yu-Han
%A MA Zheng-Xin
%A LIU Xu-Ming
%A <br>王春芳
%A 王毓晗
%A 马正新
%A 刘序明
%J 软件学报
%D 2005
%I 
%X QoS routing based on node-delay information is an active research area these years. When delay is used as node state, it is often assumed that the state between each node is independent. Node-State independence assumption can provide a more tractable solution to delay constrained routing, especially when state information is Probability Density Function (PDF) of delay at each node. In this paper, the effectiveness of node-state independence assumption in Autonomous Systems with limited node number is investigated, and the conclusion is verified through vast simulation, whereas 60 link-delay PDFs and 15 path-delay PDFs in the network are observed. The 15 path-delay PDFs are also calculated by convolving the PDFs of contributing link-delays based on independence assumption. The statistical distance between the two sets of path-delay PDFs is measured by calculating divergence and comparing their delay expectation, variation and loss probability. Simulation and analysis results indicate that for Autonomous Systems with limited node number, node-state independence assumption is reasonable and path metrics calculated based on this assumption approximates well the original values and can be used in QoS routing.
%K node-state
%K node-delay
%K probability density function
%K independence assumption
%K divergence<br>节点状态
%K 节点延时
%K 概率密度函数
%K 独立性假设
%K 方向散度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=BA685FFEA1DAD9EC&yid=2DD7160C83D0ACED&vid=7801E6FC5AE9020C&iid=9CF7A0430CBB2DFD&sid=F6670E075D37D361&eid=E8D8D9C05584612B&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=19