Search

As the most fundamental infrastructure in the current Internet, the Border Gateway Protocol (BGP) supports the inter-connectivity of different Autonomous Systems (ASs) and then the reachability can be achieved from any network in the Internet. However, due to the lack of security consideration during its original design, the BGP suffers from multiple security threats. Another challenge is that it cannot support the future sophisticated applications with deterministic routing. In this article, we propose a novel BGP management architecture, namely BGPChain, which is based on the blockchain in order to establish a secure, smart, and agile routing infrastructure for the future Internet.

Current detection networks usually struggle to detect small-scale object instances due to spatial information loss and lack of semantics. In this paper, we propose a one-stage detector named LocalNet, which pays specific attention to the detailed information modeling. LocalNet is built upon our redesigned detection-oriented backbone called long neck ResNet, which aims to preserve more detailed information in the early stage to enhance the representation of small objects. Furthermore, to enhance the semantics in the detection layers, we propose a local detail-context module, which reintroduces the detailed information lost in the network and exploits the local context within a restricted receptive field range. Moreover, we explore a method for training detectors nearly or totally from scratch, which provides the potential to design network structures with more freedom. With nearly $$94\%$$ of the pretrained parameters randomly reinitialized in the backbone, our model improves the mAP of our baseline model from 75.0 to $$82.3\%$$ on the PASCAL VOC dataset with an input size of $$300\times 300$$ and achieves state-of-the-art accuracy. Even when trained from scratch, our model achieves $$80.8\%$$ mAP, which is $$5.8\%$$ greater than the mAP of our baseline model with a fully pretrained backbone.

In generic object detection, detectors are often susceptible to foreground objects and background regions that share similar appearances. In this paper, we propose a novel discriminative region mining (DRM) module for object detection, which enables discriminative region localization and representation for accurate object identification. The DRM module is collaboratively optimized by an extra intramodule classification loss in addition to the usual detection loss, which ensures its adequate discriminative capability. Specifically, two derivatives of the DRM module, namely a local DRM module and a contextual DRM module are proposed to excavate local and contextual discriminative regions, respectively. Furthermore, we extend the local DRM module to capture multiple local discriminative regions with a diversity constraint. To explore informative local features, an image upsampling branch is introduced to generate fine-grained representation for the local DRM module. Extensive experiments on the PASCAL VOC and MS COCO datasets demonstrate the effectiveness of the proposed method. Simple baseline detectors with the built-in DRM can achieve state-of-the-art detection performance. For example, the proposed detector achieves a mean average precision of 81.0% on PASCAL VOC 2007 with an input size of $\text{300} \times \text{300}$ using a ResNet-18 backbone, which runs at 24.2 fps on an Nvidia Titan X GPU.

With the rapid evolution of the Internet, it has become a significant issue to further enhance the security of traditional protocols which were lack of comprehensive security considerations when originally designed. Among them, the Domain Name System (DNS) as the most important infrastructure is a typical one. To deal with the DNS security risks (e.g., Distributed Denial-of-Service (DDoS), DNS hijack and etc.), multiple extension protocols have been developed. The DNS management architecture has also been optimized from various aspects. Nowadays, as individual privacy on the Internet is attracting more and more attention, it is becoming one of the most important tasks for both DNS itself and its related applications to guarantee the privacy of end-user. This paper mainly studies the problem of DNS privacy leakage and analyzes some promising solutions. However, these solutions may affect the performance of some Internet services related to the DNS like the “Butterfly Effect”. It is highly advised that the whole community should pay more attention to the issue of adding DNS privacy, while maintaining the stability and backward compatibility

