Abstract:With the rapid development of mobile Internet and Internet of things, a series of time sensitive services such as video conferencing, cloud games, AR / VR have emerged. In order to meet the above time sensitive services, IETF proposed Deterministic Network(DetNet) architecture, which provides an ideal deterministic delay through clock synchronization, zero congestion loss and other mechanisms. At the same time, Tsinghua University proposed Deadline-aware transport protocol(DTP), hoping to specify the deadline in the application layer, and then meet the requirements in the transport layer. These strategies and ideas for time delay sensitive services are worth learning from. However, the current packet transmission mechanisms are all rule-based and relatively static strategies, which can’t meet the demand of time sensitive service in dynamic network. Therefore, based on the idea of DTP and reinforcement learning, this paper proposes an algorithm to dynamically adjust the transmission priority. More specifically, we design the reward and penalty function according to the requirements of DTP protocol, and design the algorithm of congestion control and packet scheduling in the transport layer. We consider not only the priority but also the service deadline. Comprehensive experiments show that compared to traditional packet scheduling strategies, our algorithm performs better in the transmission of time-sensitive services

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. Adaptive packet scheduling algorithm for time-sensitive service
	ZHANG Zhenjie,Jianfeng Guan
	Computer Science and Technology 18 December 2020
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the rapid development of mobile Internet and Internet of things, a series of time sensitive services such as video conferencing, cloud games, AR / VR have emerged. In order to meet the above time sensitive services, IETF proposed Deterministic Network(DetNet) architecture, which provides an ideal deterministic delay through clock synchronization, zero congestion loss and other mechanisms. At the same time, Tsinghua University proposed Deadline-aware transport protocol(DTP), hoping to specify the deadline in the application layer, and then meet the requirements in the transport layer. These strategies and ideas for time delay sensitive services are worth learning from. However, the current packet transmission mechanisms are all rule-based and relatively static strategies, which can’t meet the demand of time sensitive service in dynamic network. Therefore, based on the idea of DTP and reinforcement learning, this paper proposes an algorithm to dynamically adjust the transmission priority. More specifically, we design the reward and penalty function according to the requirements of DTP protocol, and design the algorithm of congestion control and packet scheduling in the transport layer. We consider not only the priority but also the service deadline. Comprehensive experiments show that compared to traditional packet scheduling strategies, our algorithm performs better in the transmission of time-sensitive services
	TO cite this article:ZHANG Zhenjie,Jianfeng Guan. Adaptive packet scheduling algorithm for time-sensitive service[OL].[18 December 2020] http://en.paper.edu.cn/en_releasepaper/content/4753219


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

Saved Papers

