Trust and Stability in Heterogeneous Multimedia Networks

2010 ◽  
pp. 378-420
Author(s):  
Dimitrios Koukopoulos
Keyword(s):  
Arrival Rate ◽  
Injection Rate ◽  
Multimedia Systems ◽  
Multimedia Networks ◽  
Contention Resolution ◽  
Packet Arrival ◽  
Network Link ◽  
Network Topologies ◽  
The Stability ◽  
Adversarial Model

In this chapter, the author views trust as the confidence in the association of a stable network execution to the efficient distribution of multimedia products in the final user. A network is stable under a greedy protocol (or a composition of protocols) if, for any adversary of injection rate less than 1, the number of packets in the network remains bounded at all times. The author focuses on a basic adversarial model for packet arrival and path determination for which the time-averaged arrival rate of packets requiring a single edge is no more than 1. Within this framework, the author studies the property of stability under various compositions of contention-resolution protocols and different packet trajectories trying to characterize this property in terms of network topologies. Furthermore, the author enhances the adversary allowing the monitoring of network link capacities/slowdowns. Within this context, the author shows how the stability properties of network topologies change when network link slowdowns/capacities can change dynamically. Interestingly, his results indicate that a composition of protocols leads to worst stability behaviour than having a single unstable protocol for contention-resolution. This suggests that the potential for instability incurred by the composition of protocols may be worse than that of some single protocol. Consequently, this study could help on the design and maintainance of trustworthy heterogeneous multimedia systems.

Performance Analysis Based on Packet Arrival Rate for the IEEE 802.11 DCF

2008 ◽  
Vol 19 (10) ◽  
pp. 2762-2769 ◽  
Author(s):  
Wei-Dong YANG ◽  
Jian-Feng MA ◽  
Ya-Hui LI
Keyword(s):  
Performance Analysis ◽  
Ieee 802.11 ◽  
Arrival Rate ◽  
Ieee 802.11 Dcf ◽  
802.11 Dcf ◽  
Packet Arrival ◽  
Packet Arrival Rate

A Study on the Performance of IPv6-Based Mobility Protocols

2009 ◽  
pp. 2982-2995
Author(s):  
Ki-Sik Kong ◽  
Sung-Ju Roh ◽  
Chong-Sun Hwang
Keyword(s):  
Residence Time ◽  
Arrival Rate ◽  
Mobile Ipv6 ◽  
Performance Comparison ◽  
Average Speed ◽  
Signaling Cost ◽  
Packet Arrival ◽  
Mobility Protocols ◽  
Average Domain ◽  
Packet Arrival Rate

The performance of IP mobility protocols is highly dependent on the change of mobile nodes’ (MNs’) mobility and traffic-related characteristics. Therefore, it is essential to investigate the effects of these characteristics and to conduct an in-depth performance study of these protocols. In this paper, we introduce a novel analytical approach using a continuous-time Markov chain model and hierarchical network model for the performance analysis of IPv6 mobility protocols: Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6). According to these analytical models, we derive the location update costs (i.e., binding update costs plus binding renewal costs), packet tunneling costs, and total signaling costs, which are generated by an MN during its average domain residence time, when MIPv6 or HMIPv6 is deployed under the same network architecture, respectively. In addition, based on these derived costs, we investigate the effects of various parameters, such as the average speed of an MN, binding lifetime period, the ratio of the network scale, and packet arrival rate, on the signaling costs generated by an MN under MIPv6 and HMIPv6. Moreover, we conduct the performance comparison between these two protocols by showing the relative total signaling costs under the various conditions. The analytical results show that as the average speed of an MN gets higher and the binding lifetime period is set to the larger value or as its packet arrival rate gets lower, the total signaling cost generated by an MN during its average domain residence time under HMIPv6 will get relatively lower than that under MIPv6, and that under the reverse conditions, the total signaling cost under MIPv6 will get relatively lower than that under HMIPv6.

Stability condition for a single-server retrial queue

1993 ◽  
Vol 25 (03) ◽  
pp. 690-701 ◽  
Author(s):  
Huei-Mei Liang ◽  
V. G. Kulkarni
Keyword(s):  
Stability Condition ◽  
Service Time ◽  
Retrial Queue ◽  
Arrival Rate ◽  
Retrial Queues ◽  
Single Server ◽  
Sufficient Stability Condition ◽  
Sufficient Stability ◽  
The Mean ◽  
The Stability

A single-server retrial queue consists of a primary queue, an orbit and a single server. Assume the primary queue capacity is 1 and the orbit capacity is infinite. Customers can arrive at the primary queue either from outside the system or from the orbit. If the server is busy, the arriving customer joins the orbit and conducts a retrial later. Otherwise, he receives service and leaves the system. We investigate the stability condition for a single-server retrial queue. Let λ be the arrival rate and 1/μ be the mean service time. It has been proved that λ / μ < 1 is a sufficient stability condition for the M/G /1/1 retrial queue with exponential retrial times. We give a counterexample to show that this stability condition is not valid for general single-server retrial queues. Next we show that λ /μ < 1 is a sufficient stability condition for the stability of a single-server retrial queue when the interarrival times and retrial times are finite mixtures of Erlangs.

