Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 10 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. An uncoupled and lightweight Virtualized Network Function Controller | |||
LI Kai,Wang Chun | |||
Computer Science and Technology 24 January 2019 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:NFV (Network Function Virtualization) is a powerful emerging technique with widespread applicability. In this paper, we propose a creative solution to decouple the strong coupling relationship between VNF (Virtualized Network Function) and VNFM (Virtualized Network Function Manager) in the current NFV practice. Our solution is to design a VNFC (Virtualized Network Function Controller). It can quickly automate the deployment of VNF into the Docker container and can use the improved compression algorithm to achieve fast inter-node migration of VNF. We have experimentally proved that Docker\'s performance can be improved by 3 to 4 times compared with VM and the improved compression algorithm can effectively improve the compression ratio. | |||
TO cite this article:LI Kai,Wang Chun. An uncoupled and lightweight Virtualized Network Function Controller[OL].[24 January 2019] http://en.paper.edu.cn/en_releasepaper/content/4747144 |
2. Integrating the local network structure and router performance for better routing stratege | |||
Chen Zhaoyin | |||
Computer Science and Technology 17 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Network capacity and average travel distance of data packets are two key measurements to reflect the efficiency of traffic routing strategy. Network structure and routing strategy are the main factors determining the network performance. Previous study shows that the Internet topology has both scale-free and small-world features. In this paper we study information packet routing process on scale-free networks by mimicking the Internet traffic delivery strategies. We propose a routing strategy integrating the network structure characteristic and router processing ability. We first model the network by presenting the relationship between network capacity and network topology, router processing ability including transmission rate and buffer size. We find that congestions are more susceptible to occur in the nodes with both large betweenness centrality and low router processing ability. Instead of only using the information of degree and betweenness centrality, the new algorithm is derived on both the betweenness centrality and router processing ability. Simulation results suggest that the integrated routing strategy is more efficient in terms of the network capacity and average packet travel distance than SP and MD routing strategy. | |||
TO cite this article:Chen Zhaoyin. Integrating the local network structure and router performance for better routing stratege[OL].[17 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4624131 |
3. A TLV Structure Semantic Constraints based Method for Reverse Engineering Protocol Packet Formats | |||
He Lian,Wen Qianyan,Zhang Zhao | |||
Computer Science and Technology 24 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:mining unknown protocol packet formats is a very effective way to improve network security, especially in promoting the accuracy of network fuzz test. However, researches reverse engineering unknown protocol packets mostly depend on manual analysis, which is extremely time consuming and low efficiency. In this paper, we proposed a new method to infer the unknown protocol packet formats automatically. This method could infer the potential TLV fields and extract protocol format with low time consuming. First we define a threshold value for the sum of tag field types. Then we increase the value of a variable standing for the length of a tag filed until the type number of this tag fields reaches the threshold. After the tag filed is obtained, we can easily get the length field and the value field next to it. Run this process on the value field recursively, and we could finally get the whole structure of packet formats. In order to demonstrate the effectiveness, we applied our methods on the Get-Request packets of SNMP. As a result, almost 90% of the TLV structures of packets are extracted, at the same time, the field of Get-Request Id is also inferred successfully | |||
TO cite this article:He Lian,Wen Qianyan,Zhang Zhao. A TLV Structure Semantic Constraints based Method for Reverse Engineering Protocol Packet Formats[OL].[24 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4575830 |
4. TrafficS:A Behavior-based Network Traffic Classification Benchmark System with Traffic Sampling Functionality | |||
Xiaoyan Yan,Liang Bo,Ban Tao,Guo shanqing,Wang Liming | |||
Computer Science and Technology 28 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In recent years, there have been many methods proposed to perform network traffic classification based on application protocols. Still, there is a pressing need for a practical tool to benchmark the performance of these approaches in real-world high-performance network environments. In this paper, based on rigorous requirements analysis on real-world environments, we present a real-time traffic classification benchmark system, termed TrafficS, which aims at easy performance-evaluation between different intelligent methods. TrafficS is not only extensible to incorporate multiple traffic classification engines but supports different packet/stream sampling techniques as well. Furthermore, it could provide users a comprehensive means to perceive the difference between inspected methods in various aspects. | |||
TO cite this article:Xiaoyan Yan,Liang Bo,Ban Tao, et al. TrafficS:A Behavior-based Network Traffic Classification Benchmark System with Traffic Sampling Functionality[OL].[28 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4504910 |
5. Contention-free Scheduling for Safety-critical Tasks in AFDX Network | |||
WANG Weizhen, LI Jian, Hu Fei | |||
Computer Science and Technology 14 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:AFDX is an emerging avionics bus for next generation aircraft. It is based on IEEE 802.3 Ethernet technology and utilizes commercial off-the-shelf (COTS) components. The delay performance is one of the main aspects of aviation network design, but the currently research about the end-to-end delay analysis for an AFDX data network is very pessimistic due to provisioning for the worst-case. This article focuses on improving the AFDX end-to-end delay performance. With stricter constraints on AFDX, a scheduling algorithm is designed to guarantee that critical tasks are conflict-free, it combines binary search with a worst match algorithm based on pinwheel to separate the start time of every safety-critical task. Due to this, the end-to-end delay for safety-critical tasks is shorter and the performance can be improved. A simulation is built and the result proves that the end-to-end delay performance is improved and our solution is useful. | |||
TO cite this article:WANG Weizhen, LI Jian, Hu Fei. Contention-free Scheduling for Safety-critical Tasks in AFDX Network[OL].[14 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4503067 |
6. MRS: A Click-based Multipath Routing Simulator | |||
Liang Jiao,Donghong Qin,Jiahai Yang,Liansheng Ge | |||
Computer Science and Technology 03 April 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The ability to forward traffic on multiple paths would be useful for customizing paths for different applications, improving reliability and balancing load. In order to evaluate the behaviour and performance of multipath routing protocols both simulators and test bed are often used. The simulator is used in the first stages and the test bed is used in the final stages of the development process. However, when moving from simulation to test bed, source code usually needs to be re-implemented. In this paper, we present MRS to address these issues. It was constructed by embedding the Click Modular Router inside of the NS2 simulator. The source code with MRS may run on an actual system as well as under a simulator with minor modifications. We implement a multipath routing protocol called AMIR in MRS. Simulation results show that MRS is a useful and effective tool for evaluating multipath routing protocols. The results also indicate that multipath routing has a greater advantage in improving network performance than single-path routing. | |||
TO cite this article:Liang Jiao,Donghong Qin,Jiahai Yang, et al. MRS: A Click-based Multipath Routing Simulator[OL].[ 3 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4472717 |
7. Measuring Google CDN: locating data centers and evaluating delay performance | |||
Xu Dan | |||
Computer Science and Technology 10 January 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Content distribution network (CDN) is a system designed to reduce the bandwidth costs, increase global availability of content and improve end user performance. The famous internet search company Google has established his own CDN to transmit most of his traffic over the internet. In this paper we conduct extensive measurement of Google CDN. The purpose of our measurement is to locate Google data centers in the worldwide and further evaluate and analyze the delay performance of Google CDN. Based our measurement, we firstly try to find out all the content servers of Google CDN and present a novel approach to cluster these content servers into several data centers. Then we evaluate the delay performance from four different service type of Google CDN and give some observations of Google CDN's response strategy to the client's request. | |||
TO cite this article:Xu Dan. Measuring Google CDN: locating data centers and evaluating delay performance[OL].[10 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4405704 |
8. An Improvement of the Route Discovery Process in AODV for Ad Hoc Network | |||
Yongjun Hu,Junliang Shen | |||
Computer Science and Technology 03 November 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Ad hoc networks are composed of a set of mobile and wireless nodes. They have several characteristics such as being self-organized, dynamically changing topology and multi-hop connectivity. Ad-Hoc On-Demand Distance Vector Routing (AODV) is one of the most widely researched on-demand ad hoc routing protocols. An improvement of the route discovery process in AODV (IMAODV) is proposed to decrease the delay and the routing overload in this paper. The performance of IMAODV is compared with AODV in terms of routing load and average end-to-end delay. The simulation results show that IMAODV has less the average end-to-end delay and the routing load than AODV in the network. | |||
TO cite this article:Yongjun Hu,Junliang Shen. An Improvement of the Route Discovery Process in AODV for Ad Hoc Network[OL].[ 3 November 2009] http://en.paper.edu.cn/en_releasepaper/content/36374 |
9. DHT based context information disseminating method in autonomic network | |||
WangHao | |||
Computer Science and Technology 11 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In autonomic network, context information given by monitor is the main foundation of decision. In order to make good use of network context information, the dissemination sub-system is needed to be scalable (support large scale of autonomic network) and distributed(deal with issue of single point of failure). In response to these demands, we propose a method to construct a context information dissemination model based on DHT. In our targeted application, an overlay network is built upon the lower network consist of autonomic nodes. The context information can be published and located using DHT lookup mechanism in the structured distributed network environment. To deal with the mismatch between the overlay-level network and physical network, we present a self-adjust scheme to reduce the lookup routing latency during the process agents apply for the context information. In the strategy, we aim to make node themselves adjust node identifiers in a geographically manner. This self-adjust operation only takes place when the autonomic node access to DHT overlay network. | |||
TO cite this article:WangHao. DHT based context information disseminating method in autonomic network[OL].[11 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28818 |
10. A New Algorithm for Web User Categorization | |||
Yong-Xian WANG | |||
Computer Science and Technology 29 December 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Behavior and characterization of users is an important issue in the design and maintenance of websites. Analysis of the Web access logs can offer deep comprehension to the Web usage and facilitate the Web personalization. This paper presents a method for Web user categorization from Web log files. A link graph is constructed firstly after the data cleaning and transaction identification with original Web log data. The similarity between two pages in the link graph are defined which is based on the page link information and by merging the similar pages into a page class the link graph is compressed. Finally we use the FDOD, a measure of discrepancy between ordered sequences, to categorize the link paths into several classes. The experiments on an actual Web site log data are tested and the results indicate that the approach proposed have advantages of easy-to-use, fast-response and good accuracy. | |||
TO cite this article:Yong-Xian WANG. A New Algorithm for Web User Categorization[OL].[29 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4739 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated