摘要：Combining named data networking（NDN） and software-defined networking（SDN） has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the integration of NDN and SDN, the forwarding mechanism to solve the inherent problems caused by the flooding scheme and discard of interest packets in traditional NDN is not well considered. To fill this gap, by taking advantage of SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routing decisions are made globally. Then we show how the forwarding mechanism is operated for interest and data packets. In addition, we propose a novel routing algorithm considering quality of service（QoS） applied in the proposed forwarding mechanism and carried out in controllers. We take both resource consumption and network load balancing into consideration and introduce a genetic algorithm（GA） to solve the QoS constrained routing problem using global network information. Simulation results are presented to demonstrate the performance of the proposed routing scheme.

摘要：In-network caching is one of the most important issues in content centric networking （CCN）, which may extremely influence the performance of the caching system. Although much work has been done for in-network caching scheme design in CCN, most of them have not addressed the multiple network attribute parameters jointly during caching algorithm design. Hence, to fill this gap, a new in-network caching based on grey relational analysis （GRA） is proposed. The authors firstly define two newly metric parameters named request influence degree （RID） and cache replacement rate, respectively. The RID indicates the importance of one node along the content delivery path from the view of the interest packets arriving The cache replacement rate is used to denote the caching load of the node. Then combining hops a request traveling from the users and the node traffic, four network attribute parameters are considered during the in-network caching algorithm design. Based on these four network parameters, a GRA based in-network caching algorithm is proposed, which can significantly improve the performance of CCN. Finally, extensive simulation based on ndnSIM is demonstrated that the GRA-based caching scheme can achieve the lower load in the source server and the less average hops than the existing the betweeness （Betw） scheme and the ALWAYS scheme.

摘要：The basic function of the Internet is to delivery data(what) to serve the needs of all applications. IP names the attachment points(where) to facilitate ubiquitous interconnectivity as the current way to deliver data. The fundamental mismatch between data delivery and naming attachment points leads to a lot of challenges, e.g., mapping from data name to IP address, handling dynamics of underlying topology, scaling up the data distribution, and securing communication, etc. Informationcentric networking(ICN) is proposed to shift the focus of communication paradigm from where to what, by making the named data the first-class citizen in the network, The basic consensus of ICN is to name the data independent from its container(space dimension) and session(time dimension), which breaks the limitation of point-to-point IP semantic. It scales up data distribution by utilizing available resources, and facilitates communication to fit diverse connectivity and heterogeneous networks. However, there are only a few consensuses on the detailed design of ICN, and quite a few different ICN architectures are proposed. This paper reveals the rationales of ICN from the perspective of the Internet evolution, surveys different design choices, and discusses on two debatable topics in ICN, i.e.,self-certifying versus hierarchical names, and edge versus pervasive caching. We hope this survey helps clarify some mis-understandings on ICN and achieve more consensuses.

摘要：Information centric networking(ICN) is a new network architecture that is centred on accessing content. It aims to solve some of the problems associated with IP networks, increasing content distribution capability and improving users' experience. To analyse the requests' patterns and fully utilize the universal cached contents, a novel intelligent resources management system is proposed, which enables effi cient cache resource allocation in real time, based on changing user demand patterns. The system is composed of two parts. The fi rst part is a fi ne-grain traffi c estimation algorithm called Temporal Poisson traffi c prediction(TP2) that aims at analysing the traffi c pattern(or aggregated user requests' demands) for different contents. The second part is a collaborative cache placement algorithm that is based on traffic estimated by TP2. The experimental results show that TP2 has better performance than other comparable traffi c prediction algorithms and the proposed intelligent system can increase the utilization of cache resources and improve the network capacity.

摘要：This paper presents a scheme to perform QoS management and assure network security by using the trusted-router based on the Trust Management *** this trusted-router,every IP packet is forwarded and queued by its trust value,which is the quantification of the network's expectation for this packet's and its owner's behavior in the *** outline the algorithms to calculate the trust value of the trusted-router and the IP *** also introduce the trust-based QoS management algorithm and the deployment of the trusted-routers which carry out this *** simulation results show that the least trusted IP packets will be dropped to save resources for those highly trusted IP *** will ecourage all the elements in the network to keep a good trust record.

摘要：Quantized projection technology （QP） is the version of quantization index modulation （QIM） working in the projection domain. It essentially belongs to a double-sided additive embedder. In this article, the concept of sign quantized projection （SQP） is proposed, which differs from the conventional QP when working as a single-sided embedder. Theoretical analysis reveals that SQP has the same probability of miss and probability of false alarm as QP. Also, the document-to-watermark ratio （DWR） of SQP is less than its counterpart of QP by lOlg（1＋ γ） dB.

摘要：The low-cost,self-configuration capability and "plug-and-play" feature of Ethernet establishes its dominant position in the local area networks(LAN).However,it is hard to extend to large scale because of the legacy broadcast-based service discovery ***,to solve this problem,a new split network architecture named Software-Defined networking(SDN) is introduced in this paper,and a novel floodless service discovery mechanism(FSDM)for SDN is *** the FSDM,the widespread broadcast messages for Dynamic Host Configuration Protocol(DHCP) and Address Resolution Protocol(ARP) are considered especially,*** the DHCP relay and ARP proxy are proposed to handle DHCP broadcast messages and ARP broadcast messages,*** proposed FSDM in this paper can eliminate flooding completely,reserve the autoconfiguration ***,there is no need to change the existing hardware,software and protocols of hosts for the proposed ***,the simulation results are demonstrated to show that our proposed model allows redundant links existed in network and has the property of scalability,which can significantly reduce network traffic in data plane and control traffic in control plane,and decrease the overhead of control plane.

摘要：An m-cycle system of order v and index λ, denoted by m-CS(v,λ), is a collection of cycles of length m whose edges partition the edges of λKv. An m-CS(v,λ) is α-resolvable if its cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a design are m|λv(v-1)/2,2|λ(v -1),m|αv,α|λ(v-1)/2. It is shown in this paper that these conditions are also sufficient when m = 4.

摘要：：In today＇s networks, load balancing and priority queues in switches are used to support various quality-of-service （QoS） features and provide preferential treatment to certain types of traffic. Traditionally, network operators use ‘traceroute＇ and ‘ping＇ to troubleshoot load balancing and QoS problems. However, these tools are not supported by the common OpenFlow-based switches in software-defined networking （SDN）. In addition, traceroute and ping have potential problems. Because load balancing mechanisms balance flows to different paths, it is impossible for these tools to send a single type of probe packet to find the forwarding paths of flows and measure latencies. Therefore, tracing flows＇ real forwarding paths is needed before measuring their latencies, and path tracing and latency measurement should be jointly considered. To this end, FlowTrace is proposed to find arbitrary flow paths and measure flow latencies in OpenFlow networks. FlowTrace collects all flow entries and calculates flow paths according to the collected flow entries. However, polling flow entries from switches will induce high overhead in the control plane of SDN. Therefore, a passive flow table collecting method with zero control plane overhead is proposed to address this problem. After finding flows＇ real forwarding paths, FlowTrace uses a new measurement method to measure the latencies of different flows. Results of experiments conducted in Mininet indicate that FlowTrace can correctly find flow paths and accurately measure the latencies of flows in different priority classes.

摘要：The relay node with linear relaying transmits the linear combination of its past received *** optimization of two-hop relay channel with linear relaying is discussed in this *** capacity for the two-hop Gaussian relay channel with linear relaying is derived,which can be formulated as an optimization problem over the relaying matrix and the covariance matrix of the signals transmitted at the *** is proved that the solution to this optimization problem is equivalent to a "single-letter" optimization *** also show that the solution to this "single-letter" optimization problem has the same form as the expression of the rate achieved by Time-Sharing Amplify and Forward(TSAF).In order to solve this equivalent problem,we proposed an iterative *** results show that if channel gain of one hop is relatively smaller,the achievable rate with TSAF is closer to the max-flow min-cut capacity bound,but at a lower complexity.