scholarly journals Scheduling for Media Function Virtualization

2021 ◽  
Vol 13 (7) ◽  
pp. 167
Author(s):  
Gourav Prateek Sharma ◽  
Wouter Tavernier ◽  
Didier Colle ◽  
Mario Pickavet
Keyword(s):  
Cost Reduction ◽  
Scheduling Problem ◽  
Queuing Delay ◽  
End To End Delay ◽  
Service Deployment ◽  
End To End ◽  
Commercial Off The Shelf

Broadcasters are building studio architectures based on commercial off-the-shelf (COTS) IT hardware because of advantages such as cost reduction, ease of management, and upgradation. Media function virtualization (MFV) leverages IP networking to transport media streams between virtual media functions (VMFs), where they are processed. Media service deployment in an MFV environment entails solving the VMF-FG scheduling problem to ensure that the required broadcast quality guarantees are fulfilled. In this paper, we formulate the VMF-FG scheduling problem and propose a greedy-based algorithm to solve it. The evaluation of the algorithm is carried in terms of the end-to-end delay and VMF queuing delay. Moreover, the importance of VMF-FG decomposition in upgradation to higher-quality formats is also highlighted.

Optimization of Multicast End-to-End Delay in Multi-Radio Wireless Mesh Networks

2014 ◽  
Vol 687-691 ◽  
pp. 2975-2978
Author(s):  
Yan An Kang ◽  
Ai Ping Yan ◽  
Gui Xiang Xue
Keyword(s):  
Wireless Mesh Network ◽  
Mesh Network ◽  
Global Flow ◽  
Routing Metric ◽  
Queuing Delay ◽  
Wireless Mesh ◽  
End To End Delay ◽  
Proposed Model ◽  
End To End ◽  
Flow Interference

Multi-radio wireless mesh network (MR-WMN) is one of the key access techniques in Mobile Internet. However, current 802.11-based MR-WMN is not able to provide low multicast end-to-end delay. To address this problem, we first propose a layered and analytical model by combining overlapping channel assignment with multi-path routing strategies. The proposed model can be used as a guide on multicast design. It decoupled multicast delay into transmission delay in the MAC layer and queuing delay in the Mesh layer based on that it derived a new multicast routing metric that had low end-to-end delay. Second, we prove that finding the minimum global flow interference solution is a NP-Complete problem an<I the relationship between global flow interference and network node densities is distributed in accord with double-Pareto lognormal (dP1N) distribution. Based on these two results, the DCA algorithm is proposed in order to minimum global flow interference which can efficiently reduce the multicast transmission delay in MAC layer. Last, to avoid the best wireless link being congested, we propose the flow adaptive-based MMRA algorithm by making use of the M R-M ED routing metric and the multi-path routing design philosophy, which took local channel congestion into account and can efficiently reduce the queuing delay in Mesh layer. Simulation result and comparison of the common algorithm MCM both show that the proposed model accurately characterizes the multicast delay in multi-radio wireless mesh network and the combination of the DCA and MMRA algorithms efficiently reduce the multicast end-to-end delay.

scholarly journals Alternative Priority-based Queuing for WBAN

2019 ◽  
Vol 8 (2) ◽  
pp. 1779-1783
Keyword(s):  
Wireless Body Area Network ◽  
Priority Queue ◽  
Physiological Data ◽  
Area Network ◽  
Data Types ◽  
Queuing Delay ◽  
Lower Priority ◽  
End To End Delay ◽  
End To End ◽  
Qos Metrics

Wireless Body Area Network (WBAN) technology enables medical services to expand its scope. It allows medical expert to monitor physiological data of patients using wireless communication. Despite of the numerous advantages it provides, WBAN still incur issues on different metrics on quality of service (QoS) such as end-to-end delay, queuing delay, and reliability. QoS metrics of the WBAN is affected on the efficiency of its queuing system. Previous studies proposed different routing algorithms to address QoS metrics which implement multiple queues to enhance data transmission of different data types. These studies used strict priority logic which serves the highest priority queue first. However, the main problem of this approach is that lower priority data may be totally blocked by a higher priority data. This paper presents an alternative priority-based queuing to address issue on QoS metrics. The results showed that the proposed algorithm decreased the end-to-end delay and queuing delay and increased the reliability of QoS aware routing protocol. Based on the implementation result, it can be seen that the proposed algorithm can be implement on WBAN.

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

Security based on Received Signal Strength in Localization for Underwater Sensor Networks

2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon
Keyword(s):  
Sensor Networks ◽  
Threshold Value ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Research Subjects ◽  
Malicious Nodes ◽  
Intermediate Node ◽  
End To End Delay ◽  
End To End

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.

scholarly journals RCVC: RSU-Aided Cluster-Based Vehicular Clouds Architecture for Urban Areas

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 193
Author(s):  
Mohamed Ben bezziane ◽  
Ahmed Korichi ◽  
Chaker Abdelaziz Kerrache ◽  
Mohamed el Amine Fekair
Keyword(s):  
Urban Areas ◽  
High Speed ◽  
Service Discovery ◽  
Cluster Head ◽  
Experimental Comparison ◽  
The Road ◽  
Road Side Unit ◽  
End To End Delay ◽  
End To End ◽  
On The Road

As a promising topic of research, Vehicular Cloud (VC) incorporates cloud computing and ad-hoc vehicular network (VANET). In VC, supplier vehicles provide their services to consumer vehicles in real-time. These services have a significant impact on the applications of internet access, storage and data. Due to the high-speed mobility of vehicles, users in consumer vehicles need a mechanism to discover services in their vicinity. Besides this, quality of service varies from one supplier vehicle to another; thus, consumer vehicles attempt to pick out the most appropriate services. In this paper, we propose a novel protocol named RSU-aided Cluster-based Vehicular Clouds protocol (RCVC), which constructs the VC using the Road Side Unit (RSU) directory and Cluster Head (CH) directory to make the resources of supplier vehicles more visible. While clusters of vehicles that move on the same road form a mobile cloud, the remaining vehicles form a different cloud on the road side unit. Furthermore, the consumption operation is achieved via the service selection method, which is managed by the CHs and RSUs based on a mathematical model to select the best services. Simulation results prove the effectiveness of our protocol in terms of service discovery and end-to-end delay, where we achieved service discovery and end-to-end delay of 3 × 10−3 s and 13 × 10−2 s, respectively. Moreover, we carried out an experimental comparison, revealing that the proposed method outperformed several states of the art protocols.

Local area network analysis using end-to-end delay tomography

2005 ◽  
Vol 33 (3) ◽  
pp. 39-45
Author(s):  
Earl Lawrence ◽  
George Michailidis ◽  
Vijay N. Nair
Keyword(s):  
Network Analysis ◽  
Local Area Network ◽  
Local Area ◽  
Area Network ◽  
End To End Delay ◽  
End To End
Sign in / Sign up

Export Citation Format

Share Document