The 21st century is a high-tech information era in which our lives are closely linked by computer networks. Hence, how to effectively supervise networks and reduce the frequency of network security incidents has now become a research hotspot in cyberspace. Specifically, researchers have shown an increased interest in predicting the network traffic before any untoward incident happens. Optimization and decomposition technologies are the core components of network traffic prediction model which plays an important role in network management. This article discusses past network traffic prediction research and critically examines the optimization and decomposition technologies used in the model, lists the model parameter structure based on the research methodology, the data set used, the evaluation criteria and so on. By comparison, digging out the Particle Swarm Optimization (PSO) algorithm and the Variational Mode Decomposition (VMD) decomposition technique will effectively solve the network traffic model predictive difficulties that have proven to be crucial to improving predictive accuracy and convergence speed strategy.The comprehensive review reveals that PSO and VMD are the most suitable optimization algorithm and decomposition technology for network traffic prediction modeling.

In recent years, significant achievements have been made in object detection thanks to development of deep learning. However, there are still some open problems such as the poor performance in small object detection, especially when the computing resources are limited. In this paper, we propose a single-shot detail-preserving detector with a multi-flow sub-network and a multi-connection module, which is built upon the one-stage strategy to inherit the computational efficiency. Specifically, we first design a detail-preserving backbone network to preserve image details critical for small object detection. Then for feature refinement, we propose a multi-flow sub-network to optimize low-level features for small object detection and a multi-connection module to fuse multi-grained information to enhance feature representation without significant extra computational cost. Extensive experiments on PASCAL VOC and MS COCO demonstrate that our detector achieves state-of-the-art detection accuracies with high computational efficiency. The proposed method with only 300 × 300 input size achieves 82.6% mAP on PASCAL VOC 2007 and 32.9% mAP on MS COCO, both with one Nvidia Titan X GPU.

The vision of the Internet of Things (IoT) covers not only the well-regulated processes of specific applications in different areas but also includes ubiquitous connectivity of more generic objects (or things and devices) in the physical world and the related information in the virtual world. For example, a typical IoT application, such as a smart city, includes smarter urban transport networks, upgraded water supply, and waste-disposal facilities, along with more efficient ways to light and heat buildings. For smart city applications and others, we require unique naming of every object and a secure, scalable, and efficient name resolution which can provide access to any object's inherent attributes with its name. Based on different motivations, many naming principles and name resolution schemes have been proposed. Some of them are based on the well-known domain name system (DNS), which is the most important infrastructure in the current Internet, while others are based on novel designing principles to evolve the Internet. Although the DNS is evolving in its functionality and performance, it was not originally designed for the IoT applications. Then, a fundamental question that arises is: can current DNS adequately provide the name service support for IoT in the future? To address this question, we analyze the strengths and challenges of DNS when it is used to support ubiquitous IoT. First, we analyze the requirements of the IoT name service by using five characteristics, namely security, mobility, infrastructure independence, localization, and efficiency, which we collectively refer to as SMILE. Then, we discuss the pros and cons of the DNS in satisfying SMILE in the context of the future evolution of the IoT environment.

The current system to manage the global pool of IP addresses is centralized in five transnational organizations, known as regional internet registries (RIRs). Each of them manages the address pool for many countries. In this paper, we present InBlock, a distributed autonomous organization that provides the decentralized management of IP addresses. The InBlock also fulfills the same objectives as those fulfilled by the current IP address allocation organizations, i.e., uniqueness, fairness, conservation, aggregation, registration, and minimized overhead. The InBlock is implemented as a set of blockchain's smart contracts in Ethereum, and it implements all the functions needed for the management of a global pool of addresses without any human intervention. Any entity may request an allocation of addresses to the InBlock registry by performing a (crypto)currency transfer to the InBlock. The fee required, along with the annual renewal fee, serves as a mechanism to deter stockpiling and other wasteful practices. As with any novel technology, there are many open questions about the usage of blockchains to build an IP address registry. For this reason, we believe that practical experimentation is required in order to have hands-on experience, so we propose to conduct an experiment on the InBlock as a starting point to inform about the future directions in this space. This work was supported by Huawei through the InBlock HIRP prize and by the Spanish Ministry of Economy and Competitiveness through the 5G-City project (TEC2016-76795-C6-3-R).

