scholarly journals A Novel Hybrid Data Center Architecture Employing Optically-Switched WDM LANs over Electrical Fat Trees

2021 ◽  
Author(s):  
Tapasmini Sahoo ◽  
Bibhu Prasad Mohanty
Keyword(s):  
Power Consumption ◽  
Data Center ◽  
Optical Switching ◽  
Optical Devices ◽  
The Other ◽  
Hybrid Architecture ◽  
Traffic Condition ◽  
End To End Delay ◽  
Hybrid Data ◽  
End To End

Abstract Inter connection network in a data center is the need of the hour as the communication backbone which caters the demands to accommodate a large number of servers with minimum possible end-to-end delay. The traditional Fat tree based topologies play a pivotal role for data center network (DCN) albeit in a low scale, on the other hand the upcoming electrical-cum-optical hybrid architecture demands huge power consumption and exhibit significant end-to-end delay. The present work depicts a proposal of highly scalable novel hybrid architecture employing optically switched WDM LANs (based on ShuffleNet topology) over electrical Fat trees with the use of substantial number of optical devices, the proposed DCN architecture is shown to offer reasonable reduction of end-to-end delay to 12.29µs for mouse traffic and 10.01ms for elephant traffic as compared to Optical Switching Architecture (OSA), which has significant 23ms of delay for any traffic condition.

scholarly journals Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6370
Author(s):  
Myung-Kyun Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
The Other ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Industrial Wireless Sensor Networks ◽  
End To End Delay ◽  
Other Hand ◽  
End To End

The links of low power wireless sensor networks are error prone and the transmission on a wireless link is determined probabilistically by the packet reception rate (PRR) of the link. On the other hand, there is a very strict requirement in the end-to-end reliability and delay of sensor data in industrial wireless sensor networks (IWSNs). The existing approaches to provide the end-to-end reliability in IWSNs is retransmitting the packet when failure occurs. These approaches transmit a packet multiple times in successive time slots to provide the required reliability. These approaches, however, can increase the average delay of packets and the number of packets buffered in a queue. This paper proposes a new scheme to estimate the probabilistic amount of packets, called queue level (QL), in the buffer of each node based on the PRRs of the wireless links. This paper also proposes a QL-based centralized scheduling algorithm to assign time slots efficiently in TDMA-based IWSNs. The proposed scheduling algorithm gives higher priority to the nodes with higher QL. By assigning time slots first to the node with the highest QL, we can reduce the average end-to-end delay of packets and reduce the amount of buffered packets in the queue while satisfying the required end-to-end reliability. The performance of the proposed scheduling algorithm have been evaluated through a simulation using the Cooja simulator and compared with the existing approach. In the simulation on an sample network with the target end-to-end reliability of 99%, all of the flows were shown to guarantee the target reliability in both algorithms: on average, 99.76% in the proposed algorithm and 99.85% in the existing approach. On the other hand, the proposed algorithm showed much better performance than the existing approach in terms of the average end-to-end delay of packets (about 47% less) and the number of maximally buffered packets in the queue of each node (maximally, more than 90% less).

scholarly journals PaCoVNE: Power Consumption Aware Coordinated VNE with Delay Constraints

2017 ◽  
Author(s):  
Xavier Hesselbach ◽  
Khaled Hejja
Keyword(s):  
Power Consumption ◽  
Energy Aware ◽  
Delay Constraints ◽  
One Stage ◽  
End To End Delay ◽  
Major Constraint ◽  
Substrate Network ◽  
Simulation Results ◽  
End To End

This paper introduces a more efficient embedding approach, called power consumption aware and coordinated VNE heuristic, denoted as (PaCoVNE). It embeds both virtual nodes and edges, simultaneously, and within one stage, while satisfying: CPU, BW constraints, minimizes power consumption of whole substrate network, and considers end-to- end delay as a major constraint. Performance of the new heuristic was compared to the energy aware algorithm OCA/EA-RH, for off-line scenario using homogeneous configurations, with and without end-to-end delay. The paper also presents simulation results for the two configurations once without end-to-end delay, and also when it was included.

New Method to Measure End-to-End Delay of Virtual Reality

2010 ◽  
Vol 19 (6) ◽  
pp. 569-584 ◽  
Author(s):  
Massimiliano Di Luca
Keyword(s):  
Virtual Reality ◽  
Virtual Environment ◽  
Physical Environment ◽  
Oscillation Frequency ◽  
Vantage Point ◽  
The Other ◽  
New Method ◽  
Light Sensing ◽  
End To End Delay ◽  
End To End

A virtual reality (VR) system tracks one or more objects to generate the depiction of a virtual environment from the user's vantage point. No system achieves this instantaneously: changes in the depicted virtual environment are delayed from changes in the position of the objects being tracked. In this paper, a method is proposed to quantify this time difference, the end-to-end delay of the VR system. Two light-sensing devices and two luminance gradients are used to simultaneously encode the position of one tracked object and its virtual counterpart. One light-sensing device is attached to the tracked object and it captures light from the gradient in the physical environment. The other device captures light from the gradient in the virtual environment. A measurement is obtained by moving the tracked object repetitively (by hand) across the gradient. The end-to-end delay is the asynchrony between the signals generated by the two light-sensing devices. The results collected with oscillatory movements performed at different frequencies indicate that for some VR systems, the end-to-end delay might not be constant but could vary as a function of the oscillation frequency.

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.

Sign in / Sign up

Export Citation Format

Share Document