Gotowa bibliografia na temat „Packet drop probability”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Packet drop probability”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Packet drop probability"

1

AL-DIABAT, MOFLEH, HUSSEIN ABDEL-JABER, FADI THABTAH, OSMAN ABOU-RABIA i MAHMOUD KISHTA. "ANALYTICAL MODELS BASED DISCRETE-TIME QUEUEING FOR THE CONGESTED NETWORK". International Journal of Modeling, Simulation, and Scientific Computing 03, nr 01 (marzec 2012): 1150004. http://dx.doi.org/10.1142/s1793962311500048.

Pełny tekst źródła
Streszczenie:
Congestion is one of the well-studied problems in computer networks, which occurs when the request for network resources exceeds the buffer capacity. Many active queue management techniques such as BLUE and RED have been proposed in the literature to control congestions in early stages. In this paper, we propose two discrete-time queueing network analytical models to drop the arrival packets in preliminary stages when the network becomes congested. The first model is based on Lambda Decreasing and it drops packets from a probability value to another higher value according to the buffer length. Whereas the second proposed model drops packets linearly based on the current queue length. We compare the performance of both our models with the original BLUE in order to decide which of these methods offers better quality of service. The comparison is done in terms of packet dropping probability, average queue length, throughput ratio, average queueing delay, and packet loss rate.
Style APA, Harvard, Vancouver, ISO itp.
2

Hamadneh, Nabhan, Mamoon Obiedat, Ahmad Qawasmeh i Mohammad Bsoul. "HRED, An Active Queue Management Algorithm for TCP Congestion Control". Recent Patents on Computer Science 12, nr 3 (8.05.2019): 212–17. http://dx.doi.org/10.2174/2213275912666181205155828.

Pełny tekst źródła
Streszczenie:
Background: Active Queue Management (AQM) is a TCP congestion avoidance approach that predicts congestion before sources overwhelm the buffers of routers. Random Early Detection (RED) is an AQM strategy that keeps history of queue dynamics by estimating an average queue size parameter avg and drops packets when this average exceeds preset thresholds. The parameter configuration in RED is problematic and the performance of the whole network could be reduced due to wrong setup of these parameters. Drop probability is another parameter calculated by RED to tune the drop rate with the aggressiveness of arriving packets. Objective: In this article, we propose an enhancement to the drop probability calculation to increase the performance of RED. Methods: This article studies the drop rate when the average queue size is at the midpoint between the minimum and maximum thresholds. The proposal suggests a nonlinear adjustment for the drop rate in this area. Hence, we call this strategy as the Half-Way RED (HRED). Results: Our strategy is tested using the NS2 simulator and compared with some queue management strategies including RED, TD and Gentle-RED. The calculated parameters are: throughput, link utilization and packet drop rate. Conclusion: Each performance parameter has been plotted in a separate figure; then the robustness of each strategy has been evaluated against these parameters. The results suggest that this function has enhanced the performance of RED-like strategies in controlling congestion. HRED has outperformed the strategies included in this article in terms of throughput, link utilization and packet loss rate.
Style APA, Harvard, Vancouver, ISO itp.
3

Jafri, Syed Talib Abbas, Irfan Ahmed i Sundus Ali. "Queue-Buffer Optimization Based on Aggressive Random Early Detection in Massive NB-IoT MANET for 5G Applications". Electronics 11, nr 18 (18.09.2022): 2955. http://dx.doi.org/10.3390/electronics11182955.

