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.

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.


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


	2. Weighted Load Balancing in Datacenter Networks
	XU Xiuting, LIU Libin, LI Jinglin
	Computer Science and Technology 04 December 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Load balancing in datacenter networks needs to cope with many issues, such as various workloads, dynamic network conditions, and topology asymmetry. However, previous works cannot handle them well and are not practical to be deployed in production datacenters. Hash-based load balancing solutions like ECMP can result in low throughput and long-tailed flow completion time because of hash collisions. Congestion-aware solutions such as CONGA and Expeditus can detect network congestions proactively. Unfortunately, they need dedicated hardware support and cannot be widely deployed in commodity datacenters. Although host-based solutions such as Presto and DRB remedy the shorcomings of congestion-ware ones, they are oblivious to network conditions. To do efficient load balance in commodity datacenter networks, this paper proposes \name, a weighted network load balancer located at each hypervisor that can detect network conditions and require no changes to network hardware switches. \name employs ECN to monitor the network congestions and detect failures via counting connection timeout and packet retransmission rate. It then automatically adjusts path weights accordingly to react to congestions and failures and does weighted load balancing at the granularity of flowcells. \name has been implemented on our testbed and evaluated with testbed experiments and simulations. The results show that \name achieves near-optimal performance in symmetric topology. Under failure or asymmetric scenarios, \name can shorten at least 2.3 times and 1.2 times FCT compared to ECMP and Presto.
	TO cite this article:XU Xiuting, LIU Libin, LI Jinglin. Weighted Load Balancing in Datacenter Networks[OL].[ 4 December 2017] http://en.paper.edu.cn/en_releasepaper/content/4742558

Saved Papers