Named Data Networking (NDN) is a promising Internet architecture which is expected to solve some problems (e.g., security, mobility) of the current TCP/IP architecture. The basic concept of NDN is to use named data for routing instead of using location addresses like IP address. NDN natively supports consumer mobility, but producer mobility is still a challenge and there have been quite a few researches. Considering the Internet connection such as public transport vehicles, network mobility support in NDN is important, but it is still a challenge. That is the reason that this paper proposes an efficient network mobility support scheme in NDN in terms of signaling protocols and data retrieval.

Domain Name System(DNS) is one of the most foundational and essential services on the Internet, the security and robustness of DNS are of great significance. However, the stable operation of DNS has been threatened by Distributed Denial of Service(DDoS) for quite a long time, especially when the number of registered names of. CN are over 20 million on November 11, 2016. According to our observation, the frequency of volume-based DDoS attacks increased rapidly in recent years, and when the attack happened, not only the authoritative servers were affected, servers of Top Level Domain(TLD) also suffered a lot. In this paper, a model based on Random Forest[1] is applied to traffic classification with an accuracy of 99.2% on Spark. The result shows that the model could be used to deal with large-scale DNS query flows, which is fast enough to be used in practice.

It is a challenge for future mobile networks to cope with enormous video traffic due to bottlenecks of the backhaul capacity and spectrum shortages. To address this situation, we study a content delivery solution for video-on-demand (VoD) applications in orthogonal frequency division multiplexing (OFDM)-based mobile networks in this paper. As done in some transformative computing models, the proposed solution firstly collects the user and environment information, and then computes a global-optimized video delivery scheme based on the collected information. The video delivery scheme is orchestrated using a novel video delivery model that implements deep cooperation among video users and device-to-device (D2D) communications. Several orchestration algorithms are proposed to improve the performance of video delivery.

Named Data Networking (NDN) is a promising architecture for the future Internet and it is mainly designed for efficient content delivery and retrieval. However, producer mobility support is one of the challenging problems of NDN. This paper proposes a scheme which aims to optimize the tunneling-based producer mobility solution in NDN. It does not require NDN routers to change their routing tables (Forwarding Information Base) after a producer moves. Instead, the Interest packet can be sent from a consumer to the moved producer using the tunnel. The piggybacked Data packet which is sent back to the consumer will trigger the consumer to send the following Interest packets through the optimized path to the producer. Moreover, a naming scheme is proposed so that the NDN caching function can be fully utilized. An analysis is carried out to evaluate the performance of the proposal. The results indicate that the proposed scheme reduces the network cost compared to related works and supports route optimization for enhanced producer mobility support in NDN.

Two of the most promising candidate solutions for realizing the next-generation all-IP mobile networks are Mobile IPv6 (MIPv6), which is the host-based and global mobility supporting protocol, and Proxy MIPv6 (PMIPv6), which is the network-based and localized mobility supporting protocol. However, the unprecedented growth of mobile Internet traffic has resulted in the development of distributed mobility management (DMM) architecture by the Internet engineering task force DMM working group. The extension of the basic MIPv6 and PMIPv6 to support their distributed and scalable deployment in the future is one of the major goals of the DMM working group. We propose an all-IP-based mobility management architecture that leverages the concept of Named Data Networking (NDN), which is a distributed content management and addressing architecture. In the proposed solution, mobility support services are distributed among multiple anchor points at the edge of the network, thereby enabling a flat architecture that exploits name-based routing in NDN. Our approach overcomes some of the major limitations of centralized IP mobility management solutions, by extending existing routing protocol and mobility management architecture, to distribute the mobility management function of anchor points in the IP network and optimize the transmission path of mobile traffic.

