800 research outputs found

    Multicast With Prioritized Delivery: How Fresh is Your Data?

    Full text link
    We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of kk nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at a priority node is lower than that at a non-priority node due to the delivery guarantee. However, this advantage for priority nodes disappears if the link delay is exponential distributed. Both groups of nodes have the same time-averaged age, which implies that the guaranteed delivery of updates has no effect the time-averaged freshness.Comment: IEEE SPAWC 201

    An adaptive active queue management algorithm in Internet

    Get PDF
    Ce mémoire ne contient pas de résumé

    Hybrid performance modelling of opportunistic networks

    Get PDF
    We demonstrate the modelling of opportunistic networks using the process algebra stochastic HYPE. Network traffic is modelled as continuous flows, contact between nodes in the network is modelled stochastically, and instantaneous decisions are modelled as discrete events. Our model describes a network of stationary video sensors with a mobile ferry which collects data from the sensors and delivers it to the base station. We consider different mobility models and different buffer sizes for the ferries. This case study illustrates the flexibility and expressive power of stochastic HYPE. We also discuss the software that enables us to describe stochastic HYPE models and simulate them.Comment: In Proceedings QAPL 2012, arXiv:1207.055

    Update or Wait: How to Keep Your Data Fresh

    Full text link
    In this work, we study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is since the moment that this update was generated at the source node (e.g., a sensor). A reasonable update policy is the zero-wait policy, i.e., the source node submits a fresh update once the previous update is delivered and the channel becomes free, which achieves the maximum throughput and the minimum delay. Surprisingly, this zero-wait policy does not always minimize the age. This counter-intuitive phenomenon motivates us to study how to optimally control information updates to keep the data fresh and to understand when the zero-wait policy is optimal. We introduce a general age penalty function to characterize the level of dissatisfaction on data staleness and formulate the average age penalty minimization problem as a constrained semi-Markov decision problem (SMDP) with an uncountable state space. We develop efficient algorithms to find the optimal update policy among all causal policies, and establish sufficient and necessary conditions for the optimality of the zero-wait policy. Our investigation shows that the zero-wait policy is far from the optimum if (i) the age penalty function grows quickly with respect to the age, (ii) the packet transmission times over the channel are positively correlated over time, or (iii) the packet transmission times are highly random (e.g., following a heavy-tail distribution)

    A Framework for a Self-Sustained Traffic Operations System Using V2V Communications

    Get PDF
    abstract: This study explores an innovative framework for a self-sustained traffic operations system using vehicle-to-vehicle (V2V) communications alone. The proposed framework is envisioned as the foundation to an alternative or supplemental traffic operation and management system, which could be particularly helpful under abnormal traffic conditions caused by unforeseen disasters and special events. Its two major components, a distributed traffic monitoring and platoon information aggregation system and a platoon-based automated intersection control system, are investigated in this study. The distributed traffic monitoring and platoon information aggregation system serves as the foundation. Specifically, each equipped vehicle, through the distributed protocols developed, keeps track of the average traffic density and speed within a certain range, flags itself as micro-discontinuity in traffic if appropriate, and cross-checks its flag status with its immediate up- and down-stream vehicles. The micro-discontinuity flags define vehicle groups with similar traffic states, for initiating and terminating traffic information aggregation. The impact of market penetration rate (MPR) is also investigated with a new methodology for performance evaluation under multiple traffic scenarios. In addition to MPR, the performance of the distributed traffic monitoring and platoon information aggregation system depends on the spatial distribution of equipped vehicles in the road network as well. The latter is affected by traffic dynamics. Traffic signal controls at intersections play a significant role in governing traffic dynamics and will in turn impact the distributed monitoring system. The performance of the monitoring framework is investigated with different g/C ratios under multiple traffic scenarios. With the distributed traffic monitoring and platoon information aggregation system, platoons can be dynamically identified on the network in real time. This enables a platoon-based automated intersection control system for connected and autonomous vehicles. An exploratory study on such a control system with two control stages are proposed. At Stage I, vehicles of each platoon will synchronize into a target speed through cooperative speed harmonization. Then, a platoon of vehicles with the same speed can be treated as a single vehicle for speed profile planning at Stage II. Its speed profile will be immediately determined given speed profiles of other platoons and the control goal.Dissertation/ThesisDoctoral Dissertation Civil, Environmental and Sustainable Engineering 201

    Quality of service over ATM networks

    Get PDF
    PhDAbstract not availabl
    • …
    corecore