The Experts below are selected from a list of 114078 Experts worldwide ranked by ideXlab platform

Michela Bonacci - One of the best experts on this subject based on the ideXlab platform.

  • Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno Network Scenario
    Performance Evaluation, 2003
    Co-Authors: Andrea De Vendictis, Andrea Baiocchi, Michela Bonacci
    Abstract:

    Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of Network environments. However, these mechanisms make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas sources show high weakness in taking the available bandwidth when competing with other TCP Reno sources. This is a major reason that hinders the spread of TCP Vegas among Internet users. In this work, after a preliminary analytic study about the limits of TCP Vegas in mixed Network environments, we describe a new adaptive mechanism for TCP Vegas, called TCP NewVegas, designed in order to improve its performance even in heterogeneous Network Scenarios. The large number of simulations, presented in this paper, show that TCP New Vegas guarantees good performance even in mixed Network environments, without canceling the desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous environments.

  • Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno Network Scenario
    Performance Evaluation, 2003
    Co-Authors: Andrea De Vendictis, Andrea Baiocchi, Michela Bonacci
    Abstract:

    Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of Network environments. However, these mechanisms make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas sources show high weakness in taking the available bandwidth when competing with other TCP Reno sources. This is a major reason that hinders the spread of TCP Vegas among Internet users. In this work, after a preliminary analytic study about the limits of TCP Vegas in mixed Network environments, we describe a new adaptive mechanism for TCP Vegas, called TCP NewVegas, designed in order to improve its performance even in heterogeneous Network Scenarios. The large number of simulations, presented in this paper, show that TCP NewVegas guarantees good performance even in mixed Network environments, without canceling the desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous environments. © 2003 Elsevier Science B.V. All rights reserved

Andrea De Vendictis - One of the best experts on this subject based on the ideXlab platform.

  • Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno Network Scenario
    Performance Evaluation, 2003
    Co-Authors: Andrea De Vendictis, Andrea Baiocchi, Michela Bonacci
    Abstract:

    Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of Network environments. However, these mechanisms make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas sources show high weakness in taking the available bandwidth when competing with other TCP Reno sources. This is a major reason that hinders the spread of TCP Vegas among Internet users. In this work, after a preliminary analytic study about the limits of TCP Vegas in mixed Network environments, we describe a new adaptive mechanism for TCP Vegas, called TCP NewVegas, designed in order to improve its performance even in heterogeneous Network Scenarios. The large number of simulations, presented in this paper, show that TCP New Vegas guarantees good performance even in mixed Network environments, without canceling the desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous environments.

  • Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno Network Scenario
    Performance Evaluation, 2003
    Co-Authors: Andrea De Vendictis, Andrea Baiocchi, Michela Bonacci
    Abstract:

    Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of Network environments. However, these mechanisms make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas sources show high weakness in taking the available bandwidth when competing with other TCP Reno sources. This is a major reason that hinders the spread of TCP Vegas among Internet users. In this work, after a preliminary analytic study about the limits of TCP Vegas in mixed Network environments, we describe a new adaptive mechanism for TCP Vegas, called TCP NewVegas, designed in order to improve its performance even in heterogeneous Network Scenarios. The large number of simulations, presented in this paper, show that TCP NewVegas guarantees good performance even in mixed Network environments, without canceling the desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous environments. © 2003 Elsevier Science B.V. All rights reserved

Andrea Baiocchi - One of the best experts on this subject based on the ideXlab platform.

  • Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno Network Scenario
    Performance Evaluation, 2003
    Co-Authors: Andrea De Vendictis, Andrea Baiocchi, Michela Bonacci
    Abstract:

    Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of Network environments. However, these mechanisms make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas sources show high weakness in taking the available bandwidth when competing with other TCP Reno sources. This is a major reason that hinders the spread of TCP Vegas among Internet users. In this work, after a preliminary analytic study about the limits of TCP Vegas in mixed Network environments, we describe a new adaptive mechanism for TCP Vegas, called TCP NewVegas, designed in order to improve its performance even in heterogeneous Network Scenarios. The large number of simulations, presented in this paper, show that TCP New Vegas guarantees good performance even in mixed Network environments, without canceling the desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous environments.

  • Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno Network Scenario
    Performance Evaluation, 2003
    Co-Authors: Andrea De Vendictis, Andrea Baiocchi, Michela Bonacci
    Abstract:

    Its more refined congestion control mechanisms, also based on the estimation of round trip delays, allow TCP Vegas to outperform the more widespread TCP Reno congestion control, based only on the packet loss detection, in a number of Network environments. However, these mechanisms make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas sources show high weakness in taking the available bandwidth when competing with other TCP Reno sources. This is a major reason that hinders the spread of TCP Vegas among Internet users. In this work, after a preliminary analytic study about the limits of TCP Vegas in mixed Network environments, we describe a new adaptive mechanism for TCP Vegas, called TCP NewVegas, designed in order to improve its performance even in heterogeneous Network Scenarios. The large number of simulations, presented in this paper, show that TCP NewVegas guarantees good performance even in mixed Network environments, without canceling the desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous environments. © 2003 Elsevier Science B.V. All rights reserved