Natural Language Processing is an important direction in the fields of computer science and artificial intelligence. It has a wide range of applications, such as text classification, machine translation, emotional analysis, etc. where text classification is typically characterized of capturing the language features of e-mails to identify the authors. In this paper, mathematic models are set up and compared based on the traditional text classification method and the Deep Learning text classification method respectively. Finally, the following results are obtained: The accuracy of the model using the improved network architecture based on TextCNN reaches 87% on the training set and 88.97% on the test set. The accuracy of using the improved network architecture based on CLSTM reaches 90% on the training set and 88.34% on the test set. The accuracy of the new network architecture based on recurrent neural network (RNN) and convolutional neural network (CNN) has reached 92.32% on the training set and 92.80% on the test set. Using integrated learning to integrate the model, the accuracy rate is 94% on the training set and 92.36% on the test. The model based on SVM are tested with the test set to get the accuracy rate 60.44%.

Vehicular information network and Internet of Things (IoT) technologies have been receiving a lot of attention in recent years as Intelligent Transportation Systems (ITS). As one of the most important and promising IoT area, ITS aims to implement a myriad of applications related to vehicles, traffic information, drivers, passengers and pedestrians. For Cooperative Adaptive Cruise Control (C-ACC), platooning and other typical use cases in ITS, a direct IP communication between neighbor vehicles is required which poses the following two issues: 1) how to discover the neighbor vehicle and the required service; and 2) how to discover the link-layer address of the neighbor vehicle and server. This paper presents a solution to these problems based on Domain Name Service (DNS).

In Proxy Mobile IPv6 (PMIPv6) networks, proxy registrations are performed even for idle mobile nodes (MNs), resulting in unnecessary signaling traffic and protocol cost. Although there have been many paging techniques aimed at reducing the unnecessary location updates, those are mainly focused on telecommunication systems and how to adopt IP paging schemes in PMIPv6 is not yet well studied. In this paper, we introduce a new paging scheme that optimizes paging performance in a localized manner. The proposed localized paging scheme pages the idle MN through a mobility access gateway (MAG) while the operation is transparent to a local mobility anchor (LMA) in a PMIPv6 network domain. In this way, a bottleneck risk at the LMA can be avoided, without a huge requirement of buffer size and paging singling cost. We develop a thorough analytical model for evaluating the performance of the proposed scheme, compared with a LMA-based paging scheme in terms of the buffer size requirement and signaling cost. Analytical results demonstrate that the proposed paging scheme can significantly reduce the signaling cost for PMIPv6, achieving a less buffer size requirement and of course shorter paging delay, compared with those of the LMA-based paging scheme.

As an instantiation of Information-centric Networking (ICN), Named Data Networking (NDN) was proposed. Since the Interests are recorded in the PITs of the intermediate routers until they receive corresponding Data packets or exceed the expiring time, the attackers can send excessive number of spoofed Interests to occupy the PITs, which is called Interest Flooding Attack (IFA), to degrade the network performance. In this paper, we propose an IFA detection mechanism based on Support Vector Machine (SVM), which can detect the IFA effectively. In order to improve the accuracy of the attack detection, we use the information entropy of the Interest names, the usage of PIT and the satisfaction rate of the Interests as the extracted features in the SVM classifier. In addition, we evaluate the performance of our mechanism. The simulation results validate that the mechanism can accurately and effectively detect the IFA.

Although in recent years a variety of anti-phishing studies have been carried out, phishing fraud has become increasingly rampant. Especially with the popularity of electronic banking and mobile payment, phishing attacks have become more profitable. In this context, exploring efficient and practical anti-phishing technology is particularly necessary and urgent. In this paper, by analyzing the resources (CSS, JS, and image files) request characteristics of phishing sites, we propose a novel anti-phishing method — RRPhish. RRPhish as an enhanced blacklist technology, can detect not only phishes in blacklist, but also emerging phishes. The experiments demonstrate the effectiveness of RRPhish.