Pełny tekst źródła
Streszczenie:
Elements in massive narrowband Internet of Things (NB-IoT) for 5G networks suffer severely from packet drops due to queue overflow. Active Queue Management (AQM) techniques help in maintaining queue length by dropping packets early, based on certain defined parameters. In this paper, we have proposed an AQM technique, called Aggressive Random Early Detection (AgRED) which, in comparison to previously used Random Early Detection (RED) and exponential RED technique, improves the overall end-to-end delay, throughput, and packet delivery ratio of the massive NB-IoT 5G network while using UDP. This improvement has been achieved due to a sigmoid function used by the AgRED technique, which aggressively and randomly drops the incoming packets preventing them from filling the queue. Because of the incorporation of the AgRED technique, the queue at different nodes will remain available throughout the operation of the network and the probability of delivering the packets will increase. We have analyzed and compared the performance of our proposed AgRED technique and have found that the performance gain for the proposed technique is higher than other techniques (RED and exponential RED) and passive queue management techniques (drop-tail and drop-head). The improvement in results is most significant in congested network deployment scenarios and provides improvements in massive Machine Type Communication, while also supporting ultra-low latency and reliable communication for 5G applications.
Style APA, Harvard, Vancouver, ISO itp.
4

Bemani, Ali, i Niclas Björsell. "Distributed Event Triggering Algorithm for Multi-Agent System over a Packet Dropping Network". Sensors 21, nr 14 (15.07.2021): 4835. http://dx.doi.org/10.3390/s21144835.

Pełny tekst źródła
Streszczenie:
The availability of wireless networked control systems (WNCSs) has increased the interest in controlling multi-agent systems. Multiple feedback loops are closed over a shared communication network in such systems. An event triggering algorithm can significantly reduce network usage compared to the time triggering algorithm in WNCSs, however, the control performance is insecure in an industrial environment with a high probability of the packet dropping. This paper presents the design of a distributed event triggering algorithm in the state feedback controller for multi-agent systems, whose dynamics are subjected to the external interaction of other agents and under a random single packet drop scenario. Distributed event-based state estimation methods were applied in this work for designing a new event triggering algorithm for multi-agent systems while retaining satisfactory control performance, even in a high probability of packet drop condition. Simulation results for a multi-agent application show the main benefits and suitability of the proposed event triggering algorithm for multi-agent feedback control in WNCSs with packet drop imperfection.
Style APA, Harvard, Vancouver, ISO itp.
5

Hassan, Samuuel Oluwatosin, Vivian Ogochukwu Nwaocha, Adewole Usman Rufai, Tola John Odule, Theophilus Aniemeka Enem, Lukman Adebayo Ogundele i Suleiman Abu Usman. "Random early detection-quadratic linear: an enhanced active queue management algorithm". Bulletin of Electrical Engineering and Informatics 11, nr 4 (1.08.2022): 2262–72. http://dx.doi.org/10.11591/eei.v11i4.3875.

Pełny tekst źródła
Streszczenie:
This paper identifies the lone linear drop function for computing the dropping probability between certain queue threshold values as a major weakness for the random early detection (RED) algorithm as it leads to large delay and queue instability. To address this concern, we propose an enhanced RED-based algorithm called random early detection-quadratic linear (referred to as “RED-QL”) active queue management (AQM) which leveraged the benefit of a quadratic packet drop function for a light-to moderate traffic load conditions together with a linear packet drop function for a heavy traffic load condition respectively. Results from ns-3 network simulator using different experimental scenarios clearly reveals that the proposed RED-QL algorithm yields a substantial reduction in delay performance and indeed a reduced average queue size than other three representative AQM algorithms. RED-QL is robust, easy to implement and deploy in routers (both in software and hardware) as no more than the packet drop probability profile of the classic RED’s algorithm implementation needs modest alteration.
Style APA, Harvard, Vancouver, ISO itp.
6

Liang, Guangjun, Qi Zhu, Jianfang Xin, Jiashan Tang i Tianjiao Zhang. "Performance Analysis of Buffer-Aided Relaying System Based on Data and Energy Coupling Queuing Model for Cooperative Communication Networks". Wireless Communications and Mobile Computing 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/9287489.

Pełny tekst źródła
Streszczenie:
We focus on the performance analysis of the buffer-aided relaying system which allows data and energy packets to arrive independently and depart interactively. First, we profile the cooperative relaying system model as a data arrival and energy arrival coupling queuing model. Considering the influence of channel condition on the data departure rate, a new relay transmit protocol which permits exhausting more energy packet to send one data packet in the bad channel environment is proposed. Second, the joint data packet and energy packet handling problem is ascribed to a Coupled Processor Queuing Model which could achieve its steady state transition probability by Quasi-Birth and Death method. Third, the expressions of throughput, delay, and packet drop rate for both data queue and energy queue are also derived. Simulations are demonstrated to verify the analytical results under different data arrival rate, energy arrival rate, and relaying strategy.
Style APA, Harvard, Vancouver, ISO itp.
7

Sharma, Mohit K., i Chandra R. Murthy. "Packet Drop Probability Analysis of Dual Energy Harvesting Links With Retransmission". IEEE Journal on Selected Areas in Communications 34, nr 12 (grudzień 2016): 3646–60. http://dx.doi.org/10.1109/jsac.2016.2611919.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Preye, Uguta Henry, i Onyejegbu Laeticia Nneka. "An Intelligent Fuzzy Logic System for Network Congestion Control". Circulation in Computer Science 2, nr 11 (20.12.2017): 23–30. http://dx.doi.org/10.22632/ccs-2017-252-69.

Pełny tekst źródła
Streszczenie:
Network congestion is a major problem in all network environments as such it calls for ways to manage this problem. In this paper, we propose a Fuzzy Regulator Effective Random Early Detection (FRERED) system, which is an intelligent fuzzy logic based controller technique for early stage congestion detection, at the router buffer in the networks. The proposed technique extends the Fuzzy-Based system in the Fuzzy Hybrid ERED algorithm by considering the delay variable in its inference system to ease the problem of parameter initialization and parameter dependency. Unlike the Fuzzy-Based controller in the existing Fuzzy Hybrid ERED system which uses two parameter settings in its inference system that is, the queue size and average queue length in computing the dropping probability of packets. The proposed technique uses the queue size, average queue length and the delay approximation as input variables in computing the packet drop probability. The applied fuzzy logic system yields an output that denotes a packet dropping probability, which in turn controls and prevents congestion in early stage. This was achieved after simulating the proposed technique and the existing Fuzzy-Based controller using Matlab. The results obtained shows that this approach results in less packet drops for about the same link utilization as the existing Fuzzy-Based controller. Therefore, this technique, generally, controls network congestion and improves network performance. The methodology used to achieve this is the object oriented methodology and JAVA programming language was used to develop the system.
Style APA, Harvard, Vancouver, ISO itp.
9

Rawayau, Aminu Haruna, Muhammad Dikko Amadi, Mubarak Kabir Kankara, Mahmud Muhammad Yahaya i Samaila Bello. "HEURISTIC GATEWAY PLACEMENT FOR MINIMAL TRANSMISSION POWER & COLLISION PROBABILITY IN AN INTERNET OF THINGS LOW POWER WIDE AREA NETWORK (HGPMTPIoT-LPWAN)". FUDMA JOURNAL OF SCIENCES 7, nr 3 (21.05.2023): 1–6. http://dx.doi.org/10.33003/fjs-2023-0703-1765.

Pełny tekst źródła
Streszczenie:
A variety of long-range (LoRa), low-power, and low bit-rate wireless network technologies have been made possible by the Internet of Things' (IoT) rapid growth. As a radio technology for the implementation of numerous Internet of Things applications, the LoRa low-power wide area network (LPWAN) has gained prominence. LoRa is frequently used in conjunction with the Long-Range Wide Area Network Media Access Control (LoRaWAN MAC) protocol and functions in the Industrial, Scientific, and Medical (ISM) bands, which are unlicensed. As a result of receiving a wide variety of different message sizes from diverse applications, LoRa networks experience scalability issues when the number of end nodes connected to one network is more than the shared number of channels. This results in collisions and packet loss. In this paper, heuristic gateway placement for minimal transmission power & collision probability in an internet of things low power wide area network (HGPMTPIOT-LPWAN) is proposed to increase network efficiency, and improve overall performance by measuring collision probability, which in turn can help to reduce the need for retransmissions and packet drop rate. The things network simulator is used to measure the collisions and packet drop rate. An improved performance for HGPMTPIOT as against the efficient graph-based gateway placement (EGBGP) for large-scale LoRaWAN deployments is achieved for packet drop rate by 6%. Likewise, the simulation results show improvements in terms of decreasing the collision probability for 20 to 60 nodes by 20%.
Style APA, Harvard, Vancouver, ISO itp.
10

