Search

Your search keyword '"Baiocchi, Andrea"' showing total 318 results
Start Over Author "Baiocchi, Andrea"
318 results on '"Baiocchi, Andrea"'

110. YeAH-TCP: Yet Another Highspeed TCP

Author

Baiocchi, Andrea, Castellani, ANGELO PAOLO, and Vacirca, Francesco

Subjects
High Bandwidth-Delay Product Network, TCP
Published
2007

113. A modular cross-layer scheduling and resource allocation architecture for OFDMA system

Author

Todini, Alfredo, Moretti, M, Valletta, Andrea, and Baiocchi, Andrea

Subjects
Orthogonal frequency division multiplexing, Packet networks, Scheduling, Channel state information,Packet networks,Resource allocation,Scheduling,Packet scheduling,Radio resource allocation,Short-term efficiency,Orthogonal frequency division multiplexing, Channel state information, Packet scheduling, Short-term efficiency, Resource allocation, Radio resource allocation
Published
2006

116. Design and Analysis of A Beacon-Less Routing Protocol for Large Volume Content Dissemination in Vehicular Ad Hoc Networks.

Author

Miao Hu, Zhangdui Zhong, Minming Ni, and Baiocchi, Andrea

Subjects
NETWORK routing protocols, VEHICULAR ad hoc networks, OVERTAKING, RADIO links, END-to-end delay
Abstract

Large volume content dissemination is pursued by the growing number of high quality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors' best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well. [ABSTRACT FROM AUTHOR]

Published
2016
Full Text
View/download PDF

131. TROPIC-D21 Scenario and Requirements

Author

Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Becvar, Zdenek, Vondra, Michal, Dolezal, Jakub, Mach, Pavel, Rohlik, Matej, Agustín de Dios, Adrián, Lagén Morancho, Sandra, Muñoz Medina, Olga, Pascual Iserte, Antonio, Torrellas Socastro, Marc, Vidal Manzano, José, Lobillo Vilela, Felicia, Juan, Ana, Puente, Miguel Angel, Simamora, Lamhot, Anugrahani, Melani, Kelana, Eka, Hariyanto, Hari, Ari Wibowo, Franciscus X., Ludfy, Ahmad, Budiono, Karno, Nainggolan, Lesmin, Chandra, Lunel, Goldhammer, Mariana, de Marinis, Enrico, Gambetti, Fabrizio, Lo Presti, D., Mei, Alessandro, Stefa, Julinda, Vivier, Guillaume, Sezginer, Serdar, Sarkiss, Mireille, Barbarossa, Sergio, di Lorenzo, Paolo, Sardellitti, Stefania, Baiocchi, Andrea, Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Becvar, Zdenek, Vondra, Michal, Dolezal, Jakub, Mach, Pavel, Rohlik, Matej, Agustín de Dios, Adrián, Lagén Morancho, Sandra, Muñoz Medina, Olga, Pascual Iserte, Antonio, Torrellas Socastro, Marc, Vidal Manzano, José, Lobillo Vilela, Felicia, Juan, Ana, Puente, Miguel Angel, Simamora, Lamhot, Anugrahani, Melani, Kelana, Eka, Hariyanto, Hari, Ari Wibowo, Franciscus X., Ludfy, Ahmad, Budiono, Karno, Nainggolan, Lesmin, Chandra, Lunel, Goldhammer, Mariana, de Marinis, Enrico, Gambetti, Fabrizio, Lo Presti, D., Mei, Alessandro, Stefa, Julinda, Vivier, Guillaume, Sezginer, Serdar, Sarkiss, Mireille, Barbarossa, Sergio, di Lorenzo, Paolo, Sardellitti, Stefania, and Baiocchi, Andrea

Abstract

This deliverable defines general framework for consequent technical workpackages in TROPIC. First, scenarios from the business point of view are defined and further transformed to more technical representation. Then, abstraction models are introduced for both communication and computation parts of femto-cloud concept. Furthermore, requirements need to be met to ensure efficient and feasible utilization of the femto-cloud are presented. To enable prove of the femto-cloud concept and to compare the developed techniques and algorithms a set of performance indicators to be considered in all technical workpackages are listed and defined. To that end, the models and simulation settings are defied in the last section of the document, Preprint

Published
2013

134. Joint channel and traffic adaptive packet scheduling over multiaccess radio interfaces

Author

Baiocchi, Andrea, Cuomo, Francesca, and Martello, C.

Subjects
business.industry, Code division multiple access, Computer science, Wireless network, Quality of service, Dynamic priority scheduling, Proportionally fair, Round-robin scheduling, Fair-share scheduling, Scheduling (computing), Two-level scheduling, Wireless, Resource management, business, algorithms, communication channels, quality of service, radio stations, telecommunication traffic, wireless telecommunications systems, Computer network, Communication channel
Abstract