On the Stability Problem of Multimedia Systems

2010 ◽  
Vol 20-23 ◽  
pp. 969-974
Author(s):  
Jie Min Zhao
Keyword(s):  
Stability Problem ◽  
Multimedia Systems ◽  
The Stability ◽  
Computing Method

An instability result of multimedia Systems is given by means of the analysis and computing method.

scholarly journals Robust Optimization Model for Single Line Dynamic Bus Dispatching

2021 ◽  
Vol 14 (1) ◽  
pp. 73
Author(s):  
Yingxin Liu ◽  
Xinggang Luo ◽  
Xu Wei ◽  
Yang Yu ◽  
Jiafu Tang
Keyword(s):  
Robust Optimization ◽  
Optimization Model ◽  
Arrival Rate ◽  
Optimization Method ◽  
Single Line ◽  
Passenger Flow ◽  
Bus Scheduling ◽  
Passenger Flows ◽  
The Stability ◽  
Prediction And Simulation

For effective bus operations, it is important to flexibly arrange the departure times of buses at the first station according to real-time passenger flows and traffic conditions. In dynamic bus dispatching research, existing optimization models are usually based on the prediction and simulation of passenger flow data. The bus departure schemes are formulated accordingly, and the passenger arrival rate uncertainty must be considered. Robust optimization is a common and effective method to handle such uncertainty problems. This paper introduces a robust optimization method for single-line dynamic bus scheduling. By setting three scenarios—the benchmark passenger flow, high passenger flow, and low passenger flow—the robust optimization model of dynamic bus departures is established with consideration of different passenger arrival rates in different scenarios. A genetic algorithm (GA) is improved for minimizing the total passenger waiting time. The results obtained by the proposed optimization method are compared with those from a stochastic programming method. The standard deviation of the relative regret value with stochastic optimization is 5.42%, whereas that of the relative regret value with robust optimization is 0.62%. The stability of robust optimization is better, and the fluctuation degree is greatly reduced.

scholarly journals Adaptive Resource Observation for Congestion Alleviation using Constrained Application Protocol

2018 ◽  
Vol 7 (4.38) ◽  
pp. 885
Author(s):  
Jung-Hyok Kwon ◽  
Sol-Bee Lee ◽  
Jaehoon Park ◽  
Kyu-Sung Hwang ◽  
Yongseok Lim ◽  
...  
Keyword(s):  
Network Performance ◽  
Arrival Rate ◽  
Buffer Overflow ◽  
Service Rate ◽  
Packet Arrival ◽  
Simulation Results ◽  
Constrained Application Protocol ◽  
Adaptive Resource ◽  
Packet Arrival Rate

This paper presents an adaptive resource observation (ARO) for congestion alleviation using constrained application protocol (CoAP), which prevents buffer overflow of the client by adjusting observing period of the associated servers. The operation of ARO consists of two main phases; 1) buffer overflow estimation, 2) observing period adaptation. In the former, the client estimates whether buffer overflow will occur by comparing its service rate with packet arrival rate, then it determines the new observing period that can prevent buffer overflow of the client. The latter is used to adjust the observing period of servers considering the predefined the minimum and maximum queue threshold. ARO can significantly reduce the number of dropped packets caused by buffer overflow. The simulation results show that ARO achieves a higher network performance than legacy CoAP. 

scholarly journals A wireless caching helper system with heterogeneous traffic and random availability

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Ioannis Avgouleas ◽  
Nikolaos Pappas ◽  
Vangelis Angelakis
Keyword(s):  
Performance Metrics ◽  
General System ◽  
Arrival Rate ◽  
Access Point ◽  
Base Station ◽  
Heterogeneous Traffic ◽  
Small Cells ◽  
System Throughput ◽  
Multimedia Content ◽  
Packet Arrival

AbstractMultimedia content streaming from Internet-based sources emerges as one of the most demanded services by wireless users. In order to alleviate excessive traffic due to multimedia content transmission, many architectures (e.g., small cells, femtocells, etc.) have been proposed to offload such traffic to the nearest (or strongest) access point also called “helper”. However, the deployment of more helpers is not necessarily beneficial due to their potential of increasing interference. In this work, we evaluate a wireless system which can serve both cacheable and non-cacheable traffic. More specifically, we consider a general system in which a wireless user with limited cache storage requests cacheable content from a data center that can be directly accessed through a base station. The user can be assisted by a pair of wireless helpers that exchange non-cacheable content as well. Files not available from the helpers are transmitted by the base station. We analyze the system throughput and the delay experienced by the cached user and show how these performance metrics are affected by the packet arrival rate at the source helper, the availability of caching helpers, the caches’ parameters, and the user’s request rate by means of numerical results.

Sign in / Sign up

Export Citation Format

Share Document