Saved Papers


	3. A Security Assessment Model for Docker Cluster
	WU Lufeng,ZHANG Hua,Dong Cui,TU Tengfei
	Computer Science and Technology 22 November 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Docker containers that are rapidly being used in cloud computing but recently are subject to security challenges. This paper mainly studies the security of the architecture based on Docker. The paper evaluate the single Docker container by the best practice and propose a cluster security evaluation method based on Bayesian network model. The paper designed and implements a container cluster evaluation tool. Finally, experiments are conducted to assess Docker cluster with different security configurations. By comparing the results, the assessment model can correctly demonstrate the overall security of the container cluster.
	TO cite this article:WU Lufeng,ZHANG Hua,Dong Cui, et al. A Security Assessment Model for Docker Cluster[OL].[22 November 2017] http://en.paper.edu.cn/en_releasepaper/content/4742010


	4. Efficient Bare Metal Auto-Scaling for NFV Platform
	Pang Xudong,Wang Jing,Wang Jingyu,QiQi
	Computer Science and Technology 19 November 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:There are always a cloud data center behind the Network Function Virtualisation(NFV) system.Typically, elasticity is an essential attribute of cloud data center, which is critical for operating resources in face of peaks and valleys of business. At present, the automatic scaling technique of virtual machines is widely studied, but barely for physical machines. Despite lack of flexibility, we all know that physical server can perform faster and more efficiently than virtualized instances, especially in NFV systems. Some virtual network functions (VNFs) actually require high performance computing, which is a hard task for virtual machines. Besides, good management of bare metal resources can be significant for the data center power cost and human maintenance cost. Accordingly, we think that auto-scaling of physical machine is worth studying. This paper proposes a bare metal automatic scaling scheme based on workload prediction, and finally make tests on an open source NFV platform.The new scheme obtains good result on computation intensive VNFs scenario, including complete the scale in half an hour, guarantee for the continuity of VNF processing business, and can cope with the load fluctuation better.
	TO cite this article:Pang Xudong,Wang Jing,Wang Jingyu, et al. Efficient Bare Metal Auto-Scaling for NFV Platform[OL].[19 November 2017] http://en.paper.edu.cn/en_releasepaper/content/4742224


	5. Optimization on Reliability and Memory Usage in Dynamic Stream Processing Engine
	TIAN Jun,LI Jinglin
	Computer Science and Technology 14 November 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A critical problem in stream processing Engine among multi-nodes is the balance between reliability and low latency. Higher reliability may result in greater latency, while lower latency makes the system more vulnerable. Some application requires strict reliability, meanwhile, system is desired to be more rapid in responsing to messages. Most stream processing engines rely on distributed architecture which is implemented with hashtable to maintain information of distributed nodes. Thus leads to issue in memory occupation. To balance the reliability and latency in SPE and to shrink memory space wasted by nodes, this paper designed a stream processing engine based on ZeroMQ library. This engine enhances reliability by deploying an timing-window algorithm with AOF in Redis, and reduces memory usage in managing information of nodes through double splay tree.
	TO cite this article:TIAN Jun,LI Jinglin. Optimization on Reliability and Memory Usage in Dynamic Stream Processing Engine[OL].[14 November 2017] http://en.paper.edu.cn/en_releasepaper/content/4741957


	6. An Algorithm on Video Caching Design in Content Delivery Network
	Kai Wu,Chensheng Wang,Guang Yang
	Computer Science and Technology 10 June 2017
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In recent years, multimedia traffic such as video on demand shows explosive growth on the Internet. Network operators are considering content delivery network as the main strategy to keep up with the increasing demand for video requests with the minimum possible delay. Layered video encoding strategies such as Scalable Video Coding enable different caches to store different layers of a video content, allowing successive improvement of the video stream quality. However, the caching placement of video encoding layers that minimize the average delay is NP-hard. We reduce the complexity of this problem to pseudopolynomial time by using a connection with multiple-choice knapsack problem. Numerical results show up to 25% reduction in delay over existing video caching strategies.
	TO cite this article:Kai Wu,Chensheng Wang,Guang Yang. An Algorithm on Video Caching Design in Content Delivery Network[OL].[10 June 2017] http://en.paper.edu.cn/en_releasepaper/content/4735355


	7. A Novel Cloud Video Delivery Mechanism in Mobile Social Networks
	LU Dianjie,HU Bin,ZHENG Xiangwei,LIU Hong,ZHANG Guijuan
	Computer Science and Technology 08 December 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Cloud-based Video Delivery Networks (C-VDNs) have received considerable attention recently. Different from traditional Video Delivery Networks (VDNs), C-VDNs can provide scalable resources without investments on deploying infrastructure. However, current C-VDNs strategies cannot be readily applied to Mobile Social Networks (MSNs). The major challenge is the video delivery problem that deals with the surrogate site selection and the delivery path building under the constraints of cloud resource. The dynamic characteristics of mobile users and videos in MSNs further aggravate the problem. To solve these problems, we propose a session-based MIP (Mixed Integer Program) model to coordinates the surrogate site selection and the delivery routing building. This model considers the mobility of mobile users and the dynamic changing of videos through graph extension and session construction respectively. Since this problem is known to be NP-hard, we relax the integer constraints and design a heuristic algorithm to get the optimal solution. Simulation experiments show that our proposed algorithm is efficient in terms of both performance and rental cost.
	TO cite this article:LU Dianjie,HU Bin,ZHENG Xiangwei, et al. A Novel Cloud Video Delivery Mechanism in Mobile Social Networks[OL].[ 8 December 2016] http://en.paper.edu.cn/en_releasepaper/content/4713462


	8. Name Based Socket : An approach for Android Based System
	Ahmed M.A. Alsayadi,Xu Mingwei
	Computer Science and Technology 21 September 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:IP address management has become more and more complex. For mobile applications, what makes IP management more complicated is the updates of IP address and the address translation of gateways. With the rapid growth of smartphones worldwide (Global sales of smartphones to end users totaled 349 million units in the first quarter of 2016, a 3.9 percent increase over the same period in 2015, according to Gartner, Inc.), this challenge has become even more urgent to be solved. In this paper, a method is introduced to solve IP management-related issues in Android based system using name based socket scheme (NBS). Android NBS relieves mobile applications from IP management and moves it down to the operation system level. Thus, the application itself is relieved from re-implementing features such as multi-homing, mobility, NAT traversal. And the complication of application developing will be reduced. In the meanwhile, the Android NBS is configurable and backward compatible, and it doesn't influence connection performance in any way, it also doesn't require any changes on the network architecture during using.
	TO cite this article:Ahmed M.A. Alsayadi,Xu Mingwei. Name Based Socket : An approach for Android Based System[OL].[21 September 2016] http://en.paper.edu.cn/en_releasepaper/content/4705039


	9. GSPN-based Model to Evaluatethe Performance and SecurityTradeoff in Ad-hocNetwork
	DENG Junyi,LIU Yanheng,ZHAO Rongcun,WANG Jian
	Computer Science and Technology 26 June 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The performance and security tradeoff problemis always a critical issue in the research of Ad-hoc network. Researchers have presented many prioritization schemes. Because of these schemes from different aspects, we cannot compare them directly. We raise a widely used approach to evaluate the schemes which trade off between performance and security in Ad-hoc network. We first structurethe intra-node and inter-node data transmission modelsusing GSPN, then compute the performance, security and income with CMCT (continuous-time Markov chain).In this way, we put security strategies into a unifiedevaluation framework in order to achieve the optimal equilibrium solution,and the model provides the theory basis and data reliance for making efficient use of resources.
	TO cite this article:DENG Junyi,LIU Yanheng,ZHAO Rongcun, et al. GSPN-based Model to Evaluatethe Performance and SecurityTradeoff in Ad-hocNetwork[OL].[26 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4697619


	10. An Adaptive Certificate Distribution Strategy in VANET
	DENG Junyi,LIU Yanheng,ZHAO Rongcun,WANG Jian
	Computer Science and Technology 26 June 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:IThe certificate can improve the security of VANET, but it will reduce the performance. Certificate distribution mechanism is a key to affect the security and performance. We propose anadaptive certificate distribution strategy that it is capable ofdynamicallyadjust distribution way according to the various circumstances in order to obtain the optimal equilibrium solution. The major method is setting a threshold which can adaptively change according to the traffic context and security situation. When it less than the ratio of new cars and all the cars in a given radio range, nodes send packets with certificate. Contrarily, nodes send packets without certificate. We also present a quantification model toevaluate the income of VANET, including the sending nodes, receiving nodes analysis and calculation of their overhead, security, loss, etc.The extensive simulation illustratethat the proposed strategy commendably tradeoffthe performance and security under various trafficconditions.
	TO cite this article:DENG Junyi,LIU Yanheng,ZHAO Rongcun, et al. An Adaptive Certificate Distribution Strategy in VANET[OL].[26 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4697592

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