In the third generation wireless access systems the objective of integrating service classes with different QoS requirements introduces efficient and fair capacity sharing issues. We present a general packet scheduling, called CHAOS (channel adaptive open scheduling) whose objectives are to be adaptive to traffic and so fair with respect to different users, to be adaptive to channel quality in order to improve the radio resources utilization, and to use simple algorithms to realize the previous two goals. One key point in the definition of such a scheduling is the knowledge of the channel state: in fact on the basis of the adopted channel model a prediction criteria must be identified.

Published
2002

142. FREEDOM D3.2 Interference Coordination Protocols in Femto-based Networks

Author

Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Agustín de Dios, Adrián, Muñoz Medina, Olga, Vidal Manzano, José, Goldhammer, Mariana, Rodríguez Fonollosa, Javier, Pastore, Adriano, Sardellitti, Stefania, Pescosolido, Loreto, di Lorenzo, Paolo, Barbarossa, Sergio, Baiocchi, Andrea, de Marinis, Enrico, Imponente, Giovanni, Pucci, Fabrizio, Rosi, Guido, Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Agustín de Dios, Adrián, Muñoz Medina, Olga, Vidal Manzano, José, Goldhammer, Mariana, Rodríguez Fonollosa, Javier, Pastore, Adriano, Sardellitti, Stefania, Pescosolido, Loreto, di Lorenzo, Paolo, Barbarossa, Sergio, Baiocchi, Andrea, de Marinis, Enrico, Imponente, Giovanni, Pucci, Fabrizio, and Rosi, Guido

Abstract

This document looks into coordinated radio resource allocation algorithms in deployments of huge number of femto-access points (FAP) by exploiting the message exchange at control-plane level through the wired ISP backhaul link., This document looks into coordinated radio resource allocation algorithms in deployments of huge number of femto-access points (FAP) by exploiting the message exchange at control-plane level through the wired ISP backhaul link. The algorithms present in this document are based on decentralized cooperative strategies supported by Game Theory. Decentralized resource allocation algorithms based on price exchange have been derived under different criteria: guaranteeing a minimum rate with the minimum power, maximizing the weighted sum-rate of the system, maximizing the opportunistic throughput when there are different source of randomness like random link failures and noise quantization or when the activity of macro-users is not known by FAPs (coordinated channel sensing or modelling the activity). Additionally, a genetic-based resource allocation is investigated, providing centralized and decentralized algorithms, to which the Game Theory solutions are challenged . In all cases, the techniques derived require modifications of the current LTE-A standard which are identified. Finally, some of those algorithms have been evaluated in a realistic corporate scenario elucidating the advantages of coordinated resource allocation techniques proposed., Preprint

Published
2011

143. FREEDOM Project. Interference coordination protocols in femto-based networks

Author

Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Rosi, Guido, Pucci, Fabrizio, Imponente, Giovanni, de Marinis, Enrico, Baiocchi, Andrea, Barbarossa, Sergio, di Lorenzo, Paolo, Agustín de Dios, Adrián, Muñoz Medina, Olga, Vidal Manzano, José, Goldhamer, M., Rodríguez Fonollosa, Javier, Pastore, A., Sardellitti, Stefania, Pescosolido, Loreto, Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions, Rosi, Guido, Pucci, Fabrizio, Imponente, Giovanni, de Marinis, Enrico, Baiocchi, Andrea, Barbarossa, Sergio, di Lorenzo, Paolo, Agustín de Dios, Adrián, Muñoz Medina, Olga, Vidal Manzano, José, Goldhamer, M., Rodríguez Fonollosa, Javier, Pastore, A., Sardellitti, Stefania, and Pescosolido, Loreto

Abstract

This document looks into coordinated radio resource allocation algorithms in deployments of huge number of femto-access points (FAP) by exploiting the message exchange at control-plane level through the wired ISP backhaul link. The algorithms present in this document are based on decentralized cooperative strategies supported by Game Theory. Decentralized resource allocation algorithms based on price exchange have been derived under different criteria: guaranteeing a minimum rate with the minimum power, maximizing the weighted sum-rate of the system, maximizing the opportunistic throughput when there are different source of randomness like random link failures and noise quantization or when the activity of macro-users is not known by FAPs (coordinated channel sensing or modelling the activity). Additionally, a genetic-based resource allocation is investigated, providing centralized and decentralized algorithms, to which the Game Theory solutions are challenged. In all cases, the techniques derived require modifications of the current LTE-A standard which are identified. Finally, some of those algorithms have been evaluated in a Realistic corporate scenario elucidating the advantages of coordinated resource allocation techniques proposed., Peer Reviewed, Postprint (author’s final draft)

Published
2011

Catalog

Books, media, physical & digital resources
See catalog results