This paper presents a novel “virtual fiber” network service that exploits wavebands. This service provides virtual direct tunnels that directly convey wavelength paths to connect customer facilities. To improve the resource utilization efficiency of the service, a network design algorithm is developed that can allow intermediate path grooming at limited nodes and can determine the best node location. Numerical experiments demonstrate the effectiveness of the proposed service architecture.

In this paper, we suggest a new technology called Content Anycasting, and we show our design and evaluation of it. Content Anycasting shows how to utilize the capabilities of one of the candidate future Internet technologies that is the Flow-based network as in OpenFlow to giving new opportunities to the future internet that are currently not available. Content Anycasting aims to provide more flexible and dynamic redirection of contents. This would be very useful in extending the content server's capacity by enabling it to serve more clients, and in improving the response of the P2P networks by reducing the time of joining P2P networks. This method relies on three important ideas which are; the content based networking, decision making by the network in a similar manner to anycast, and the participation of user clients in providing the service. This is done through the use of the flow-based actions in flow-based network and having some modifications to the content server and client.

Wireless sensor networks are comprised of several sensor nodes that communicate via wireless technology. Locating the sensor nodes is a fundamental problem in developing applications for wireless sensor networks. In this paper, we introduce a distributed localization scheme, called the Rectangle Overlapping Approach (ROA), using a mobile beacon with GPS and a directional antenna. The node locations are computed by performing simple operations that rely on the rotation angle and position of the mobile beacon. Simulation results show that the proposed scheme is very efficient and that the node positions can be determined accurately when the beacon follows a random waypoint movement model.

Due to the lack of end-to-end paths between the communication source and destination in the Disruption Tolerant Network (DTN), its routing employs the store-carry-and-forward mechanism. In order to provide communication service in the DTN where there is only intermittent connectivity between nodes, a variety of epidemic-style routing algorithms have been proposed to achieve high message delivery probability at the cost of energy consumption. In this contribution, we investigate the problem of optimal multi-frame content transmission. By formulating the optimization problem with a Markov model, we derive the optimal policies under the two conditions of with and without energy constraint. We also investigate the performance of the proposed optimal policies through extensive numerical analyses, and conclude that the optimal policies give the best performance and the energy constraint critically degrades the system performance in the multi-frame content transmission.

Rapid developments in mobile technology have transformed mobile phones into mobile multimedia devices. Due to these advancements, user created mobile content is on the increase, both in terms of quality and quantity. To keep pace with such movements, the new networking technology named content centric networking (CCN), which is optimized for content sharing, has appeared. However, it virtually ignores mobile devices. So, this letter proposes a smooth mobile content migration scheme for CCN to provide lower communication overhead and shorter download time.

In research community of content distribution, a new communication paradigm of rendezvous-based abstraction which easily enables location-free content-oriented services, attracts great attention. ID/Locator separation architecture is originally proposed for resolving increase of routing table size in the current Internet but it has possibility of supporting this abstraction because host ID is clearly separated from its location. This feature of ID/Locator separation means an end host can be identified by ID independent of its network layer protocol. So, ID/Locator separation architecture enables communication with end host(s) operating different network-layer protocol, which might increase candidate paths between host pairs and improve content distribution path. In this paper, we evaluate this improvement of shortest path brought by inter-layer 3 networking. In inter-layer 3 networking, a shared node connecting different network layer plane plays an important role. We evaluate shortest path improvement with various shared node locations and show that strategic assignment of shared nodes brings large improvement. When multiple layer 3 networks are available for users, shortest path might be improved even only with multi-homing (without inter-layer 3 networking). We also evaluate shortest path improvement brought by multi-homing and inter-layer 3 networking for incremental deployment scenario of multi-homing. Our simulation results show that inter-layer 3 networking brings great improvement even with small number of users deploying multi-homing while only multi-homing itself brings small improvement.

In this paper, we are concerned about content-based networking (CBN) at extreme scales, characterized by a large number of widely spread consumers, heterogeneous consumer requirements, huge volume of publications, and the scarcity of end-to-end bandwidth. We extend CBN with a generic service model that allows consumers to express their interests in future publications including cached content, but also to quantify the maximum amount of information they are willing to consume. We take advantage of this knowledge to pace the dissemination process and therefore, enhance the service efficiency. Early evaluation results show gains of up to 80% compared to a baseline CBN model.

In this paper, we describe several approaches to address the challenges of the network of the future. Our main hypothesis is that the Future Internet must be designed for the environment of applications and transport media of the 21st century, vastly different from the initial Internet's life space. One major requirement is the inherent support for mobile and wireless usage. A Future Internet should allow for the fast creation of diverse network designs and paradigms and must also support their co-existence at run-time. We detail the technical and business scenarios that lead the development in the EU FP7 4WARD project towards a framework for the Future Internet.

In the present paper, we propose an evolutionary P2P networking technique that dynamically and adaptively optimizes several P2P network topologies, in which all of the nodes are included at the same time, in an evolutionary manner according to given evaluation criteria. In addition, through simulations, we examine whether the proposed evolutionary P2P networking technique can provide reliable search capability in dynamic P2P environments. In simulations, we assume dynamic P2P environments in which each node leaves and joins the network with its own probability and in which search objects vary with time. The simulation results show that topology reconstruction by the evolutionary P2P networking technique is better than random topology reconstruction when only a few types of search objects are present in the network at any moment and these search objects are not replicated. Moreover, for the scenario in which the evolutionary P2P networking technique is more effective, we show through simulations that when each node makes several links with other nodes in a single network topology, the evolutionary P2P networking technique improves the reliable search capability. Finally, the number of links that yields more reliable search capability appears to depend on how often nodes leave and join the network.

Recently, bluetooth technology has become widely prevalent so that many laptops and mobile phones are equipped with bluetooth capability. In order to meet the increasing demand to interconnect these devices a new scatternet formation protocol named GBSFP (General Bluetooth Scatternet Formation Protocol) is proposed in this paper. GBSFP is the result of efforts to overcome the two major limitations of the legacy scatternet formation protocols as regards their real implementation, that all of the nodes should be within the Bluetooth communication range or that they should be time synchronized. In GBSFP, a node goes through three phases; 1) the Init phase to establish a bluetooth link to as many of its neighbors as possible, 2) the Ready phase to determine the role of each node, i.e., master or slave, and remove any unnecessary bluetooth links, and 3) the Complete phase to finalize the formation of the scatternet and begin data transmission. The simulation results show that GBSFP provides higher connectivity in many scenarios compared with BTCP and BlueStars.

Access to information is taken for granted in urban areas covered by a robust communication infrastructure. Nevertheless most of the areas in the world, are not covered by such infrastructures. We propose a DTN publish and subscribe system called Hikari, which uses nodes' mobility in order to distribute messages without using a robust infrastructure. The area of Disruption/Delay Tolerant Networks (DTN) focuses on providing connectivity to locations separated by networks with disruptions and delays. The Hikari system does not use node identifiers for message forwarding thus eliminating the complexity of routing associated with many forwarding schemes in DTN. Hikari uses nodes paths' information, advertised by special nodes in the system or predicted by the system itself, for optimizing the message dissemination process. We have used the Paris subway system, due to it's complexity, to validate Hikari and to analyze it's performance. We have shown that Hikari achieves a superior deliver rate while keeping redundant messages in the system low, which is ideal when using devices with limited resources for message dissemination.

This paper presents a new cycle time synchronization method to transmit isochronous multimedia data by real time in IEEE 1394 over a UWB (ultra wide-band) network. The 1394 TA recommended two methods for the cycle time synchronization. The first method must use two consecutive beacon signals to calculate a drift correction, while the second one eliminates this dependency with minor algorithm changes. As experimental results, the second method achieves 21% performance improvement over the first one. The receipt of two consecutive beacons every time is hard due to the noise in a wireless channel. In addition, this paper provides the procedure of cycle time synchronization, as well as the transaction between 1394 protocol adaptation layer and IEEE 802.15.3 media access layer. The proposed synchronization technique will contribute to transfer isochronous data at IEEE 1394 over UWB audio/visual appliances such as camcorder, HDTV, etc.

In this article, we introduce a new concept for the future information environment, called an "ambient information environment (AmIE)." We first explain it, especially emphasizing the difference from the existing ubiquitous information environment (UbIE), which is an interaction between users and environments. Then, we focus on an ambient networking environment (AmNE) which supports the AmIE as a networking infrastructure. Our approach of a biologically inspired framework is next described in order to demonstrate why such an approach is necessary in the AmIE. Finally, we show some example for building the AmNE.

In past, dependable networks meant minimizing network outages or the impact of the outages. However, over the decade, major network services have shifted from telephone and data transmission to Internet and to mobile communication, where higher layer services with a variety of contents are provided. Reviewing these backgrounds of network development, the importance of the dependability of higher layer network services are pointed out. Then, the main aspects to realize the dependability are given for lower, middle and higher layer network services. In addition, some particular issues for dependable networks are described.

This paper presented a new method to transfer isochronous data through an IEEE 1394 over UWB (ultra wideband) network. The goal of this research is to implement a complete heterogeneous system without commercial IEEE 1394 link chips supporting the bridge-aware function. The method resolving this dedicated chip-less situation, was employed a new bridge adapting a pseudo connection management protocol (CMP). This approach made a wired 1394 devices as an IEEE 1394 over UWB device. This method allowed an IEEE 1394 equipment to transfer an isochronous data using a UWB wireless communication network. The result of this approach was demonstrated successfully via an IEEE 1394 over UWB bridge module. The proposed CMP and IEEE 1394 over UWB bridge module can exchange isochronous data through an IEEE 1394 over UWB network. This method makes an IEEE 1394 equipment transfer an isochronous data using a UWB wireless channel.

This paper presents an automatic edge segment based algorithm for the detection of moving objects that has been specially developed to deal with the variations in illumination and contents of background. We investigated the suitability of the proposed edge segment based moving object detection algorithm in comparison with the traditional intensity based as well as edge pixel based detection methods. In our method, edges are extracted from video frames and are represented as segments using an efficiently designed edge class. This representation helps to obtain the geometric information of edge in the case of edge matching and shape retrieval; and creates effective means to incorporate knowledge into edge segment during background modeling and motion tracking. An efficient approach for background edge generation and a robust method of edge matching are presented to effectively reduce the risk of false alarm due to illumination change and camera motion while maintaining the high sensitivity to the presence of moving object. The proposed method can be successfully realized in video surveillance applications in home networking environment as well as various monitoring systems. As, video coding standard MPEG-4 enables content based functionality, it can successfully utilize the shape information of the detected moving objects to achieve high coding efficiency. Experiments with real image sequences, along with comparisons with some other existing methods are presented, illustrating the robustness of the proposed algorithm.

In ad-hoc networks, mobile nodes are limited by a range of radio coverage and have an irregular source of power due to their battery. In ad-hoc networks, there are a lot of situations that all mobile nodes need to agree on their key not at the same time but in part and then merge themselves subsequently. This is because ad-hoc networks have specific features such as mobility and allow various conditions during configuration. In this thesis, we propose MCP (Merging Clusters Protocol), a simple key agreement scheme that can effectively deal with merging different adjacent clusters in mobile ad-hoc networks. When nodes of each cluster have already agreed on their own group keys and intend to merge themselves for further secure communications, MCP can be used in an efficient and secure way. In addition, it can be utilized for efficient group key agreement in a large ad-hoc network. We analyze the security and efficiency of MCP and discuss the experimental results according to practical implementation scenarios.

In heterogeneous mobile networks, infrastructure multihop techniques enable mobile stations (MSs) with only a single wireless interface to connect with other networks via multiple-interface MSs (MMSs). That is, MMSs can become gateways between two different mobile networks. Cooperation between different mobile networks linked by MMSs can yield many benefits, including coverage expansion, load balancing, and throughput improvement. We studied how to control these cooperative benefits. We developed a network control mechanism, Cooperative Networking, which controls the cooperative benefits in heterogeneous infra-multihop networks. The proposed mechanism assigns a cooperation rule to MSs. By following the rule, every MS chooses a path to a base station, such as direct connection to 3G networks or infra-multihop connection to wireless local area networks (WLANs). Cooperation rules are designed according to the cooperative benefits, which are selected based on the needs of network operators or users. We call a selected cooperative benefit a networking policy. In our proposed cooperative networking mechanism, network operators can adaptively select a networking policy appropriate for network conditions and the needs of users. Computer simulation results validated our proposed mechanism.

Content-based publish/subscribe systems provide a useful alternative to traditional address-based communication due to their ability to decouple communication between participants. It has remained a challenge to design a scalable overlay supporting the complexity of content-based networks, while satisfying the desirable properties large distributed systems should have. This paper presents the design of Mirinae, a new structured peer-to-peer overlay mesh based on the interests of peers. Given an event, Mirinae provides a flexible and efficient dissemination tree minimizing the participation of non-matching nodes. We also present a novel ID space transformation mechanism for balancing routing load of peers even with highly skewed data, which is typical of the real world. Our evaluation demonstrates that Mirinae is able to achieve its goals of scalability, efficiency, and near-uniform load balancing. Mirinae can be used as a substrate for content-search and range query in other important distributed applications.

Differentiated-services model has been prevailed as a scalable solution to provide quality of service over the Internet. Many researches have been focused on per hop behavior or a single domain behavior to enhance quality of service. Thus, there are still difficulties in providing the end-to-end guaranteed service when the path between sender and receiver includes multiple domains. Furthermore differentiated-services model mainly considers quality of service for traffic aggregates due to the scalability, and the quality of service state may be time varying according to the network conditions in the case of relative service model, which make the problem more challenging to guarantee the end-to-end quality-of-service. In this paper, we study class mapping mechanisms along the path to provide the end-to-end guaranteed quality of service with the minimum networking price over multiple differentiated-services domains. The proposed mechanism includes an effective implementation of relative differentiated-services model, quality of service advertising mechanism and class selecting mechanisms. Finally, the experimental results are provided to show the performance of the proposed algorithm.