Buffer Occupancies in Tandem Networks with Size-Retaining Data Packets

2012 ◽  
Author(s):  
Werner Sandmann
Keyword(s):  
Data Packets ◽  
Tandem Networks

Simulation modeling of packet switching network segment functioning

2019 ◽  
pp. 75-82
Author(s):  
D. V. Shelkovoy ◽  
A. A. Chernikov
Keyword(s):  
Quality Of Service ◽  
Communication Networks ◽  
Simulation Modeling ◽  
Data Stream ◽  
Switching Network ◽  
Data Packets ◽  
Channel Resource ◽  
Switching Node ◽  
Joint Examination

The testing results of required channel resource mathematical estimating models for the for serving the proposed multimedia load in packet-switched communication networks are presented in the article. The assessment of the attainable level of quality of service at the level of data packet transportation was carried out by means of simulation modeling of the functioning of a switching node of a communication network. The developed modeling algorithm differs from the existing ones by taking into account the introduced delay for processing each data stream packet arriving at the switching node, depending on the size of the reserved buffer and the channel resource for its maintenance. A joint examination of the probability of packet loss and the introduced delay in the processing of data packets in the border router allows a comprehensive assessment of the quality of service «end to end», which in turn allows you to get more accurate values of the effective data transmitted rate by aggregating flows at the entrance to the transport network.

scholarly journals Spectrum Based Power Management for Congested IoT Networks

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2681
Author(s):  
Kedir Mamo Besher ◽  
Juan Ivan Nieto-Hipolito ◽  
Raymundo Buenrostro-Mariscal ◽  
Mohammed Zamshed Ali
Keyword(s):  
Power Management ◽  
Network Performance ◽  
Channel Allocation ◽  
Battery Life ◽  
Packet Routing ◽  
Data Packets ◽  
Increasing Demand ◽  
Iot Devices ◽  
Set Up

With constantly increasing demand in connected society Internet of Things (IoT) network is frequently becoming congested. IoT sensor devices lose more power while transmitting data through congested IoT networks. Currently, in most scenarios, the distributed IoT devices in use have no effective spectrum based power management, and have no guarantee of a long term battery life while transmitting data through congested IoT networks. This puts user information at risk, which could lead to loss of important information in communication. In this paper, we studied the extra power consumed due to retransmission of IoT data packet and bad communication channel management in a congested IoT network. We propose a spectrum based power management solution that scans channel conditions when needed and utilizes the lowest congested channel for IoT packet routing. It also effectively measured power consumed in idle, connected, paging and synchronization status of a standard IoT device in a congested IoT network. In our proposed solution, a Freescale Freedom Development Board (FREDEVPLA) is used for managing channel related parameters. While supervising the congestion level and coordinating channel allocation at the FREDEVPLA level, our system configures MAC and Physical layer of IoT devices such that it provides the outstanding power utilization based on the operating network in connected mode compared to the basic IoT standard. A model has been set up and tested using freescale launchpads. Test data show that battery life of IoT devices using proposed spectrum based power management increases by at least 30% more than non-spectrum based power management methods embedded within IoT devices itself. Finally, we compared our results with the basic IoT standard, IEEE802.15.4. Furthermore, the proposed system saves lot of memory for IoT devices, improves overall IoT network performance, and above all, decrease the risk of losing data packets in communication. The detail analysis in this paper also opens up multiple avenues for further research in future use of channel scanning by FREDEVPLA board.

scholarly journals A Highly Effective Route for Real-Time Traffic Using an IoT Smart Algorithm for Tele-Surgery Using 5G Networks

2021 ◽  
Vol 10 (2) ◽  
pp. 30
Author(s):  
Radwan S. Abujassar ◽  
Husam Yaseen ◽  
Ahmad Samed Al-Adwan
Keyword(s):  
Live Streaming ◽  
Data Traffic ◽  
Data Packets ◽  
Real Time Traffic ◽  
Medical Quality ◽  
Optimal Smoothing ◽  
Patient Will ◽  
Three Stages ◽  
Exchange Data

Nowadays, networks use many different paths to exchange data. However, our research will construct a reliable path in the networks among a huge number of nodes for use in tele-surgery using medical applications such as healthcare tracking applications, including tele-surgery which lead to optimizing medical quality of service (m-QoS) during the COVID-19 situation. Many people could not travel due to the current issues, for fear of spreading the covid-19 virus. Therefore, our paper will provide a very trusted and reliable method of communication between a doctor and his patient so that the latter can do his operation even from a far distance. The communication between the doctor and his/her patient will be monitored by our proposed algorithm to make sure that the data will be received without delay. We test how we can invest buffer space that can be used efficiently to reduce delays between source and destination, avoiding loss of high-priority data packets. The results are presented in three stages. First, we show how to obtain the greatest possible reduction in rate variability when the surgeon begins an operation using live streaming. Second, the proposed algorithm reduces congestion on the determined path used for the online surgery. Third, we have evaluated the affection of optimal smoothing algorithm on the network parameters such as peak-to-mean ratio and delay to optimize m-QoS. We propose a new Smart-Rout Control algorithm (s-RCA) for creating a virtual smart path between source and destination to transfer the required data traffic between them, considering the number of hops and link delay. This provides a reliable connection that can be used in healthcare surgery to guarantee that all instructions are received without any delay, to be executed instantly. This idea can improve m-QoS in distance surgery, with trusted paths. The new s-RCA can be adapted with an existing routing protocol to track the primary path and monitor emergency packets received in node buffers, for direct forwarding via the demand path, with extended features.

scholarly journals Bandwidth-Aware Rescheduling Mechanism in SDN-Based Data Center Networks

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1774
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen ◽  
Chia-Jui Hung
Keyword(s):  
Data Center ◽  
Completion Time ◽  
Network Performance ◽  
Data Locality ◽  
Task Completion ◽  
Data Center Networks ◽  
Task Completion Time ◽  
Data Packets ◽  
Network Bandwidth ◽  
Data Process

Recently, with the increase in network bandwidth, various cloud computing applications have become popular. A large number of network data packets will be generated in such a network. However, most existing network architectures cannot effectively handle big data, thereby necessitating an efficient mechanism to reduce task completion time when large amounts of data are processed in data center networks. Unfortunately, achieving the minimum task completion time in the Hadoop system is an NP-complete problem. Although many studies have proposed schemes for improving network performance, they have shortcomings that degrade their performance. For this reason, in this study, we propose a centralized solution, called the bandwidth-aware rescheduling (BARE) mechanism for software-defined network (SDN)-based data center networks. BARE improves network performance by employing a prefetching mechanism and a centralized network monitor to collect global information, sorting out the locality data process, splitting tasks, and executing a rescheduling mechanism with a scheduler to reduce task completion time. Finally, we used simulations to demonstrate our scheme’s effectiveness. Simulation results show that our scheme outperforms other existing schemes in terms of task completion time and the ratio of data locality.

scholarly journals Evaluating CRoS-NDN: a comparative performance analysis of a controller-based routing scheme for named-data networking

2019 ◽  
Vol 10 (1) ◽  
Author(s):  
João Vitor Torres ◽  
Igor Drummond Alvarenga ◽  
Raouf Boutaba ◽  
Otto Carlos Muniz Bandeira Duarte
Keyword(s):  
Distribution Networks ◽  
Content Distribution Networks ◽  
Named Data Networking ◽  
Comparative Performance ◽  
Delay Performance ◽  
Data Packets ◽  
Routing Scheme ◽  
Wide Range ◽  
New Locations ◽  
Data Networking

Abstract The huge amount of content names available in Named-Data Networking (NDN) challenges both the required routing table size and the techniques for locating and forwarding information. Content copies and content mobility exacerbate the scalability challenge to reach content in the new locations. We present and analyze the performance of a proposed Controller-based Routing Scheme, named CRoS-NDN, which preserves NDN features using the same interest and data packets. CRoS-NDN supports content mobility and provides fast content recovery from copies that do not belong to the consumer-producer path because it splits identity from location without incurring FIB size explosion or supposing prefix aggregation. It provides features similar to Content Distribution Networks (CDN) in NDN, and improves the routing efficiency. We compare our proposal with similar routing protocols and derive analytical expressions for lower-bound efficiency and upper-bound latency. We also conduct extensive simulations to evaluate results in data delivery efficiency and delay. The results show the robust behavior of the proposed scheme achieving the best efficiency and delay performance for a wide range of scenarios. Furthermore, CRoS-NDN results in low use of processing time and memory for a growing number of prefixes.

scholarly journals Honey Bee Optimization based Sink Mobility Aware Heterogeneous Protocol for Wireless Sensor Network

2019 ◽  
Vol 20 (4) ◽  
pp. 591-598 ◽  
Author(s):  
Ashish Kumar Luhach ◽  
Aditya Khamparia ◽  
Ravindra Sihag ◽  
Raj Kumar
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Honey Bee ◽  
Heterogeneous Network ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Research Issues ◽  
Data Packets ◽  
Industrial Monitoring ◽  
The Stability

Wireless Sensor Network (WSN) has emerged as one of the most important technologies serving an array of solutions for critical applications such as defense, industrial monitoring and decision purposes. Data routing in WSN is effective or non-effective depending upon the energy saving for nodes while transferring data packets to the sink. Mainly WSN divided into two modes; heterogeneous and homogeneous. Heterogeneous network in WSN mainly focused on the cluster head selection. Sink mobility in the heterogeneous network has still many open research issues, it is observed that it makes the network more energy efficient. The optimization in the network leads to the stability of the network at a much higher level. In this paper, the sink mobility is optimized for WSN using Honey Bee Optimization (HBO) technique by considering the parameters such as energy and distance. The proposed protocol shows significant improvement in the stability period by 33 % by covering 2928 rounds and enhanced network lifetime by 1500 rounds in compared with 2033 and 14084 rounds for iMBEENISH protocol respectively.

Sign in / Sign up

Export Citation Format

Share Document