Select Subject

All (8828)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

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. Reducing Web Latency with Coding-Based Fast Multi-Path Loss Recovery
	LIU Yi,CHEN Guo
	Computer Science and Technology 14 May 2020
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:TCP latency is critical to the performance of web services. However, packet loss greatly impairs the TCP performance due to its poor loss recovery mechanisms. Recent work FUSO addressed this problem by leveraging multi-path diversity for proactive loss recovery, it used "good" paths to proactively retransmit the potentially lost packet on "bad" paths. However, because it's impossible to predict which packet is truly lost, FUSO tended to retransmit the oldest unACKed packet. Through analysis and comprehensive experiments, this paper shows that in the Internet scenario, such simple proactive retransmission of the oldest unACKed packet is not accurate enough to recover the lost packets, which causes performance penalty. To address the problem, this paper presents \name, a \fullname. Different from FUSO, when there is a chance for proactive loss recovery, \name generates a coding packet that codes all (or multiple) unACKed packets together. As such, \name can always proactively retransmit the ``right'' lost packet, since the receiver side can decode the lost packet by combining the coding packet with other received packets. \name is implemented in Linux kernel with \approx2K lines of code.Testbed and simulation results show that, under lossy condition, \name can greatly decrease the average and $99^{th}$ percentile flow completion time (FCT) by \approx12\% and \approx59\% in the testbed, and up to \approx16.9\% and \approx54.5\% in the simulation, respectively.
	TO cite this article:LIU Yi,CHEN Guo. Reducing Web Latency with Coding-Based Fast Multi-Path Loss Recovery[OL].[14 May 2020] http://en.paper.edu.cn/en_releasepaper/content/4752040


	2. GranuleJ: A Context Check-based Programming Language for Flexible Runtime Adaptation
	ZENG Qing-Hua, ZHAO Yin-Liang, SUN Li-Yu, WU Wen-Bin
	Computer Science and Technology 18 December 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:\renewcommand{\raggedright}{\leftskip=0pt \rightskip=0pt plus 0cm}\raggedrightModern applications tend to increasingly suffer from unpredicted context changes that may occur at any moment during the program execution, so it is urgently needed to adapt their behaviors to such frequently changing contexts dynamically. From the perspective of language-level, language extension is an efficient and prompt approach to conduct those adaptable applications. However, the existing context-based languages can only provide anticipated adaptation which is usually predefined at the initial design time, and they also lack appropriate programming language abstractions of dynamic flavor to support context uncertainty at runtime. In this paper, we present a novel programming language called \emph{GranuleJ}, which enables implicit context checks to be aware of the adaptation of the program and carry out program evolution when the program is no longer satisfied with the current context. GranuleJ introduces \emph{context variable} to identify context changes clearly, \emph{fitness tests} to detect the adaptation points where unsuitable program behaviors happen relying on context variables and \emph{granules} that modularize behavior variations as reuse building blocks to be freely assembled or disassembled at runtime. We have already implemented the language framework of GranuleJ and validated the feasibility and effectiveness of it through performance evaluation.
	TO cite this article:ZENG Qing-Hua, ZHAO Yin-Liang, SUN Li-Yu, et al. GranuleJ: A Context Check-based Programming Language for Flexible Runtime Adaptation[OL].[18 December 2017] http://en.paper.edu.cn/en_releasepaper/content/4742867


	3. SLA-aware Energy-efficient Scheduling Scheme for Hadoop YARN
	LI Ping,JU Lei,JIA Zhiping
	Computer Science and Technology 08 June 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Apache Hadoop becomes ubiquitous for cloud computing which provide resources as services for multi-tenant applications. YARN (a.k.a. MapReduce 2.0) is one of the key feature in the second-generation Hadoop, which provides resource management and scheduling for large scale MapReduce environments. Two enormous challenges in the YARN scheduler are the abilities to automatically tailor and control resource allocations to different jobs for achieving their Service Level Agreements (SLAs), and minimize energy consumption of the overall cloud computing system. In this work, we propose an SLA-aware energy-efficient scheduling scheme which allocates appropriate amount of resources to MapReduce applications with YARN architecture. We perform job profiling to obtain the performance characteristics for different phases of a MapReduce application, which will be considered during resource provisioning in order to meet the completion deadlines specified by the application's SLA. Furthermore, an online userspace governor based dynamic voltage and frequency scaling (DVFS) scheme is designed in the YARN per-application ApplicationMaster to dynamically change the CPU frequency for upcoming tasks given the slack time between the actual execution time of completed tasks and expected completion time of the application. Experimental evaluation shows that our proposed scheme is both resource and energy efficient compared with the existing MapReduce scheduling policies.
	TO cite this article:LI Ping,JU Lei,JIA Zhiping. SLA-aware Energy-efficient Scheduling Scheme for Hadoop YARN[OL].[ 8 June 2015] http://en.paper.edu.cn/en_releasepaper/content/4645579


	4. 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


	5. Protocol Security Testing with SPIN and TTCN-3
	Zhou Li,Wang Zhiliang,Yin Xia
	Computer Science and Technology 14 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Protocol security testing is an important technique to ensure the security of communication protocols. However, methods considering both effective detection to specification vulnerabilities and efficient testing on protocol implementations are not well developed. In this paper, we present a general method for protocol security testing including protocol verification with SPIN model checker and protocol testing with formal testing language TTCN-3. We use threat model to model malicious entities and import the classification of information security to achieve a complete analysis of security requirements for protocol verification. We also develop a SPIN Trail to TTCN-3(st2ttcn) convention tool to generate testcases automatically from counter examples obtained from model checking. As a case study, we apply our approach to the security testing of Source Address Validation Improvements (SAVI) protocol. We test two versions of SAVI-DHCP protocol. The result indicates that our method is effective and efficient.
	TO cite this article:Zhou Li,Wang Zhiliang,Yin Xia. Protocol Security Testing with SPIN and TTCN-3[OL].[14 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4396471


	6. Location-aware Routing for Pocket Switched Networks
	Ye Tian,Jiang Li
	Computer Science and Technology 26 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we seek to understand the reasons causing failures and delays of message delivery in Pocket Switched Networks (PSN), and to use this understanding for improving the network. By studying two real-world datasets, we find that node isolation is prevalent in PSN networks, which largely accounts for the inefficiencies in message delivery. In addition, by analyzing nodes’ contact-location relationship, we find that individual and system-wide key locations exist and their existence suggests potential improvements in message routing. Motivated by our observation, we design a location assisted routing scheme for PSN networks. With simulation-based experiments using real-world and synthetic contact traces, we compare the proposal with other representative routing schemes, and show that with the awareness of the location information, the proposed solution could deliver more messages within shorter delays, thus improves the network remarkably.
	TO cite this article:Ye Tian,Jiang Li. Location-aware Routing for Pocket Switched Networks[OL].[26 January 2010] http://en.paper.edu.cn/en_releasepaper/content/39480


	7. Energy-Efficient Time Synchronization Algorithm for Wireless Sensor Networks
	Wu Wanrong ,Wang Qianping ,Wang Wei ,Su Yu-e ,Hao Li
	Computer Science and Technology 11 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In wireless sensor networks, energy efficiency is an important standard for evaluating the effectiveness of the time synchronization protocols. Hence, energy should be conserved as much as possible provided that algorithm can achieve a certain accuracy. In this paper, we propose an energy efficient time synchronization algorithm in which each layer of the network can be synchronized merely by receiving broadcast messages rather than relying on two-way message exchange. Simulation result shows that our improved strategy reduced the energy consumption and prolonged the lifetime of network compared with TPSN
	TO cite this article:Wu Wanrong ,Wang Qianping ,Wang Wei , et al. Energy-Efficient Time Synchronization Algorithm for Wireless Sensor Networks[OL].[11 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35128

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Third-level Subject

Computer Network(89)
Computer System Design(5)
Distributed Processing Sy...(9)
Other Subjects of Compute...(3)
Parallel Processing(11)
Run Test and Performance ...(2)

Rank

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item