Nianzu Liu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We propose a novel overlay routing infrastructure, namely Overlay-based Service Distribution Network(OSDN), which eliminates path inflation due to the inter-domain routing policy and could serve as a universal platform to convey various online services more efficiently. Its basic idea is to deploy overlay nodes at critical locations in the Internet such(More)
Pertinent to the preference of ranking algorithm of recent Community-Ranked Article Submission Sites, this paper gives a set of models of user preference classification and multi-threshold ranking algorithm based on Naive Bayes and thus provides a new ranking algorithm for similar Community-Ranked Article Submission Sites. The paper shows more reasonable(More)
We propose Overlay-based Service Distribution Network(OSDN) as a novel platform to convey service through overlay routing. We formulate the OSDN deployment problem in order to build an optimal overlay for a given set of connection demands but find the problem is NP-complete. To obtain a suboptimal solution, we first design a LASER algorithm to calculate all(More)
While a variety of routing algorithms have been invented for overlay networks, only a few studies focus on the placement problem of overlay nodes. However, the performance of overlay routing always depends on the routing policy of the underlying Internet, such as BGP routing. According to the BGP routing policy, the result routing path heavily depends on(More)
Several studies have shown that the BGP protocol adopts a special routing policy such that the default BGP route is usually not the best choice in terms of path length or quality of service. In order to send the traffic through the shortest AS paths by overlay routing, we have to place overlay nodes at several critical points along such paths. Otherwise,(More)
While multiple access links enhance the availability and utilization of multicast service nodes, the resource allocation balancing needs to be performed on a link basis, which is usually not considered in most overlay multicast routing algorithms. To accurately represent the bandwidth consumption of each overlay node, we need not only a multihomed proxy(More)
The information technology has brought great new challenges to the audit: the dynamical and timely audit is required to predict the audit fraud in advance; the data from different applications and locations of the enterprise is not easy to audit; the original documents will be destroyed after they are input into the computer system, which lead to the audit(More)
Compared with traditional IP Multicast, overlay multicast is not only flexible in functionality but also compatible with current network infrastructure. Therefore it is emerging as an effective solution for most group communications over the Internet. Affected by end-host overlay systems, the overlay multicast routing problem is studied under a single homed(More)
  • 1