The scalability issues the global routing system has been experienc- ing over the past years have raised serious concerns in the Internet community. One of the main culprits for the rapidly growing BGP routing table is the defragmentation process of the address blocks allocated to ASes, also known as prefix deaggreation. The Internet is a complex system and understanding its behavioural evolution is certainly a challenging task. For this reason, the use of eco- nomic models can provide intuitive explanations of the complex interactions between networks that result in the aforementioned phenomenon of prefix deaggreation. In this paper, we propose a game theoretic model to analyze the incentives behind the deag- gregating strategies of the networks. Announcing more-specific prefixes in the Internet impacts the size of the global routing table and increases the network operators’ capital expenditure for rout- ing equipment capable of sustaining the growing Internet. How- ever, we prove that the ASes are driven by fundamental economic reasons towards this type of apparently harming behaviour. We find that by announcing more prefixes the originating network achieves a more predictable traffic pattern and reduces the peak levels of bandwidth consumption. We show that this happens because, both in the equilibrium point and the social welfare point, the cost re- duction achieved by smoothing the traffic distribution outweighs the additional cost incurred by the routing table expansion.
Read more arrow_right_altThe second Workshop on "far out" research ideas of the institute is to be held on January 19th, 2011. The purpose of the second edition of this series of workshops is to have researchers from the institute present very innovative ideas that could lead to internal projects or even the offspring of a full line of research. The sessions encourage brain-storming around the ideas presented, in order to help give them shape and evaluate their potential.
Read more arrow_right_altCarrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The only difference between CSMA/ECA and the well-known CSMA/CA is that the former uses a deterministic backoff after successful transmissions. Collision-free operation is reached after a transient state during which some collisions may occur. This article shows that the duration of the transient state can be shortened by appropriately setting the contention parameters. Standard absorbing Markov Chain theory is used to describe the behaviour of the system in the transient state and to predict the expected number of slots to reach the collision-free operation.
Read more arrow_right_altThe seminar will cover essential aspects of tech-based entrepreneurship, with special regard to ventures in the field of ICTs.
Resources for entrepreneurs at UC3M within the Campus del Emprendedor UC3M Programme will be detailed. An inspiring speech by young entrepreneurs from our Business Incubator will stimulate a discussion with attendees.
Read more arrow_right_alt
In this talk I will briefly overview the research topics I have been working on, as well as describe new topics I recently began looking into. The former includes behavior-based Internet worm detection, Internet routing forensics, IP spoofing prevention, and trusted and incentivized peer-to-peer data sharing between distrusted and selfish clients. The latter includes reliable IP prefix monitoring, active phishing disruption, social networks for access control, security and privacy for homecare rehabilitation environments, and the clean-slate architecture design for future Internet.
The purpose of this talk is to provide a glimpse of my fights, so you can weigh which fights you would like to join me to win, or leverage my weapons to help win yours, or even better, we find and beat a common enemy.
Read more arrow_right_altCognitive radio networks (CRNs) involve extensive exchange of control messages, which are used to coordinate critical network functions such as distributed spectrum sensing, medium access, and routing, to name a few. Typically, control messages are broadcasted on a pre-assigned common control channel (e.g., a separate frequency band, a given time slot, or a spreading sequence). Such a static channel allocation policy is contrary to the opportunistic access paradigm. In this work, we address the problem of dynamically assigning the control channel in CRNs according to spatiotemporally varying spectrum opportunities. We propose a cluster-based architecture that allocates different control channels to various clusters in the network. The clustering problem is formulated as a bipartite graph problem, for which we develop a class of algorithms that provide different tradeoffs between two conflicting factors: number of common channels in a cluster and the cluster size. Clusters are guaranteed to have a desirable number of common channels for control, which facilitates graceful channel migration when primary-radio activity is detected, without the need for frequent re-clustering. We use simulations to verify the agility of our algorithms in adapting to variations in spectrum availability.
Read more arrow_right_altThe amount of redundant paths among ASes has dramatically increased throughout the Internet. Unfortunately, the unipath nature of BGP constrains border routers to course traffic across a single path at a time. Although, multipath inter- domain routing is able to provide richer routing configurations, the lack of incentives to replace BGP as inter-domain routing protocol implies that multipath solutions must be backwards compatible with BGP.
Read more arrow_right_altAbstract-Greening the communication protocols is nowadays recognized as a primary design goal of future global network infrastructures. The objective function for optimization is the amount of information transmitted per unit of energy, replacing the amount of information transmitted per unit of time (i.e., throughput). In this paper we investigate the case of IEEE 802.11- based WLANs and first show that, given the existing diversity of power consumption figures among mobile devices, performing a fair allocation of resources among devices is challenging.
Read more arrow_right_altVehicular ad hoc networks have proven to be quite useful for broadcast alike communications between nearby cars, but can also be used to provide Internet connectivity from vehicles. In order to do so, vehicle-to-Internet routing and IP address autoconfiguration are two critical pieces. TREBOL is a tree-based and configurable protocol which benefits from the inherent tree-shaped nature of vehicle to Internet traffic to reduce the signaling overhead while dealing efficiently with the vehicular dynamics.
Read more arrow_right_altBitTorrent is one of the most popular application in the current Internet. However, we still have little knowledge about the topology of real BitTorrent swarms and how the traffic is actually exchanged among peers. This paper addresses fundamental questions regarding the topology of live BitTorrent swarms. For this purpose we have collected the evolution of the graph topology of 250 real torrents from its birth during a period of 15 days. Using this dataset we first demonstrate that real BitTorrent swarms are neither random graphs nor small world networks.
Read more arrow_right_alt
Recent Comments