Boriboon, Anupon, i Siriwhaddhanah Pongpadpinit. "The HSBQ Algorithm with Triple-play Services for Broadband Hybrid Satellite Constellation Communication System". International Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems 5, nr 2 (8.07.2016): 108. http://dx.doi.org/10.11601/ijates.v5i2.169.

Pełny tekst źródła
Streszczenie:
The HSBQ algorithm is the one of active queue management algorithms, which orders to avoid high packet loss rates and control stable stream queue. That is the problem of calculation of the drop probability for both queue length stability and bandwidth fairness. This paper proposes the HSBQ, which drop the packets before the queues overflow at the gateways, so that the end nodes can respond to the congestion before queue overflow. This algorithm uses the change of the average queue length to adjust the amount by which the mark (or drop) probability is changed. Moreover it adjusts the queue weight, which is used to estimate the average queue length, based on the rate. The results show that HSBQ algorithm could maintain control stable stream queue better than group of congestion metric without flow information algorithm as the rate of hybrid satellite network changing dramatically, as well as the presented empiric evidences demonstrate that the use of HSBQ algorithm offers a better quality of service than the traditionally queue control mechanisms used in hybrid satellite network.
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Packet drop probability"

1

Dadhich, Khushboo, i Devika Kataria. "Effect of Channel Slot Time on Performance of IEEE 802.15.6-Based Medical Body Area Network". W Communications in Computer and Information Science, 376–85. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-28180-8_25.

Pełny tekst źródła
Streszczenie:
AbstractThe IEEE 802.15.6 standard is an emerging technology that supports low data rate, short-range wireless communication. Medical Body Area Networks (MBAN) are a special type of wireless communication where multiple sensor nodes are deployed on the human body to measure vital parameters. The data is sent by the nodes to a coordinator, the latter aggregates the data and sends it to a central server using standard protocols. The coordinator allows the nodes to access the channel using different access modes-beacon mode with the super frame, non-beacon mode with super frame and non-beacon mode without super frame. The standard allows different user priorities to be assigned to the nodes. The nodes may access the channel using scheduling done by the coordinator (scheduled access) or may randomly access the channel using the CSMA/CA (for narrowband PHY) or Slotted Aloha for UltraWideBand (UWB PHY) protocols. In this work we have conducted an analytical study to understand the performance parameters of different user priority nodes using CSMA/CA protocol and operating in the Beacon access mode with super frame boundaries. Parameters like the probability of successful transmission (reliability) which in turn depend on the probability of packet drop due to channel access failure and the probability of failure due to insufficient time slot available have been studied. This study reveals that once a channel is assessed by a node, then the probability of sufficient time slot of 60% yields the best packet transmission probability. The successful delivery of the packet also depends on back off counter. Markov chain models for nodes with different priorities have been developed using backoff stage and backoff counter as parameters.
Style APA, Harvard, Vancouver, ISO itp.
2

Subathra, P., i S. Sivagurunathan. "Secure Route Discovery in DSR against Black Hole Attacks in Mobile Ad Hoc Networks". W Next Generation Data Communication Technologies, 125–43. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-61350-477-2.ch006.

Pełny tekst źródła
Streszczenie:
A Mobile Ad hoc Network (MANET) is a collection of wireless nodes communicating over multi-hop paths without any infrastructure. Nodes must cooperate to provide necessary network functionalities. The security in routing protocols like Dynamic Source Routing (DSR) can be compromised by a “Black Hole” attack. Here, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops them, leading to performance degradation. The situation becomes worse when two or more nodes cooperate and perform the “Cooperative black hole” attack. This chapter proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating the attacking nodes. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio, and false negative probability in comparison with trust and probe based schemes.
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Packet drop probability"

1

