Realistic networks generators are necessary for simulation and performance evaluation of data communication systems. Such an aspect has driven the collection and the analysis of data on the Internet large-scale structure. The evidence of a power-law behavior of real networks has stimulated the introduction of new procedures to generate Internet-like topologies. Assuming a simple loss model for ...

In this paper, we present a new analytic model for evaluating average end-to-end delay in IEEE 802.11 multihop wireless networks. Our model gives closed expressions for the end-to-end delay in function of arrivals and service time patterns. Each node is modeled as a M/M/1/K queue from which we can derive expressions for service time via queueing theory. By combining this delay evaluation with d...

We present a method for training CNN-based object class detectors directly using mean average precision (mAP) as the training loss, in a truly endto-end fashion that includes non-maximum suppression (NMS) at training time. This contrasts with the traditional approach of training a CNN for a window classification loss, then applying NMS only at test time, when mAP is used as the evaluation metri...

Peer-to-peer (P2P) live streaming provides a scalable solution to the distribution of multimedia content. However, existing streaming applications are plagued by the problem of long playback latency, which discourages commercial IPTV deployment from the ISP end. Moreover, ISP may provide viewers with diverse service options with different video quality, such as 720HD and 1080HD. Obtaining assur...

In this report, delay bounds in data flow systems with nonFIFO service disciplines are explored. It is shown that conventional network calculus definitions of a service curve are not satisfying under the assumption of non-FIFO service. Either the definition is too strict to allow for a concatenation and consequent beneficial end-to-end analysis, or it is too loose and thus results in infinite d...

We introduce a new,"worst-case"model for an asynchronous communication network and investigate the simplest (yet central) task in this model, namely the feasibility of end-to-end routing. Motivated by the question of how successful a protocol can hope to perform in a network whose reliability is guaranteed by as few assumptions as possible, we combine the main"unreliability"features encountered...

A crucial factor for real-time (interactive) services is the end-to-end delay experienced by the application. The contribution resulting from the queuing delay induced by the network nodes is the most difficult to assess. First, it is a stochastic quantity which should be aggregated over many (possibly different) network nodes. Secondly, the queuing delay in a single node stems from two differe...

Phones are used to confirm some of our most sensitive transactions. From coordination between energy providers in the power grid to corroboration of highvalue transfers with a financial institution, we rely on telephony to serve as a trustworthy communications path. However, such trust is not well placed given the widespread understanding of telephony’s inability to provide end-to-end authentic...