The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The virtual network embedding problem is mainly concerned with assigning virtual networks onto the substrate network reasonably and efficiently. This paper proposes a virtual network mapping algorithm combining greedy virtual node mapping and virtual link mapping based on the weighted multi-commodity flow (WMCF). The cost coefficient of the multi-commodity flow problem is weighted by the ratio of...
Connection of wireless sensor and actuator networks (WSANs) to the Internet will enable information flow to these once isolated networks. Distributed Ambient Intelligence (AmI) applications, such as remote monitoring and control services, would become possible if Internet connectivity of WSANs is achieved. However, realization of such applications remains challenging with three major obstacles. First,...
Contention is the main source of information loss in buffer-less network architectures where deflection routing is a viable contention resolution scheme. In recent years, various reinforcement learning-based deflection routing algorithms have been proposed. However, performance of these algorithms has not been evaluated in larger networks that resemble the autonomous system-level topology of the Internet...
We consider the problem of designing content-caching strategies for the energy-efficient delivery of content such as video, over an internet-style network. We propose a method for the design of decentralized caching strategies that can adapt to real-time changes in regional content popularity. This design method is based on a recently proposed reduced consensus-optimization scheme wherein a number...
The Low Extra Delay Background Transport (LEDBAT) protocol is a recently standardized protocol that aims to offer a scavenger service (i.e. the goal is to exploit the remaining and unused capacity of a link). LEDBAT is a delay-based protocol mainly defined by two parameters: a target queuing delay and a gain. The RFC 6817 provides guidelines to configure both parameters that strongly impact on the...
E-commerce has become one of the common commercial activities in people's daily lives. The major advantage of e-commerce over conventional commercial activities is the information transparency while people can freely share their opinions and comments. Such information has profound influence on user behaviors in e-commerce activities. Meanwhile, social network service (SNS) has also become the most...
It has become a common practice that enterprises outsource their networks to the cloud by renting multiple virtual machines (VMs) in cloud datacenters. Due to the multi-tenant nature of cloud datacenter, how to efficiently share the network resources becomes an important issue. Recent studies, e.g., SecondNet and Oktopus, have taken network bandwidth into consideration when allocating VMs. However,...
Current Internet performs traffic engineering (TE) by estimating traffic matrices on a regular schedule, and allocating flows based upon weights computed from these matrices. This means the allocation is based upon a guess of the traffic in the network based on its history. Information-Centric Networks on the other hand provide a finer-grained description of the traffic: a content between a client...
The scalability of the global routing system is critical for the evolution of the Internet, and consequently, BGP scalability has been part of the Internet research agenda from long ago. The original concern was the growth of the routing table size, and more recently, the research community has also been considering the growth of the BGP churn, i.e. the number of messages that are generated by the...
Botnets are a well recognized global cyber-security threat as they enable attack communities to command large collections of compromised computers (bots) on-demand. Peer to-peer (P2P) distributed hash tables (DHT) have become particularly attractive botnet command and control (C & C) solutions due to the high level resiliency gained via the diffused random graph overlays they produce. The...
The ability to extract topology information from the network is important for many applications and enables more informed resource selection. The challenge for topology exposure is to provide a compact representation that is sufficiently accurate and complies to topology hiding policies. This paper presents a topology abstraction system that can expose large-scale service provider network maps with...
Scalable routing schemes for large-scale networks, especially future Internet, are required. Geometric routing scheme is a promising candidate to solve the scalability issue of routing tables in conventional IP routing based on longest prefix matching. In this scheme, network nodes are assigned virtual coordinates and packets are forwarded towards their intended destination following a distance-decreasing...
An algorithm on automatic topology discovery in OpenFlow supported software defined networks is proposed. The proposed algorithm utilizing link layer discovery protocol allows to obtain the whole network topology by the network controller. We have validated the successful operation of our algorithm through simulation and real network tests seperately, and shown that it scales linearly.
Due to the in-network caching capability, Content-Centric Networking (CCN) has emerged as one of the most promising architectures for the diffusion of contents over the Internet. In this paper, we propose an energy-efficient distributed in-network caching scheme for CCN. In the proposed scheme, each content router only needs locally available information to make caching decisions considering both...
The deployment and operation of global network architectures can exhibit complex, dynamic behavior and the comprehensive validation of their properties, without actually building and running the systems, can only be achieved with the help of simulations. Packet-level models are not feasible in the Internet scale, but we are still interested in the phenomena that emerge when the systems are run in...
IPv6 Neighbor Discovery (ND) based on RFC 4861 is not designed for non-transitive wireless links. Its heavy use of multicast transmission makes it inefficient and sometimes impractical for IPv6 over Low power Wireless Personal Area Networks (6LoWPAN). Recently, further optimizations have been proposed by Internet Engineering Task Force (IETF) to make ND more suitable for 6LoWPAN. In this paper, we...
Data delivery across a multi-hop low-power and lossy networks (LLNs) is a challenging task: devices participating in such a network have strictly limited computational power and storage, and the communication channels are of low capacity, time-varying and with high loss rates. Consequently, routing protocols finding paths through such a network must be frugal in their control traffic and state requirements,...
The objective of this work is to suggest the self-organizing algorithm by communication nodes with topological information. This paper describes the noble concept of future Internet architecture, graph contraction based self-organizing networks and the topology-aware address. The proposed network principle abstracts logical layers from large-scale physical networks with topological characteristic...
As the Internet takes an increasingly central role in day to day communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, it presents a new recovery scheme called Multiple Routing Configurations (MRC). The proposed scheme guarantees recovery in all single failure scenarios,...
The effectiveness of service provisioning in large-scale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated -median (UKM) problem (if the requested number of facilities is fixed— ) or the uncapacitated facility location (UFL)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.