Abbasov, Babak. "Using linear interpolation method for packet drop probability function of RED algorithm". W 2011 5th International Conference on Application of Information and Communication Technologies (AICT). IEEE, 2011. http://dx.doi.org/10.1109/icaict.2011.6110996.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Sharma, Mohit K., i Chandra R. Murthy. "Packet drop probability analysis of ARQ and HARQ-CC with energy harvesting transmitters and receivers". W 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2014. http://dx.doi.org/10.1109/globalsip.2014.7032096.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Sharma, Mohit K., Tan Peng Hui, Ernest Kurniawan i Sun Sumei. "Packet Drop Probability-Optimal Cross-layer Scheduling: Dealing with Curse of Sparsity using Prioritized Experience Replay". W 2021 IEEE International Conference on Communications Workshops (ICC Workshops). IEEE, 2021. http://dx.doi.org/10.1109/iccworkshops50388.2021.9473857.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

A. Akintola, A., G. A. Aderounmu, L. A. Akanbi i M. O. Adigun. "Modeling and Performance Analysis of Dynamic Random Early Detection (DRED) Gateway for Congestion Avoidance". W InSITE 2005: Informing Science + IT Education Conference. Informing Science Institute, 2005. http://dx.doi.org/10.28945/2920.

Pełny tekst źródła
Streszczenie:
One of the most prominent congestion avoidance schemes in the Internet architecture is the Random Early Detection (RED) algorithm. Several modifications and enhancements have been made to the original RED so as to make it more responsive to congestion avoidance at the gateways. In this paper, we introduced the Dynamic Random Early Detection (DRED) model, which uses a newly introduced parameter i.e. warning line. A robust and efficacious technique to measure the burstiness of incoming traffic has been developed and tested. This involves the estimation of the average queue size, avg, which is dynamically adjusted hence the name of our scheme. The empirical results obtained from the simulations show that our DRED scheme responds early enough to the increased number of packets at the gateway. Also, the maximum drop probability of packets show improved performance over the original RED. It was concluded that our scheme demonstrated superiority by avoiding global synchronization and there is great reduction in the fluctuations of the actual queue size. Also, its early response avoids buffer overflow at the gateways when the queue is near full.
Style APA, Harvard, Vancouver, ISO itp.
5

Yoshida, Taishi, i Yoshiaki Oka. "High Breeding Core of a Supercritical-Pressure Light Water Cooled Fast Reactor". W 2013 21st International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/icone21-15753.

Pełny tekst źródła
Streszczenie:
Breeding of plutonium with light water cooling has been studied for many years, but high breeding to meet growing demand for electricity in a developed country has not been accomplished. The purpose of this study is to investigate a high breeding core of Super FBR (supercritical pressure light water cooled fast breeder reactor) with new fuel assemblies consisting of tightly packed fuel rods without gaps, which leads to low coolant to fuel volume fraction. The plant system of a Super FBR is once-through coolant cycle with high head pumps. The coolant flow rate is low due to the high enthalpy rise in the core. It is compatible with the high pressure drop of the new fuel assemblies. Both neutronic and thermal hydraulic design of the core is considered. The challenge of high breeding with light water cooling is to satisfy negative coolant void reactivity, high breeding and low enrichment simultaneously. The core with new assemblies has been designed with the average coolant density of 248 kg/m3. It is achieved by setting 380C inlet and 500C outlet temperature. For satisfying negative void reactivity, a solid moderator layer composed of zirconium hydride (ZrH) rods are adopted in some blanket assemblies. Cross sections of the blanket fuel assemblies with ZrH rods are prepared with assembly-wise calculation, because the pin-wise collision probability calculation overestimates the breeding. MOX fuel is used for seed fuel assemblies. Three types of core layouts with “radially heterogeneous”, “radiating” and “scattered” seed assemblies have been considered, and “radiating” layout shows best breeding characteristics among them. The seed assemblies in a “radiating” layout are not radially separated so that more numbers of blanket assemblies can be placed in high neutron flux region of a core. Fraction of blanket fuel assemblies with ZrH rods is selected for high breeding. Super FBR using the new fuel assemblies achieved both negative void and high plutonium breeding.
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii