Learn More
We propose a new methodology to estimate the spatial reuse of CSMA-like scheduling. Instead of focusing on spatial configurations of users, we model the interferences between users as a random graph. Using configuration models for random graphs, we show how the properties of the medium access mechanism are captured by some deterministic differential(More)
We present a novel methodology to accurately classify the traffic generated by P2P-TV applications, relying only on the count of packets they exchange with other peers during small time-windows. The rationale is that even a raw count of exchanged packets conveys a wealth of useful information concerning several implementation aspects of a P2P-TV application(More)
This work addresses the estimation and calculation of the operating point of a net-work's link in a digital traffic network. The notion of operating point comes from Effective Band-width (EB) theory. The results are valid for a wide range of traffic types. This means that the statistical characteristics of the traffic may be very general. We show that,(More)
Peer-to-Peer streaming (P2P-TV) applications offer the capability to watch real time video over the Internet at low cost. Some applications have started to become popular, raising the concern of Network Operators that fear the large amount of traffic they might generate. Unfortunately, most of P2P-TV applications are based on proprietary and unknown(More)
In the simplest Matérn point processes, one retains certain points of a Pois-son point process in such a way that no pairs of points are at distance less than a threshold. This condition can be reinterpreted as a threshold condition on an extremal shot–noise field associated with the Poisson point process. This paper is focused on the case where one retains(More)
The performance analysis of a network link is a well studied problem. However, the most interesting issue for a service provider is to evaluate the end-to-end quality of service (QoS). The evaluation of the end-to-end QoS (e.g. loss probability or delay) depends on the traffic statistic which is constantly modified as the traffic traverse the network,(More)
—This paper bears on the design and the quantitative evaluation of MAC mechanisms for wireless ad-hoc networks with performance guarantees. By this, we mean mechanisms where each accepted connection obtains a minimum rate or equivalently a minimum SINR level — which is not guaranteed by CSMA/CA — and which are adapted to the wireless ad-hoc network(More)
  • 1