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 135 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. Enumerate Strongly Connected Components of Large-scale Graph with MapReduce | |||
Lu Lv,Lei Xie | |||
Computer Science and Technology 25 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Enumerating strongly connected components in directed graph is the fundamental problem of graph theory. The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize for large scale graph. In this paper, we propose a nearly linear parallel bi-directional label propagation algorithm to enumerate strongly connected components of large scale graph on MapReduce framework. The algorithm is suitable for large scale graphs and the experiment shows its efficiency and scalability. | |||
TO cite this article:Lu Lv,Lei Xie. Enumerate Strongly Connected Components of Large-scale Graph with MapReduce[OL].[25 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4502357 |
2. Design and Implementation of the HDFS-based Cloud Storage Encryption Access Network | |||
TANG Xiaoyang,WEN Qiaoyan | |||
Computer Science and Technology 24 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Cloud storage has advantageous characteristics of high reliability, high versatility, high scalability and high capacity. However, in terms of data privacy there are some anxious shortcomings which could not be ignored. Cloud storage users tend to worry about that the data saved in cloud storage may be malicious used by service providers, or when cloud storage service provider has been attacked, the data may be spied, stolen or tampered with. The HDFS-based Cloud Storage Encryption Access Network studied in this paper is designed for enterprise users to protect their data privacy from being invaded. It will sweep away the misgiving about data privacy problems, so as to make cloud storage service much more acceptable. | |||
TO cite this article:TANG Xiaoyang,WEN Qiaoyan. Design and Implementation of the HDFS-based Cloud Storage Encryption Access Network[OL].[24 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4506477 |
3. 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 |
4. Design of Multifunction Routing Sensor Based on Zigbee | |||
FAN Qingsong,HUANG Jianming | |||
Computer Science and Technology 18 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In the wireless sensor network area, the sensor network can change dynamically. Environmental factors may cause the instability of the wireless communication link.If a sensor lose connection with the network, the environmental data collected by it can not be sended to the network center. Reducing the number of nodes without lower the original system performance can reduce the probability of error in the entire network. This system is based on CC2430 and TI Zigbee stack and integrates the monitor functions with router. Because of reducing the number of nodes in the network, the wireless network stability is enhanced and the construction costs is reduced too.? | |||
TO cite this article:FAN Qingsong,HUANG Jianming. Design of Multifunction Routing Sensor Based on Zigbee[OL].[18 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4501024 |
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. Research and Implementation of a SAML-based SSO module | |||
GONG Zhenhua | |||
Computer Science and Technology 14 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Security Assertion Markup Language(a.k.a. SAML) is an XML framework for exchange of security-related information between the mutual trust two sides. It defines a mechanism for exchanging authentication and authorization information between different systems security service. Single sign-on technology(a.k.a SSO) is an effective method which integrates the service of authentication and authorization together. Through the analysis of traditional SSO technologies, this paper proposes a single sign-on enterprise-level module based on SAML, an effective solution to cross-domain systems and heterogeneous application platform with one time authentication and full access to the security information exchange. For further development work, we design and implement SAMLv2.0 protocol standards using PHP language. Based on the module we implement, we successfully complete of the entire the SAML network communication process, completely finished the functionalities of a SAML-based single sign-on module. This module has been integrated successfully into an e-commerce online system. | |||
TO cite this article:GONG Zhenhua. Research and Implementation of a SAML-based SSO module[OL].[14 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4502863 |
7. 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 |
8. Space Partitioned AFDX Switch Design Based on Shared Memory Architecture | |||
Hu Jingfei,Li Jian,Hu Fei | |||
Computer Science and Technology 30 November 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:As a new generation of aviation network communication standard, AFDX has been applied to the A380 and other large civil aircraft due to its advantages of full-duplex, high-bandwidth, low latency, low packet loss and low cost. Switches are key devices influencing the overall performance of an AFDX network. A shared memory architecture is widely used but this has imperfect reliability and scalability, because all the output ports share only one memory and one scheduler, which can lead to severe resource contention and scheduling latency. This article employs space partition techniques to isolate the memory space for each output port, and proposes a new space partitioned shared memory switch (SPSMS) architecture for AFDX networks. This architecture reduces the competition for resources and avoid conflicts, thereby decreasing the latency of packets through the switch. Simulation of the architecture with OPNET shows significant performance improvement over a classic shared memory switch in terms of switch overall packet latency, queuing delay and queue size. | |||
TO cite this article:Hu Jingfei,Li Jian,Hu Fei. Space Partitioned AFDX Switch Design Based on Shared Memory Architecture[OL].[30 November 2012] http://en.paper.edu.cn/en_releasepaper/content/4496819 |
9. 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 |
10. 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 |
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