As a typical Information-Centric Networking solution , Publish-Subscribe Internet Technology (PURSUIT) presents a flexible networking architecture for the domain based content management and source-routing based content addressing. However, with the development of mobile Internet, how to extend PURSUIT for supporting efficient and scalable mobility management is vital for its actual deployment. In this paper, we propose a new mobility management scheme for both a subscriber and a publisher in a PURSUIT architecture. The proposed scheme is based on a proxy, which is dynamically selected in a distributed manner at the branching point. A network based fast handover procedure is also integrated to guarantee a mobile user's better handover experience in the proposed scheme. Based on our designed analytic model, the performance of the proposed scheme is evaluated. The numerical results demonstrate that the proposed scheme can reduce the handover latency compared with that in the basic PURSUIT case. Besides, the required handover preparation time and the induced extra signaling cost are also analyzed.

As an important infrastructure of the current Internet, the Domain Name System (DNS) universally supports most of Internet applications. The DNS is established on top of Internet Protocol (IP) to provide an addressing of Internet resources. However, the IP based current Internet communication model is considered as inappropriate for supporting an explosive increase of Internet devices and contents in the Future Internet. To address the communication model issue, Named Data Networking (NDN) has been proposed that allows a consumer only cares about what he wants but not where the content is. Although NDN designs an ideal communication model for the content-intensive Future Internet, it assumes a clean-slate deployment, which would take a long time for deployment. The coexistence of the NDN paradigm and the current Internet is thus expected. In this vein, we propose a new scheme that utilizes current DNS protocols for content naming and addressing in a NDN environment. The proposed scheme helps to accelerate the NDN evolution while providing a means of utilizing the DNS for scalable and secure NDN.

The transition from IPv4 to IPv6 is an inexorable trend in the development of Internet. However, since IPv4 has been widely deployed for many years, it is mandatory that the existing IPv4 and the newly deployed IPv6 coexist and interoperate seamlessly. With the study of various mechanisms proposed for the interoperability between IPv4 and IPv6, some mobility management protocols are also extended to work in the mixed mobile Internet. In this study, the authors carry out an in-depth analysis of three types of standardised mobility management protocols with dual-stack support. Owing to the difference of underlying basic protocols, their individual dual-stack extensions have different features and thus are suited for deployment in different scenarios and stages in the evolution of the mobile Internet.

JavaScript can modify HyperText Markup Language(HTML) code. tag of HTML can load pages from other websites. These technologies are widely used nowadays for constructing flexible and robust web services. However, illegal websites also use these technologies to hide illegal contents. For traditional methods using web text to detect these illegal webpages (just getting initial source codes that aren't parsed by a browser), they can't give a precise judgment. In this paper, we solved the challenge and proposed a robust Internet abuse detection method. We get HTML codes that had been parsed by simulating the progress how browsers work in order to gather the necessary materials for text detection methods. Besides, we not only extracted the text features of HTML code, but also extracted structure features of HTML codes. With the experiments under detecting Internet abuse scenarios, we demonstrated that the proposal is efficient.

Named Data Networking (NDN) is one of the most promising future Internet architectures, which supports communications based on content names but not the content locations. Clients can retrieve content only by sending an Interest packet, which includes the content name. However, independent Interest packets will cause heavy loads on the routers, particularly in the Internet of Things (IoT) scenarios which will induce huge number of small-sized content exchanges. The proposed scheme enables clients to retrieve many different contents by sending an aggregated Interest packet. In addition, the Data packet can also be aggregated by the intermediate routers to improve the efficiency of NDN communications.

Serving as the global Internet's phonebook, the Domain Name Service (DNS) helps to translate human-friendly domain names into machine-readable IP addresses, which makes DNS of great importance to the operation of the Internet and virtually relied on by today's almost all kinds of Internet-based activities. As such, people whoever want to go anywhere over the Internet will need to refer to the DNS first. Therefore, it has become an ideal way to conduct online privacy exploitations through the DNS due to people's pervasive usage of the Internet. However, the current DNS doesn't provide any countermeasure against this kind of exploitation, and thus risks severe privacy disclosure problems. In this paper, we give a comprehensive empirical analysis of DNS privacy disclosure problems by exploring potential privacy leaking paths in the DNS. Then we further identify and describe multiple criterions of validity systematically that are obligated when considering DNS privacy preservation. Finally, we propose a simple DNS privacy preserving solution with significant deployment potential in the current DNS, which can only lead to a moderate level of extra query latency perceived by end users.

Content-Centric Networking (CCN) as a content-oriented network architecture can provide efficient content delivery via its in-network caching. However, it is not optimal way to cache contents at all intermediate routers for that the current technology is not yet ready to support an Internet scale deployment. Therefore, in this paper we study the cache location selection problem with an objective to maximize cache delivery performance while minimize the cache nodes. The existing work select cache location based on the important of single node rather than that of entire group, which may result in inefficient problem caused by reduplicative impertinences. Therefore in this paper, we adopt group centrality especially Group Betweenness Centrality (GBC) to select cache locations. To evaluate its performance, we simulate CCN caching under different topologies, and the final results show that GBC-based scheme can provide better performance than others in term of average hop of content delivery.

Network security equipment plays an important role in preventing network security attacks. However, with the change of network environment and the upgrade of network attack means, the protection ability of the security software on the existing network security equipment will gradually decrease with time. For some large organizations or enterprises, their information security operations centers lack attention to software version control and software update processes for network security equipment, resulting in some security crises in the software update process. In this paper, we propose a method for software trusted update on network security equipment. This method can provide trusted identify authentication, secure data transmission and effective software version control. It enables the network security operations centers to more safely manage software update process on network security equipment. This method uses the functions of Trusted Cryptography Module to provide trusted execution environment. In this paper, we had introduced the process design, the prototype design and theoretical analysis to explain the feasibility and safety of this method.

Phishing is a security attack that involves the creation of websites that mimic legitimate websites, and these fraud websites bring Internet users a lot of loss. Traditional anti-phishing methods usually worked in a passive way by receiving report data of user. Due to the growing shorter survival time of phishing, this kind of methods is not efficient enough to find and take down new phishing attacks. In this paper, we propose an Intelligent Phishing Detection (IPD) system to address phishing detection problem actively. Specially, IPD first generates the detection dataset from the global massive domain name registration data automatically; then it applies the Naive Bayes algorithm which is optimized by position-based features to achieve the high precision detection; finally, in order to find more phishing websites, IPD expands detection dataset by generating Uniform Resource Locator (URL) templates based on the detection results. The experimental results of IPD demonstrate the effectiveness and timeliness in detection phishing websites.

Based on the Information-Centric Networking (ICN) concept and the mature model of the current TCP/IP-based Internet, we propose content searching based on universal and scalable resource description, namely ISBORD (Internet Searching based on Resource Description). This novel concept aims to improve the efficiency of content searching and simplifies the end-user functionality to support the evolution of the content-centric Internet.

In order to cope with the BGP (Border Gateway Protocol) security defects, RPKI (Resource Public Key Infrastructure) was proposed in IETF (Internet Engineering Task Force) in order to authenticate the relationship between IP prefix and its origination. Since 2012, a series of RPKI-related protocols have been standardized in IETF and the community has launched its actual deployment. However, with the global deployment of RPKI, a lot of concerns from technical, economic and political aspects have been raised. In this paper, we attempt to collect and analyze the most critical risks appeared during the RPKI deployment, and summarize the alternative solutions which have been presented to address or mitigate these risks.

Domain Name System (DNS) is a fundamental component of today's Internet: it provides mappings between domain names used by people and the corresponding IP addresses required by network protocols. However, the open and fundamental characteristics of DNS are recently used by the botnet for the communication between bots and C&C. In this paper, we select six kinds of special features of botnet domain querying traffic based on the deep studies of the DNS log. Then three popular classifiers are adopted in order to pick the malicious domains out from the DNS traffic using those features.

Hierarchical Mobile IPv6 (HMIPv6) is designed to reduce the handover latency and signaling load of Mobile IPv6 (MIPv6). However, HMIPv6 only improves local mobility performance while the handover latency in the inter-Mobility Anchor Point (MAP) handover is still long and packet transmission cost is still heavy due to the overlapped tunnels. In this paper, we propose a cascaded tunnel scheme in HMIPv6 to reduce its handover latency and signaling cost. In the proposed scheme, the home registration of Mobile Node (MN) is conducted by the MAP in a network-based manner and the global tunnel is established between MAP and Home Agent (HA), which allows the MN to originate only the local registration signaling even during its inter-MAP handover. The improvements contributed by the proposed scheme over the basic HMIPv6 are shown to be significant from the analyzing results.

The Publish-Subscribe Internet Technology (PURSUIT) project aims at developing a new internetworking architecture for the Future Internet. The internetworking architecture of PURSUIT has adopted a Publish-Subscribe Internet (PSI) architecture that is one of the most promising approaches to solve the current Internet's limitations including mobility support. In this paper, a new mobility support scheme is introduced to provide better handover performance for the PSI architecture. In the proposal, a branching point in a network is dynamically selected as a proxy to support seamless handover. The proxy duplicates packets (i.e., contents) from a content source to a new attachment point of a subscriber. Numerical results show that the proposed scheme provides better handover performance compared to that of the basic PSI architecture in terms of handover latency. The required handover preparation time and signaling cost of the proposed scheme are also analyzed objectively.

In order to support the object locating and information retrieving, the objects in IoT (Internet of Things) have to be named uniquely. However, due to the historical and actual reasons, there are multiple object naming schemes proposed and this heterogeneousness will continue in the future. The most serious problem of this phenomenon is that the name resolution is accordingly controlled by the special organization, and then the security and sovereignty of IoT cannot be guaranteed. Although many distributed IoT name resolution schemes have been proposed to achieve peer-to-peer equal resolution, each scheme has its fatal shortcoming to stop its actual deployment. In this paper, a novel scheme is proposed for the peer-to-peer equal name resolution in IoT, supporting the current and future heterogeneous object naming schemes. In our scheme, the Hash function is used to translate the meaningful name to a flat string without any semantic meaning. In this way, the resolution can be managed by any organization and based on any mature scheme. Then two different resolution schemes based on it are discussed and compared.

In Proxy Mobile IPv6 (PMIPv6) network, proxy registrations are performed even for idle Mobile Nodes (MNs), resulting in unnecessary signaling traffic. Although there have been many IP paging techniques aimed at reducing the unnecessary location updates, they mainly focused on Mobile IP (MIP) since it has been developed before PMIPv6 was proposed. To further promote the efficiency of PMIPv6, we propose a localized paging scheme, which pages the idle MN through the Mobility Access Gateway (MAG) and the operation is transparent to the Local Mobility Anchor (LMA). In this way, the bottleneck risk at LMA can be avoided, without the huge requirements of buffer and paging singling cost. We also develop a thorough analytical model for evaluating the performance of the proposed scheme. The results demonstrate that our paging scheme can significantly reduce the signaling cost for IP paging, compared with that of a mature paging scheme managed by LMA.

Name service is one of the most important parts for ID/Resource management in Internet of Things (IoT). Many countries and organizations have designed different naming schemes to identify their own resources, such as Object Name Service (ONS) in EPCGlobe. However, there are some issues in the current solutions, such as incompatibility of identity codes and single-root name service. In this paper, we designed and implemented a public Resource Name Service (RNS) platform to provide a compatible and equitable name service for the IoT. And then, we discuss the services provided by RNS, such as resource locating service, auxiliary authentication service and anti-counterfeiting service, in order to illustrate that our proposed RNS can support rich applications for the end user and is a promising scheme for the name service in IoT.

Domain Name System (DNS) cache poisoning is a kind of computer hacking attack, whereby data are introduced into a DNS name server's cache database, causing the name server to return an incorrect IP address, diverting traffic to another computer (often controlled by the attacker). In this paper, a novel scheme is proposed in order to make the recursive server more intelligent to handle the cache poisoning attacks. The cache-splitting is adopted in the proposed scheme, in which the credible cache is used to maintain the trustful answers while the incredible cache is used to temporarily maintain the suspicious responses. After the possible attack disappears, the recursive server will resolute the names contained in the incredible cache once again and cache the new answers into the credible cache as usual. The analyzing results show that the recursive serer can handle the responses according to the actual conditions and make use of the caching to optimize the DNS resolutions at the same time.

International audience; In order to cope with challenging problems faced by traditional multicast routing protocols, many Branching-Router (BR) based multicast routing schemes with desirable features have been proposed. However, the current BR-based methods still lack efficient multicast management and suffer from a long join latency, leading to a disappointing mobility performance. In this paper, we propose a novel BR-based multicast architecture with a corresponding multicast routing protocol supporting multicast receiver mobility. In the proposed multicast architecture, a new management entity called Multicast Controller (MC) is used to handle most of the multicast management-related tasks, while other routers in the network construct a multicast tree according to the proposed Branching-Router based Multicast routing protocol with Mobility support (BRMM). Besides, the fast handover of multicast service can be supported by BRMM through the pre-establishment of temporary multicast paths. Through extensive simulation and analysis, we show that BRMM outperforms existing protocols and has many other attractive features.

In this paper, we propose a mobile multicast architecture with management support. In this architecture, a powerful entity called Multicast Controller (MC) is deployed which handles most of the multicast management-related tasks. Based on this architecture, the mobile multicast routing protocol called Fast Chain Mobile Multicast (FCMM) is proposed, which processes the handover in advance and spans the multicast tree using the forwarding chain. Our analysis demonstrates that the FCMM protocol outperforms other related protocols and is a promising alternative for providing efficient and flexible mobile multicast services.

In this paper, we propose a network mobility supporting scheme (N-NEMO) in Proxy Mobile IPv6 (PMIPv6) network, which is an issue still up in the air for the PMIPv6. In the N-NEMO, a tunnel splitting scheme is used to differentiate the inter-Mobility Access Gateway (MAG) and intra-MAG mobility. The performance analysis and comparison between other related schemes show that N-NEMO reduces the signaling cost significantly. Besides, it enhances the efficiency and scalability to provide the comprehensive network mobility in the PMIPv6 context.

With the development of WLAN (Wireless Local Area Network) technologies, many hotspots have been deployed and mobile devices can get Internet services through WLAN in many places. Some schemes based on the RSS (receive signal strength) have been proposed to provide the seamless handover between WLANs. However, they can not avoid the ping-pong effect, and the handover performance is always influenced, especially when the handover is performed between adjacent cells which are not overlapping with each other very well. So in this paper, we propose a CDMA- assisted handover scheme (CAHO) for WLAN, which uses the CDMA connection during the handover. To evaluate the performance of CAHO, we set up a test-bed and compare it with other schemes. The experimental results show that the CAHO can reduce disruptions and lost packets. Furthermore, it can avoid the ping-pong handovers effectively.

To alleviate the problem of sub-optimal routing and multiple encapsulations in nested mobile network, a hierarchical based route optimization scheme (HBRO) is proposed. Root mobile router (MR) works as mobility anchor point (MAP) and transmits packets for the mobile network nodes (MNNs). Following advantages can be achieved with this scheme: 1) correspondent node (CN) transmits packet directly to MAP, bypassing all of the home agents (HA) of MRs; 2) tunnel exists only inside the mobile network. We build an analysis model for for performance evaluation, and the analysis results indicate that packet delivery overhead decreases significantly, and the delivery efficiency is beyond 80 percent when packet size is larger than 200 bytes and network resources are utilized to a great extent.