Saved Papers


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


	4. An Immune-based Intrusion Detection System Framework for Cloud Computing Environment
	YIN Huadong,WEN Qiaoyan
	Computer Science and Technology 23 November 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In the current cloud computing environment, as it's not reliable between user and cloud computing service provider, the real-time data in the cloud must be proactively monitored, defensive and detected. This work tries to show intrusion detection techniques using the study of natural human immune system, and offers an immune-based intrusion detection system framework for cloud computing environment which is configurable, scalable and efficient.
	TO cite this article:YIN Huadong,WEN Qiaoyan. An Immune-based Intrusion Detection System Framework for Cloud Computing Environment[OL].[23 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4449884


	5. A Two-layer Hidden Markov Model for The Arrival Process of Web Traffic
	Xie Yi
	Computer Science and Technology 02 October 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A new two-layer hidden Markov model is proposed to describe the arrival rate process of Web traffic. The macro state process of the first underlying layer is used to describe the large-scale trends of network traffic. The sub-state process of the second underlying layer is used to describe the small-scale fluctuations that are happening during the duration of a given macro state. Experiments are implemented to validate the proposed model.
	TO cite this article:Xie Yi . A Two-layer Hidden Markov Model for The Arrival Process of Web Traffic[OL].[ 2 October 2011] http://en.paper.edu.cn/en_releasepaper/content/4444677


	6. A New Privacy Enhanced Temporary Social Network Service for Group Dating
	Lu Liu
	Computer Science and Technology 13 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Current group dating is low technology with a lot of embarrassment. In this paper we propose a new privacy enhanced temporary social network service Match for group dating, which helps to avoid embarrassment before face to face. The new service ensures users' privacy secret by applying public key encryption and proper access control based on temporary relationship; meanwhile the service won't accumulate users profile as current social network service does. As a result, the Match provide better user experience and privacy protection for group dating.
	TO cite this article:Lu Liu. A New Privacy Enhanced Temporary Social Network Service for Group Dating[OL].[13 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4406484


	7. Large-scale Data Analysis based on Hadoop
	Liu Yijun
	Computer Science and Technology 15 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the development of complex network and the increase of data scale, the performance of data analysis becomes more and more important. In this paper, we present a new approach for network analysis about the flight data based on Hadoop which is an implementation of the MapReduce parallel framework: Firstly, we identity and group the information of passengers and flights. Secondly, we extract graph nodes, which represent the passengers, and graph edges, which represent the relationship between the passengers. Finally we visualize the passenger’s egocentric network to help network analysis.
	TO cite this article:Liu Yijun. Large-scale Data Analysis based on Hadoop[OL].[15 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37600


	8. Secure multi-party computations of geometric intersections
	Cui Hui
	Computer Science and Technology 18 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Secure multi-party computation is a research focusing in international crypto graphic community. This paper focuses on geometric intersection problems. We use Cantor Encoding method to solve the secure multi-party computation geometry, and propose a new scheme to solve geometry intersection problem. In order to keep secret, we make use of convertible encryption algorithm. This paper gives the solutions to the segment intersection problem and polygon intersection problem, and then demonstrate their security through simulation example. Compared to mostly existing schemes, this scheme can solve any polygon intersection problem, and sometimes its complexity of computation maybe smaller, especially when dealing with the polygon having more vertexes and smaller area. Although it will generate some errors, but this will not affect its application.
	TO cite this article:Cui Hui. Secure multi-party computations of geometric intersections[OL].[18 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35310


	9. Flow Label Negotiation Mechanism in Heterogeneous Networks based on SIP
	GAO Cheng,Huang Xiaohong,Sun Qiong,Ma Yan
	Computer Science and Technology 05 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Flow Label is a 20-bit field in IPv6’s Base Header. This field is especially designed to solve the QoS problem in next generation network. However, the related research work is still far from enough to make it practical. In this paper, a framework to guarantee the QoS across multiple domains using Flow Label is discussed. Based on this framework, we enhance the SDP message and Precondition, a Flow Label negotiation mechanism using SIP is proposed.
	TO cite this article:GAO Cheng,Huang Xiaohong,Sun Qiong, et al. Flow Label Negotiation Mechanism in Heterogeneous Networks based on SIP[OL].[ 5 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28474


	10. Influence of Propagation models in Ad Hoc Networks Routing Protocols
	Sixte Martial Itoua
	Computer Science and Technology 15 April 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A mobile Ad Hoc Network is (MANET) is a network consisting of a group of wireless mobile nodes that communicate with each others without centralized control or established infrastructure. In recent years, a lot of new routing protocols have been developed in order to increase the performance of ad hoc networks. Like all wireless based system, MANET suffers for the performance limitations of a wireless channel, like the obstacle between the transmitter and the receiver. Hence the necessity of an effective mobility model which represents the moving behavior of each mobile node (MN). In this paper the performance of some of the well known ad hoc protocols is studied under different propagation models. The analysis shown that the propagation model has a deep impact on the performance of ad hoc routing protocols.
	TO cite this article:Sixte Martial Itoua. Influence of Propagation models in Ad Hoc Networks Routing Protocols[OL].[15 April 2008] http://en.paper.edu.cn/en_releasepaper/content/20477

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