Huizhou Zhao - One of the best experts on this subject based on the ideXlab platform.

  • Wireless multi-hop Network Scenario emulation by controlling maximal error
    Frontiers of Electrical and Electronic Engineering in China, 2009
    Co-Authors: Huizhou Zhao, Wei Yan
    Abstract:

    A fundamental problem about Ad-hoc Network emulation is how to emulate a wireless multi-hop Network Scenario in a fixed testbed, which, however, is scarcely discussed in depth by existing radio frequency (RF)-control wireless Network emulators. Therefore, in this article, we first formulate the wireless multi-hop Scenario emulation problem based on RF-control, take controlling the maximal error as the solution mentality, and present an algorithm called the matching exact-solution condition algorithm. The experiment results show that the algorithm can solve the wireless multi-hop Network Scenario emulation problem and maximal error can be achieved.

  • wireless multi hop Network Scenario emulation with minmax error
    Local Computer Networks, 2006
    Co-Authors: Huizhou Zhao, Wei Yan, Tong Zhao
    Abstract:

    In this paper, we propose a novel approach to emulate an arbitrary wireless multi-hop Network Scenario in a fixed wireless testbed, in which every node is equipped with a variable attenuator. We formulate the core problem of wireless multi-hop Network Scenario emulation as a constrained optimization problem and propose an optimum algorithm.

  • LCN - Wireless Multi-hop Network Scenario Emulation with MinMax Error
    Proceedings. 2006 31st IEEE Conference on Local Computer Networks, 2006
    Co-Authors: Huizhou Zhao, Wei Yan, Tong Zhao
    Abstract:

    In this paper, we propose a novel approach to emulate an arbitrary wireless multi-hop Network Scenario in a fixed wireless testbed, in which every node is equipped with a variable attenuator. We formulate the core problem of wireless multi-hop Network Scenario emulation as a constrained optimization problem and propose an optimum algorithm.

Domenico Ursino - One of the best experts on this subject based on the ideXlab platform.

  • Information diffusion in a multi-social-Network Scenario: framework and ASP-based analysis
    Knowledge and Information Systems, 2016
    Co-Authors: Giuseppe Marra, Francesco Ricca, Domenico Ursino, Giorgio Terracina
    Abstract:

    Information diffusion is a classical problem in social Network analysis, which has been largely investigated with reference to single social Networks. However, the current Scenario is multi-social-Network. Here, many social Networks coexist and are strictly connected to each other, thanks to those users who join more social Networks, acting as bridges among them. But, what happens to information diffusion when passing from a single-social-Network context to a multi-social-Network Scenario? In this paper, we answer this question. In particular, thanks to the definition of a framework for handling these issues and to a large set of experiments, we show that, in this context, new actors and new features play the key roles. We also identify two possible improvements of our framework, namely the management of some “activation nucleuses” (i.e., some starting-node configurations that are likely to improve information diffusion) and the management of topics concerning the information to spread. In these activities, answer set programming provided us with a powerful and flexible tool for an easy setup and implementation of our investigation.

  • JELIA - Exploiting Answer Set Programming for Handling Information Diffusion in a Multi-Social-Network Scenario
    Logics in Artificial Intelligence, 2014
    Co-Authors: Giuseppe Marra, Francesco Ricca, Giorgio Terracina, Domenico Ursino
    Abstract:

    In this paper we apply Answer Set Programming for analyzing properties of social Networks, and we consider Information Diffusion in Social Network Analysis. This problem has been deeply investigated for single social Networks, but we focus on a new setting where many social Networks coexist and are strictly connected to each other, thanks to those users who join more social Networks. We present some experiments allowing us to conclude that the way of spreading information in a Multi-Social-Network Scenario is completely different from that of a Single-Social-Network context.

  • RR - Investigating Information Diffusion in a Multi-Social-Network Scenario via Answer Set Programming
    Web Reasoning and Rule Systems, 2014
    Co-Authors: Giuseppe Marra, Antonino Nocera, Francesco Ricca, Giorgio Terracina, Domenico Ursino
    Abstract:

    Information Diffusion is a classical problem in Social Network Analysis, where it has been deeply investigated for single social Networks. In this paper, we begin to study it in a multi-social-Network Scenario, where many social Networks coexist and are strictly connected to each other, thanks to those users who join more social Networks. In this activity, Answer Set Programming provided us with a powerful and flexible tool for an easy set-up and implementation of our investigations.