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 27 papers published in subject: > since this site started. |
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. HTTP-based Real-time Information Communication Method in the High Load Situation | |||
Wang Zhongwei,Song Zheng | |||
Computer Science and Technology 20 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This thesis puts forward a real-time communication method which transmits information between the clients and the servers. The method is applied to access servers with high concurrency of a large number of clients and highly loaded servers with a high demand on the real-time communication. Integrated with the advantages of three real-time communication technologies and based on the HTTP protocol, this method connects long links and short links, applies asynchronous polling to clients and sets up cache requesting queue on serves. It's been tested that this method can balance the various performance indicators well in the above-mentioned. | |||
TO cite this article:Wang Zhongwei,Song Zheng. HTTP-based Real-time Information Communication Method in the High Load Situation[OL].[20 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4501027 |
2. The Study of Traffic Classification Methods Based on C4.5 Algorithm | |||
FU Li,TANG Bihua,YUAN Dongming | |||
Computer Science and Technology 11 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Traffic classification is an important research area in networking security and Internet monitoring fields, while the classification approaches based on machine learning have become a research hotspot as the traditional approaches lose effectiveness since the new applications mushroom on the Internet. In the common machine learning classification approaches, C4.5 algorithm has an obvious advantage both in classification accuracy and time complexity over other algorithms. In this paper, five classifiers based on C4.5 are implemented with different feature selection which revealed the relationship between the number of features and the real-time quality of the classifier. Among the five classifiers, the 11-feature model can correctly identify 99.54% of the instances, which is better than the all-feature model and it takes much less time to finish the classification. The result of this paper provides a reference in the implements of traffic classification applications, especially to enhance the real-time quality of a traffic classifier. | |||
TO cite this article:FU Li,TANG Bihua,YUAN Dongming. The Study of Traffic Classification Methods Based on C4.5 Algorithm[OL].[11 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4502612 |
3. A grey model based prediction of the popular BGP prefixes | |||
ZHANG Wei | |||
Computer Science and Technology 22 August 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Internet core routers are facing challenges brought by the ever-increasing transit bandwidth and routing scale. In order to meet the requirements of highly efficient packet forwarding, some solutions propose to load a small portion of the BGP RIB entries into the FIB. Therefore the most popular prefixes, which contribute major traffic loads, need to be cached in the FIB as long as possible. In this paper, we try to propose a prediction based method to cache those popular prefixes in the FIB. The cache strategy is guided by the traffic prediction of a grey model. We also apply FIB aggregation techniques to suppress the number of overlapped sub-prefixes of the popular prefixes on cache/route updates. We evaluate our method with real traffic traces and find that our prediction-based cache replacement strategy outperforms other cache strategies and matches Internet traffic dynamics very well. | |||
TO cite this article:ZHANG Wei. A grey model based prediction of the popular BGP prefixes[OL].[22 August 2012] http://en.paper.edu.cn/en_releasepaper/content/4487506 |
4. Modeling the Internet Routing Scalability: From Qualitative Description to Quantitative Evaluation | |||
ZHANG Wei | |||
Computer Science and Technology 22 August 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The Internet has been growing rapidly during the past few decades. Its routing system may encounter scalability problem as the size of Internet keeps growing. The Internet Research Task Force (IRTF) highlighted this issue lately and inspired many proposals that attempt to address this problem. However, those proposals do not reach a consensus on a fruitful solution. Instead of presenting another new proposal, this paper deals with specification, analysis and evaluation of the routing scaling of the Internet. The qualitative analysis in this paper reveals gains and losses of different techniques that aim to improve the scalability of the Internet routing system. In particular, the analysis focuses on techniques of route aggregation, forwarding information base (FIB) compression and route cache mechanism, which correspond to tradeoffs between routing scaling and engineering considerations on the functioning, overhead and performance of the routing system respectively. Based on understanding of these tradeoffs, we apply the Analytic Hierarchy Process (AHP) to develop a quantitative evaluation framework that can evaluate alternative routing schemes. This modeling tool can systematically capture various evaluation criteria, where each routing scheme leads to quantified gains and losses under given evaluation criteria. | |||
TO cite this article:ZHANG Wei. Modeling the Internet Routing Scalability: From Qualitative Description to Quantitative Evaluation[OL].[22 August 2012] http://en.paper.edu.cn/en_releasepaper/content/4486117 |
5. Implement Alternate Inter-domain Routing with Global Path Service | |||
Zhang Wei,Bi Jun | |||
Computer Science and Technology 22 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper introduces a new inter-domain routing scheme based on a centralized routing service: Global Path Service (GPS). This routing service provides alternate inter-AS paths different to ordinary BGP routes. This scheme facilitates diversified inter-AS forwarding paths through GPS-enabled ASes offering their inter-domain transit tunnels (e.g. MPLS). A GPS center concatenates those transit tunnels into available GPS paths. This routing scheme facilitates a kind of diversified source routing at the AS-level. When a packet needs to be forwarded, the local router queries the GPS routing service to obtain a Path ID which will serve as a kind of source routing primitive. The packet will be routed based on this path ID from AS to AS, using tunnels to cross intermediate ASes on the given path. This paper illustrates a framework to implement the infrastructure of diversified routing. This infrastructure should allow for novel inter-domain routing services, such as inter-domain Quality of Service (QoS) or multipath routing. We evaluate the availability, scalability and path diversity of the GPS service by simulations. | |||
TO cite this article:Zhang Wei,Bi Jun. Implement Alternate Inter-domain Routing with Global Path Service[OL].[22 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4462960 |
6. Hybrid mapping service for the separation solutions of routing scalability | |||
WANG Yangyang,JUN Bi | |||
Computer Science and Technology 15 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In recent years, the global routing table size grows rapidly. The scalability of routing and addressing of Internet is concerned by network operators and research community. Among these proposed solutions, core-edge separation mechanism, represented by LISP are more acceptable than others. Mapping between globally routable IP addresses and destination IP addresses of edge network is the key component of these solutions. Although many mapping system have been proposed, their construction and maintenance is complicated, and have little incentive for deployment. In this paper, we present a practical approach to provide mapping service. This approach is a hybrid structure. Mapping servers are distributed and autonomous in regional network, and are connected together via extending DNS infrastructure and constructing an overlay network. It is easier to be deployed increasingly. | |||
TO cite this article:WANG Yangyang,JUN Bi. Hybrid mapping service for the separation solutions of routing scalability[OL].[15 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4462370 |
7. A Distributed and Autonomic Resource Management Mechanism in Network Virtualization | |||
Wenfeng Zhao,Xuesong Qiu | |||
Computer Science and Technology 22 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In recent years, network virtualization has been proposed as a long-term solution to the gradual ossification problem faced by the current Internet and a harbinger of future network. By allowing multiple heterogeneous network architectures to cohabit on a shared physical substrate, network virtualization provides flexibility, increased manageability, promotes diversity and promises security. One major challenge on network virtualization is the resource management of substrate networks. The exiting research are mostly focus on design algorithms for mapping virtual networks to a substrate networks, but neglect maximizing the resource utilization dynamically in a constantly changing substrate network environment. In this paper, we propose a distributed autonomic resource management mechanism to optimize the substrate network resources. In this mechanism, cooperative work agent running in each substrate node can manage resource in the substrate network dynamically. The simulation shows that our mechanism brings considerable benefit in resource utilization. | |||
TO cite this article:Wenfeng Zhao,Xuesong Qiu. A Distributed and Autonomic Resource Management Mechanism in Network Virtualization[OL].[22 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4456567 |
8. Testing of Parallel Parameterized Extended Finite State Machines with Dependence on External Variables | |||
Yao Jiangyuan ,Zhiliang Wang,Xia Yin,Jianping Wu | |||
Computer Science and Technology 28 November 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The status of research on model-based testing mainly focus on the model with single component, such as FSM and EFSM. But in some protocols, parallel components with external dependence on variables of other components maybe exist. It is infeasible to precisely specify such protocol by single model. In this paper we extend the Extended Finite State Machine with external variables to form our new model, Parallel Parameterized Extended Finite State Machine (PaP-EFSM), and describe a protocol by a set of PaP-EFSMs. Then we present an approach for tests generation from the new models. Our methodology first use EFSM testing method with minor modifications to generate test sequences for each machine, then we take into account transitions which use external variables or define variables which are used in other machines, and generating final test cases. We apply this method to the conformance testing of Source Address Validation Improvements (SAVI) protocols. A set of PaP-EFSMs are built, there group of test sequences are derived and applied on the 10 devices from 4 manufacturers. Many implement faults are exposed. | |||
TO cite this article:Yao Jiangyuan ,Zhiliang Wang,Xia Yin, et al. Testing of Parallel Parameterized Extended Finite State Machines with Dependence on External Variables[OL].[28 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4452438 |
9. HTTP-session model and its application in the anomaly HTTP traffic detection | |||
Yi Xie | |||
Computer Science and Technology 11 October 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Different from most existing studies on Web session identification for commerce purposes, a novel dynamic realtime HTTP-session processes description method is presented in this paper for detecting the anomaly HTTP traffic for network boundary. The proposed scheme doesn't rely on presupposed threshold and client/server-side data which are widely used in traditional session detection approaches. A new parameter is defined based on inter-arrival time of HTTP requests. A nonlinear algorithm is introduced for quantization. Trained by the quantized sequences, nonparametric hidden Markov model with explicit state duration is applied to cluster and scout the HTTP-session processes. A probability function is derived for predicting HTTP-session processes. The deviation between the prediction result and the real observation is used for sham Web behavior detection. Experiments based on real HTTP traces of large-scale Web proxies are implemented to valid the proposal. | |||
TO cite this article:Yi Xie. HTTP-session model and its application in the anomaly HTTP traffic detection[OL].[11 October 2011] http://en.paper.edu.cn/en_releasepaper/content/4445505 |
10. Research on Algorithms about Conformance Test Sequences | |||
Hu Xiaoling,Gao Zhanchun | |||
Computer Science and Technology 04 January 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The key issue in protocol conformance test is generating test sequence. This paper proposes a completed heuristic algorithm that automatically generates test sequence using UIO and BUIO. Also a method adaptive to the previous algorithm is put forward to generate BUIO. By using partly equality relation between UIO and BUIO, algorithm of generating BUIO is simplified. Apply both the algorithm proposed and algorithm based on Rural Chinese Postman Algorithm and UIO sequences to Protocol ECMA-264 and compare the complexity of two test sequences. | |||
TO cite this article:Hu Xiaoling,Gao Zhanchun. Research on Algorithms about Conformance Test Sequences[OL].[ 4 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4401769 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated