scispace - formally typeset
Search or ask a question
Conference

International IFIP-TC Networking Conference 

About: International IFIP-TC Networking Conference is an academic conference. The conference publishes majorly in the area(s): Quality of service & Wireless network. Over the lifetime, 460 publications have been published by the conference receiving 7431 citations.

Papers published on a yearly basis

Papers
More filters
Book ChapterDOI
15 May 2006
TL;DR: This paper proposes a novel routing protocol, called vector-based forwarding (VBF), to provide robust, scalable and energy efficient routing in Underwater Sensor Networks (UWSNs).
Abstract: In this paper, we tackle one fundamental problem in Underwater Sensor Networks (UWSNs): robust, scalable and energy efficient routing. UWSNs are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node float mobility (resulting in high network dynamics), high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. In this paper, we propose a novel routing protocol, called vector-based forwarding (VBF), to provide robust, scalable and energy efficient routing. VBF is essentially a position-based routing approach: nodes close to the “vector” from the source to the destination will forward the message. In this way, only a small fraction of the nodes are involved in routing. VBF also adopts a localized and distributed self-adaptation algorithm which allows nodes to weigh the benefit of forwarding packets and thus reduce energy consumption by discarding the low benefit packets. Through simulation experiments, we show the promising performance of VBF.

688 citations

Book ChapterDOI
05 May 2008
TL;DR: A depth-based routing (DBR) protocol that can take advantage of a multiple-sink underwater sensor network architecture without introducing extra cost and can achieve very high packet delivery ratios for dense networks with only small communication cost is proposed.
Abstract: Providing scalable and efficient routing services in underwater sensor networks (UWSNs) is very challenging due to the unique characteristics of UWSNs. Firstly, UWSNs often employ acoustic channels for communications because radio signals do not work well in water. Compared with radio-frequency channels, acoustic channels feature much lower bandwidths and several orders of magnitudes longer propagation delays. Secondly, UWSNs usually have very dynamic topology as sensors move passively with water currents. Some routing protocols have been proposed to address the challenging problem in UWSNs. However, most of them assume that the full-dimensional location information of all sensor nodes in a network is known in prior through a localization process, which is yet another challenging issue to be solved in UWSNs. In this paper, we propose a depth-based routing (DBR) protocol. DBR does not require full-dimensional location information of sensor nodes. Instead, it needs only local depth information, which can be easily obtained with an inexpensive depth sensor that can be equipped in every underwater sensor node. A key advantage of our protocol is that it can handle network dynamics efficiently without the assistance of a localization service. Moreover, our routing protocol can take advantage of a multiple-sink underwater sensor network architecture without introducing extra cost. We conduct extensive simulations. The results show that DBR can achieve very high packet delivery ratios (at least 95%) for dense networks with only small communication cost.

652 citations

Book ChapterDOI
11 May 2009
TL;DR: The hurdles in network power instrumentation are described and a power measurement study of a variety of networking gear such as hubs, edge switches, core switches, routers and wireless access points in both stand-alone mode and a production data center are presented.
Abstract: Energy efficiency is becoming increasingly important in the operation of networking infrastructure, especially in enterprise and data center networks. Researchers have proposed several strategies for energy management of networking devices. However, we need a comprehensive characterization of power consumption by a variety of switches and routers to accurately quantify the savings from the various power savings schemes. In this paper, we first describe the hurdles in network power instrumentation and present a power measurement study of a variety of networking gear such as hubs, edge switches, core switches, routers and wireless access points in both stand-alone mode and a production data center. We build and describe a benchmarking suite that will allow users to measure and compare the power consumed for a large set of common configurations at any switch or router of their choice. We also propose a network energy proportionality index, which is an easily measurable metric, to compare power consumption behaviors of multiple devices.

409 citations

Book ChapterDOI
09 May 2011
TL;DR: This paper models the caching part of the proposed networking paradigm in isolation from the rest of the suggested features of Content Centric Networks, and develops a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached.
Abstract: Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from security and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in isolation from the rest of the suggested features. In CCNs, every router caches packets of content and reuses those that are still in the cache, when subsequently requested. It is this caching feature of CCNs that we model and evaluate in this paper. Our modelling proceeds both analytically and by simulation. Initially, we develop a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached. This model is extended to multiple routers with some simple approximations. The mathematical model is complemented by simulations which look at the caching dynamics, at the packet-level, in isolation from the rest of the flow.

352 citations

Book ChapterDOI
15 May 2006
TL;DR: This paper develops a rigorous, unified framework based on Ordinary Differential Equations (ODEs) to study epidemic routing and its variations, and investigates how resources such as buffer space and power can be traded for faster delivery.
Abstract: In this paper, we develop a rigorous, unified framework based on Ordinary Differential Equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and power can be traded for faster delivery, illustrating the differences among the various epidemic schemes considered. Finally we consider the effect of buffer management by complementing the forwarding models with Markovian and fluid buffer models.

328 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
20201
20192
20173
20161
201213
201113