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.

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


	2. Learning from Wireless: a Prospective Approach to Human-Centered Computing
	LV Yong,LV Shaohe,WANG Xiaodong,ZHOU Xingming
	Computer Science and Technology 01 June 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:One of the most important topics in Human-Centered Computing (HCC) is to recognise human's activities. In this paper, the technology of wireless-based activity recognition is introduced. By using wireless signals, one can achieve Non-Line-Of-Sight (NLOS) recognition without carrying any devices. Also, it is easy to deploy a wireless-based recognition system due to the ubiquity of wireless communication systems. The basic idea is to detect different characteristics of signal propagation that correspond to the distinct human behaviors. As a result, action recognition is performed by analyzing the distinguishable features of signal propagation. This paper introduces the basic principles and applications of wireless-based activity recognition, and discusses the challenges and related performance metrics. Finally, open problems are discussed to point out the future research trends.
	TO cite this article:LV Yong,LV Shaohe,WANG Xiaodong, et al. Learning from Wireless: a Prospective Approach to Human-Centered Computing[OL].[ 1 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4694788

Saved Papers

Saved Papers


	3. Energy-Efficient Cooperative Communications with Shared Relay in Wireless Network
	Deng Hou, Huang Liu-Sheng, Leng Bing, Xu Hong-Li
	Computer Science and Technology 17 May 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the increasing of the number of mobile devices, energy-efficiency and quality-of-service (QoS) are both important for wireless network.In the recent years, cooperative communication (CC) has been proposed to achieve spatial diversity without additional equipments and antennas.It is indicated that a good relay assignment scheme of CC is effective in improving energy-efficiency greatly in many literatures.In this paper, we first introduce the feasibility of shared relay assignment to improve the energy-efficiency. Then, the Minimum Energy Consumption for capacity requirement (MEC) problem of CC with shared relay will be defined, and we show it is NP-hard. We propose a heuristic algorithm (SRAE) to solve this problem, which is based on the thought of greedy algorithm. We conduct abundant simulation experiments to evaluate the performance of our proposed algorithm. The simulation results show that the SRAE algorithm can save about 54% energy consumption in wireless network.
	TO cite this article:Deng Hou, Huang Liu-Sheng, Leng Bing, et al. Energy-Efficient Cooperative Communications with Shared Relay in Wireless Network[OL].[17 May 2016] http://en.paper.edu.cn/en_releasepaper/content/4691808


	4. Energy-Saving Scheme and Control Framework in Data Center Network
	Tao Xiaoqing,Zhang Yinghai
	Computer Science and Technology 23 September 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Modern data centers require abundant network devices, servers to provide high quality of various resources such as computing, storage and switching. Since data center network is designed for busy-hour load, it faces a problem that the average utilization rate of network devices is far below the total network capacity. In this paper, we propose an energy-saving scheme and a control framework based on OpenFlow to deal with this problem. To balance network capacity and energy saving, the key idea is to implement a comprehensive scheme with traffic prediction and management of switches. Our simulation results show that the scheme not only balances energy saving and network capacity nicely, but also optimizes response time with little extra energy consumption.
	TO cite this article:Tao Xiaoqing,Zhang Yinghai. Energy-Saving Scheme and Control Framework in Data Center Network[OL].[23 September 2015] http://en.paper.edu.cn/en_releasepaper/content/4655778


	5. Fair Network Bandwidth Allocation in IaaS Datacenters via a Cooperative Game Approach
	GUO Jian, LIU Fangming, John C.S. Lui, JIN Hai
	Computer Science and Technology 03 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With wide application of virtualization technology, tenants are able to access isolated cloud services by renting the shared resources in datacenters. Unlike resources such as CPU and memory, datacenter network, which relies on traditional transport-layer protocols, suffers unfairness due to a lack of VM-level bandwidth guarantees. In this paper, we model the datacenter bandwidth allocation as a cooperative game, towards VM-based fairness across the datacenter with two main objectives: (i) guarantee bandwidth for VMs based on their base bandwidth requirements, and (ii) share residual bandwidth in proportion to weights of VMs. Through a bargaining game approach, we propose a bandwidth allocation algorithm, emph{Falloc}, to achieve the asymmetric Nash bargaining solution (NBS) in datacenter networks, which exactly meets our objectives. The cooperative structure of algorithm is exploited to develop an online algorithm for practical real-world implementation. We validate emph{Falloc} with experiments under diversed scenarios, and show that by adapting to different network requirements of VMs, emph{Falloc} can achieve fairness among VMs and balance the tradeoff between bandwidth guarantee and proportional bandwidth sharing. Our large scale trace-driven simulations verify that emph{Falloc} achieves high utilization while maintaining fairness among VMs in datacenters.
	TO cite this article:GUO Jian, LIU Fangming, John C.S. Lui, et al. Fair Network Bandwidth Allocation in IaaS Datacenters via a Cooperative Game Approach[J].


	6. HFOB-RSA: Historical Forwarding Overhead Based Resource Scheduling Algorithm for the Virtual Router
	GAO Xianming,WANG Baosheng,ZHANG Xiaozhe,MA Shicong
	Computer Science and Technology 28 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:IDue to the current resource scheduling algorithms in virtual router not offering promise for the fairness of shared resources, this paper proposes a historical forwarding overhead based resource scheduling algorithm to ensure that router instances occupy determinate physical resources (including CPUs and I/Os) that should be proportional to actual requirements. This algorithm can determine the scheduling priority of router instances by calculating the last forwarding overhead of each router instance to make those router instances with low real throughput have an opportunity for being scheduled. Meanwhile, this algorithm also determines whether or not to discard the non-disposed packets in advance by forecasting their processing time to avoid the unwanted overhead. The experimental results prove that HFOB-RSA has superiority over FIFO algorithm in terms of the fairness of shared resources in virtual router, specially, I/O resources. At last, HFOB-RSA also can provide support for the delay-sensitive router instances.
	TO cite this article:GAO Xianming,WANG Baosheng,ZHANG Xiaozhe, et al. HFOB-RSA: Historical Forwarding Overhead Based Resource Scheduling Algorithm for the Virtual Router[OL].[28 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4619145


	7. Software Defined Networking: Technologies and Solutions toward an Open Network Eco-System
	LIU Fangming,GUO Jian
	Computer Science and Technology 15 October 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Software-Defined Networking (SDN), a new networking paradigm decoupling the software control logic from the data forwarding hardware, promises to enable simpler management, more flexible resource usage and faster deployment of network services. It opens network functionality, application programmability, and control-to-data communication interfaces that used to be closed in conventional network devices, offering endless opportunities but also challenges for both existing players and newcomers in the market. Through a comprehensive and comparative exploratory of SDN stat-of-the-art techniques, standardization activities and realistic applications, this article unveils historic and technical insights into the innovations that SDN offers toward an emerging open network eco-system. We closely examine the critical challenges and opportunities when the networking industry is been reshaped by SDN. We further shed light on future development directions of SDN in broad application scenarios, ranging from cloud datacenters, network operating systems, and advanced wireless networking.
	TO cite this article:LIU Fangming,GUO Jian. Software Defined Networking: Technologies and Solutions toward an Open Network Eco-System[OL].[15 October 2014] http://en.paper.edu.cn/en_releasepaper/content/4613737


	8. On-demand gateway broadcast scheme for connecting mobile ad hoc networks to the Internet
	XU Huaqiang,JU Lei,GUO Chongxian,JIA Zhiping
	Computer Science and Technology 28 July 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Gateway discovery algorithm is a fundamental protocol for interconnecting mobile ad hoc network (MANET) with the Internet. In most existing schemes, each gateway node broadcasts gateway advertisements to announce its presence. The decision of when to emit advertisements can influence the performance of the network. Traditional gateway discovery schemes adopt the method of periodically emitting advertisements with a time interval. However, this method does not well fulfill the actual needs of the source nodes. This paper proposes a novel adaptive scheme for gateway discovery, in which the gateway broadcasts advertisements only on-demand instead of periodic emission. In order to obtain the network's actual demands for gateway advertisement, routes to the gateway are monitored. In particular, if any route is predicted to be broken, the source node requires fresh gateway advertisements to update routes, and then the gateway will be triggered to broadcast to fulfill such demands. We study the performance of on-demand gateway discovery scheme by a comparison approach. The results show that the proposed adaptive gateway discovery scheme greatly outperforms the conventional solutions: it is capable of achieving higher packet delivery ratio and lower end-to-end delay, while minimizing the routing overhead.
	TO cite this article:XU Huaqiang,JU Lei,GUO Chongxian, et al. On-demand gateway broadcast scheme for connecting mobile ad hoc networks to the Internet[J].


	9. Metadata-intensive I/O Optimizations in Parallel File Systems
	Xie Ke,Li Xiuqiao,Wu Qimeng,Xiao Limin,Ruan Li
	Computer Science and Technology 26 April 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With parallel file systems increasingly growing in size, the performance of metadata I/O becomes critical for overall performance. Metadata-intensive applications create a lot of metadata I/O requests with small amount of data, making metadata access become the bottleneck of system. We propose an optimization method based on aggregating and merging requests for metadata-intensive I/O to deal with this problem. Extensive simulations show that the aggregate throughput of intensive file creating can be increased by up to 15.28 times and average response time can be decreased by factors of up to 99.27 percent when the aggregation period and request interval is configured as 0.8ms and 0.025ms respectively. Simulations also show that the aggregate throughput of intensive metadata access can be increased by up to 8.45 times and average response time can be decreased by factors of up to 99.02 percent when the merging period and request interval is configured as 0.4ms and 0.025ms respectively. Meanwhile, experiments show that our method can scale well with the number of metadata servers and clients.
	TO cite this article:Xie Ke,Li Xiuqiao,Wu Qimeng, et al. Metadata-intensive I/O Optimizations in Parallel File Systems[OL].[26 April 2013] http://en.paper.edu.cn/en_releasepaper/content/4539533


	10. Maximum Multiflow in Wireless Network Coding
	ZHOU Jin-Yi,XIA Shu-Tao,JIANG Yong,ZHENG Hai-Tao,XIA Shu-Tao
	Computer Science and Technology 29 March 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In a multihop wireless network, wireless interference is a crucial factor in the maximum multiflow (MMF) problem, which studies the maximum throughput between multiple pairs of sources and sinks with a link schedule to support it.In this paper, we observe that network coding could help to decrease the impact of wireless interference, and thus propose a framework to study the MMF problem for multihop wireless networks with network coding.Firstly, a network model is established to describe the new conflict relations and schedulability modified by network coding.Next, we formulate the MMF problem to compute the maximum throughput of multiple unicast flows supported by the multihop wireless network with network coding, and show that its capacity region could be enlarged by performing network coding.Finally, we show that determining the capacity region of a multihop wireless network with network coding is an NP-hard problem, and thus propose a greedy heuristic algorithm, called coding-first collecting (CFC), to determine a capacity subregion of the network.We also show that finding an optimal hyperarc schedule to meet a given link demand function is NP-hard, and propose a polynomial algorithm, called coding-first scheduling (CFS), to find an approximate fractional hyperarc schedule in the multihop wireless network with network coding.A numerical analysis of a grid wireless network and a random wireless network is presented to demonstrate the efficiencies of the CFC algorithm and the CFS algorithm based on the framework.
	TO cite this article:ZHOU Jin-Yi,XIA Shu-Tao,JIANG Yong, et al. Maximum Multiflow in Wireless Network Coding[OL].[29 March 2013] http://en.paper.edu.cn/en_releasepaper/content/4529606

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