Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Computer-Network

There are 87 papers published in subject: > since this site started.

Results per page:

87 Total, 9 Pages | << First < Previous 1 2 3 4 5 6 Next > Last >>

Select Subject

All (8831)

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)

Rank

Results per page:

87 Total, 9 Pages | << First < Previous 1 2 3 4 5 6 Next > Last >>

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. ONMA: An Northbound Architecture for Building SDN Services Rapidly
	LIU Jia, ZHANG Bin
	Computer Science and Technology 12 November 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In Software-Defined Networking (SDN) architecture, the northbound API (NBI), as a high-level interface of SDN controller, provides a series of operation and services for network users. Vendors and research community have developed dozens of controllers, which brought a large number of NBIs to programmers. The difference between controllers and the expansion of NBI's number leads to reducing the efficiency of developing and building SDN services. In this paper, we propose an open NBI model architecture (ONMA), which is separated from controller and covers the maximum range of business scenarios. The ONMA is established on the basis of four kinds of models: entity model, capability model, user model and open model. The models can encapsulate all aspects of NBIs, especially the abstraction of NBI users. By using a domain-specific language to manipulate models, SDN developers can build NBI services rapidly on any networking infrastructure.
	TO cite this article:LIU Jia, ZHANG Bin. ONMA: An Northbound Architecture for Building SDN Services Rapidly[OL].[12 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4660747


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

Saved Papers

Saved Papers


	3. Integrating the local network structure and router performance for better routing stratege
	Chen Zhaoyin
	Computer Science and Technology 17 December 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Network capacity and average travel distance of data packets are two key measurements to reflect the efficiency of traffic routing strategy. Network structure and routing strategy are the main factors determining the network performance. Previous study shows that the Internet topology has both scale-free and small-world features. In this paper we study information packet routing process on scale-free networks by mimicking the Internet traffic delivery strategies. We propose a routing strategy integrating the network structure characteristic and router processing ability. We first model the network by presenting the relationship between network capacity and network topology, router processing ability including transmission rate and buffer size. We find that congestions are more susceptible to occur in the nodes with both large betweenness centrality and low router processing ability. Instead of only using the information of degree and betweenness centrality, the new algorithm is derived on both the betweenness centrality and router processing ability. Simulation results suggest that the integrated routing strategy is more efficient in terms of the network capacity and average packet travel distance than SP and MD routing strategy.
	TO cite this article:Chen Zhaoyin. Integrating the local network structure and router performance for better routing stratege[OL].[17 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4624131


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


	5. A monitoring mechanism based on self-organized neighborhood and D-Gossip for large-scale distributed systems
	CHEN Shuyu,WANG Guiping,LIU Jun,LIN Mingwei
	Computer Science and Technology 07 November 2014
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In order to successfully monitor a large-scale distributed system, it is an important issue that the monitoring function fully covers all the entities in the system. To this end, a key challenge is to efficiently transmit state information of the entities in the system. This paper solves this challenge from two aspects. First, in virtue of the idea of self-organizing networks, this paper proposes a neighborhood organization algorithm, which self-organizes the nodes into several monitoring neighborhoods based on the t distance between nodes. The second aspect focuses on message transmission. There are three common message transmission methods in network, i.e., flooding, multicast and unicast. Flooding may cause high network overhead, while unicast may pose high system delay. Based on the idea of Gossip protocol, this paper proposes a directional message dissemination algorithm (D-Gossip), which is a kind of probabilistic multicast. D-Gossip reduces message dissemination uncertainty of traditional Gossip protocols. It effectively improves the efficiency and coverage of message dissemination, while reducing redundant information in the system due to Gossip protocol. The experimental results show that the neighborhood organization algorithm and the D-Gossip can effectively solve the above challenge.
	TO cite this article:CHEN Shuyu,WANG Guiping,LIU Jun, et al. A monitoring mechanism based on self-organized neighborhood and D-Gossip for large-scale distributed systems[OL].[ 7 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4617592


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


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


	8. A TLV Structure Semantic Constraints based Method for Reverse Engineering Protocol Packet Formats
	He Lian,Wen Qianyan,Zhang Zhao
	Computer Science and Technology 24 December 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:mining unknown protocol packet formats is a very effective way to improve network security, especially in promoting the accuracy of network fuzz test. However, researches reverse engineering unknown protocol packets mostly depend on manual analysis, which is extremely time consuming and low efficiency. In this paper, we proposed a new method to infer the unknown protocol packet formats automatically. This method could infer the potential TLV fields and extract protocol format with low time consuming. First we define a threshold value for the sum of tag field types. Then we increase the value of a variable standing for the length of a tag filed until the type number of this tag fields reaches the threshold. After the tag filed is obtained, we can easily get the length field and the value field next to it. Run this process on the value field recursively, and we could finally get the whole structure of packet formats. In order to demonstrate the effectiveness, we applied our methods on the Get-Request packets of SNMP. As a result, almost 90% of the TLV structures of packets are extracted, at the same time, the field of Get-Request Id is also inferred successfully
	TO cite this article:He Lian,Wen Qianyan,Zhang Zhao. A TLV Structure Semantic Constraints based Method for Reverse Engineering Protocol Packet Formats[OL].[24 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4575830


	9. A Reliable and Efficient Network Reboot Mechanism in Wireless Sensor Networks
	Wu Wenbin,Huang Chao,Dong Wei
	Computer Science and Technology 21 August 2013
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper presents NR, a network reboot mechanism based on TinyOS. NR enables reliable and efficient network reboot in WSNs. NR ensures 100% reliability by incorporating an eventual consistency dissemination protocol. It avoids flash I/Os by storing data items on persistent RAM. Evaluation results show that NR can ensure 100% reliability and is efficient in I/O operations.
	TO cite this article:Wu Wenbin,Huang Chao,Dong Wei. A Reliable and Efficient Network Reboot Mechanism in Wireless Sensor Networks[OL].[21 August 2013] http://en.paper.edu.cn/en_releasepaper/content/4555673


	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