P2P systems are categorized into tree-based and mesh-based systems according to their topologies. Mesh-based systems are considered more suitable for large-scale lnternet applications, but require optimization on late...P2P systems are categorized into tree-based and mesh-based systems according to their topologies. Mesh-based systems are considered more suitable for large-scale lnternet applications, but require optimization on latency issue. This paper proposes a content subscribing mechanism （CSM） to eliminate unnecessary time delays during data relaying. A node can send content data to its neighbors as soon as it receives the data segment. No additional time is taken during the interactive stages prior to data segment transmission of streaming content. CSM consists of three steps. First, every node records its historical segments latency, and adopts gamma distribution, which possesses powerful expression ability, to express latency statistics. Second, a node predicts subscribing success ratio of every neighbor by comparing the gamma distribution parameters of the node and its neighbors before selecting a neighbor node to subscribe a data segment. The above steps would not increase latency as they are executed before the data segments are ready at the neighbor nodes. Finally, the node, which was subscribed to, sends the subscribed data segment to the subscriber immediately when it has the data segment. Experiments show that CSM significantly reduces the content data transmission latency.展开更多
For a transient Bessel process X let I(t) = in fs＞tX(s) and§(t) = inf{u≥ 2 t: X(u) = I(t)}. In this note we compute the joint distribution of I(t),§(t) and Xt.
We study the distributed Kalman filtering problem in relative sensing networks with rigorous analysis.The relative sensing network is modeled by an undirected graph while nodes in this network are running homogeneous ...We study the distributed Kalman filtering problem in relative sensing networks with rigorous analysis.The relative sensing network is modeled by an undirected graph while nodes in this network are running homogeneous dynamical models. The sufficient and necessary condition for the observability of the whole system is given with detailed proof. By local information and measurement communication, we design a novel distributed suboptimal estimator based on the Kalman filtering technique for comparison with a centralized optimal estimator. We present sufficient conditions for its convergence with respect to the topology of the network and the numerical solutions of n linear matrix inequality（LMI） equations combining system parameters. Finally, we perform several numerical simulations to verify the effectiveness of the given algorithms.展开更多
基金the National Natural Science Foundation of China (Nos. 60533090 and 60525108)the National Basic research Program (973) of China (No. 2002CB312101)+2 种基金the China-US Million Book Digital Library Project (www.cadal.zju.edu.cn)the Science and Technology Project of Zhejiang Province (Nos. 2005C13032 and 2005C11001-05)the Research Project of Education Department of Zhejiang Province (No. 20061352), China
文摘P2P systems are categorized into tree-based and mesh-based systems according to their topologies. Mesh-based systems are considered more suitable for large-scale lnternet applications, but require optimization on latency issue. This paper proposes a content subscribing mechanism （CSM） to eliminate unnecessary time delays during data relaying. A node can send content data to its neighbors as soon as it receives the data segment. No additional time is taken during the interactive stages prior to data segment transmission of streaming content. CSM consists of three steps. First, every node records its historical segments latency, and adopts gamma distribution, which possesses powerful expression ability, to express latency statistics. Second, a node predicts subscribing success ratio of every neighbor by comparing the gamma distribution parameters of the node and its neighbors before selecting a neighbor node to subscribe a data segment. The above steps would not increase latency as they are executed before the data segments are ready at the neighbor nodes. Finally, the node, which was subscribed to, sends the subscribed data segment to the subscriber immediately when it has the data segment. Experiments show that CSM significantly reduces the content data transmission latency.
基金Supported by National Natural Science Foundation of China (19801020)
文摘For a transient Bessel process X let I(t) = in fs＞tX(s) and§(t) = inf{u≥ 2 t: X(u) = I(t)}. In this note we compute the joint distribution of I(t),§(t) and Xt.
基金supported by the National Natural Science Foundation of China(No.61503335)the Key Laboratory of System Control and Information Processing,China(No.Scip201504)
文摘We study the distributed Kalman filtering problem in relative sensing networks with rigorous analysis.The relative sensing network is modeled by an undirected graph while nodes in this network are running homogeneous dynamical models. The sufficient and necessary condition for the observability of the whole system is given with detailed proof. By local information and measurement communication, we design a novel distributed suboptimal estimator based on the Kalman filtering technique for comparison with a centralized optimal estimator. We present sufficient conditions for its convergence with respect to the topology of the network and the numerical solutions of n linear matrix inequality（LMI） equations combining system parameters. Finally, we perform several numerical simulations to verify the effectiveness of the given algorithms.
