On Kleinrock’s Independence Assumption

Popescu, Adrian; Constantinescu, Doru

doi:10.1007/978-3-642-02742-0_1

Cited by 6 publications

(4 citation statements)

References 9 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper develops opportunities for applications and networks to exploit the randomness cancellation effect [16] that has been observed to impair on measurements in time-slotted networks. Measurement results presented therein confirm earlier findings [17] that disprove Kleinrock's independence assumption for specific cases. This paper confirms, too, that coarsegrained timing of systems or links can dominate overall endto-end delay in real networks.…”

Section: Related Worksupporting

confidence: 88%

See 1 more Smart Citation

The Right Time: Reducing Effective End-to-End Delay in Time-Slotted Packet-Switched Networks

Fabini

Zseby

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Modern access network technologies like Long Term Evolution (LTE) and High Speed Packet Access (HSPA) use timeslotting mechanisms to optimize resource sharing and overall network performance. In time-slotted networks, the one-way delay of all packets in a packet stream depends on the absolute point in time when the first packet of the stream is sent. With appropriate feedback signals, applications can exploit this effect to reduce their effective end-to-end delay. Time-critical applications such as realtime sensor data acquisition or voice-over-IP (VoIP) communications can shift their acquisition interval in order to adapt to the network timing. Information about the actual time-slotting periods can be gathered by active network measurements or through implementation of cross-layer information exchange. In this paper, a method is proposed to determine the optimum send time for particular destinations and to support applications in adjusting their send time accordingly. Theoretical findings are supported by the offline analysis of measurement data and by a proof-of-concept implementation that confirms the feasibility and effectiveness of the proposed solution in operational LTE and HSPA networks.

show abstract

Section: Related Worksupporting

confidence: 88%

“…11-14, whereas HSPA downlink results are shown in Figs. [15][16][17][18]. For an analysis of the multimodal pattern of HSPA uplink in Fig.…”

Section: Measurement Results Hspamentioning

confidence: 99%

The Right Time: Reducing Effective End-to-End Delay in Time-Slotted Packet-Switched Networks

Fabini

Zseby

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…These analytic models typically require the introduction of assumptions, e.g. Kleinrock's independence assumption [11], to make them tractable. Yet, since the network communication is based on a limited number of communication protocols, it is reasonable to use and constantly refine such analytic approaches.…”

Section: Related Workmentioning

confidence: 99%

Measuring and Modelling Delays in Robot Manipulators for Temporally Precise Control Using Machine Learning

Andersen¹,

Amor

Andersen³

et al. 2015

2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)

View full text Add to dashboard Cite

Abstract-Latencies and delays play an important role in temporally precise robot control. During dynamic tasks in particular, a robot has to account for inherent delays to reach manipulated objects in time. The different types of occurring delays are typically convoluted and thereby hard to measure and separate. In this paper, we present a data-driven methodology for separating and modelling inherent delays during robot control. We show how both actuation and response delays can be modelled using modern machine learning methods. The resulting models can be used to predict the delays as well as the uncertainty of the prediction. Experiments on two widely used robot platforms show significant actuation and response delays in standard control loops. Predictive models can, therefore, be used to reason about expected delays and improve temporal accuracy during control. The approach can easily be used on different robot platforms.

show abstract

“…In that case, based on Kleinrock independence approximation [27], Lemma 2 is still a good approximation. We skip the detailed derivation of variable network-link delays or the exact accuracy of that approximation for future work.…”

Section: 21mentioning

confidence: 99%

Are continuous stop-and-go mixnets provably secure?

Das,

Diaz,

Kiayias

et al. 2024

PoPETs

View full text Add to dashboard Cite

This work formally analyzes the anonymity guarantees of continuous stop-and-go mixnets and attempts to answer the titular question. Existing mixnet based anonymous communication protocols that aim to provide provable anonymity guarantees rely on round-based communication models, which requires synchronization among all the nodes and clients that is difficult to achieve in practice. Continuous stop-and-go mixnets (e.g., Loopix and Nym) provide a nice alternative by adding a random delay for each message on every hop independent of all other hops and all other messages. The core anonymization technique of continuous mixnets combined with the fact that the messages are sent by the clients to the mixnet at different times makes it a difficult problem to formally prove security for such mixnet protocols; existing end-to-end analyses for such designs provide only experimental evaluations for anonymity and were lacking a comprehensive formal treatment. We are the first to close that gap and provide a formal analysis. We provide two indistinguishability based definitions (of sender anonymity), namely pairwise unlinkability and user unlinkability, tuned specifically for continuous stop-and-go mixnets. We derive the adversarial advantage as a function of the protocol parameters for the two definitions. We show that there is a fundamental lower bound on the adversarial advantage $\delta$ for pairwise unlinkability; however, strong user unlinkability (negligible adversarial advantage) can be achieved if the users message rate ($\lambda_u$) is proportional to message processing rate ($\lambda$) on the nodes.

show abstract

On Kleinrock’s Independence Assumption

Cited by 6 publications

References 9 publications

The Right Time: Reducing Effective End-to-End Delay in Time-Slotted Packet-Switched Networks

The Right Time: Reducing Effective End-to-End Delay in Time-Slotted Packet-Switched Networks

Measuring and Modelling Delays in Robot Manipulators for Temporally Precise Control Using Machine Learning

Are continuous stop-and-go mixnets provably secure?

Contact Info

Product

Resources

About