Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "packet" wg kryterium: Wszystkie pola


Tytuł:
Wpływ kontrolera TNC na opóźnienia transmisji w sieci Packet Radio
TNC Controller Influence on Transmission Delays in Packet Radio Network
Autorzy:
Zieliński, B.
Powiązania:
https://bibliotekanauki.pl/articles/156649.pdf
Data publikacji:
2011
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
sieć Packet Radio
kontroler TNC
opóźnienia transmisji
Packet Radio network
TNC controller
transmission delays
Opis:
Kontrolery TNC są układami mikroprocesorowymi, służącymi do przesyłu informacji w sieci Packet Radio. W pracy przedstawiono wyniki badań opóźnień rozpoczęcia i zakończenia transmisji w doświadczalnej sieci Packet Radio, uzyskane przy użyciu różnych typów kontrolerów TNC. Wyniki te skonfrontowano z wynikami obliczeń z wykorzystaniem wprowadzonego wcześniej analitycznego modelu kontrolera TNC. Przedstawione rozważania mogą posłużyć do oceny możliwości zastosowania kontrolerów TNC w określonych aplikacjach uwarunkowanych czasowo.
TNC controllers are microprocessor-based circuits used as network adapters for amateur Packet Radio network. They can, however, be used in other applications, e.g., remote control or telemetry. In such applications, it is often necessary to estimate transmission delays. This paper briefly presents the previously developed analytical model that allows estimating delays of transmission start and end. Calculation results obtained with this model are used as a reference point for results obtained in an experimental Packet Radio network using various types of TNC controllers. These results clearly show that the processing power of the TNC controller microprocessor has great influence on the aforementioned transmission delays. How-ever, detailed analysis of the results shows that software-dependent protocol implementation issues also influence network achievements. Thus, it requires further research using a common hardware platform with various types and versions of the software. The presented considerations can help in analysis of TNC controller application possibilities in certain time-bounded applications.
Źródło:
Pomiary Automatyka Kontrola; 2011, R. 57, nr 1, 1; 39-41
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simple analysis of the impact of packet loss and delay on voice transmission quality
Autorzy:
Perlicki, K.
Powiązania:
https://bibliotekanauki.pl/articles/309277.pdf
Data publikacji:
2002
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
E-model
packet network
packet loss
delay
transmission quality rating
Opis:
In this paper a simple analytical expression based on E-model is applied to analyse the impact of packet loss and delay on voice transmission quality. The relationship between overall transmission quality rating, packet loss and delay G.711, G.723 and G.729 codes is presented.
Źródło:
Journal of Telecommunications and Information Technology; 2002, 2; 53-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of a method for enumerating the most probable packet arrangements
Autorzy:
Szcześniak, I.
Powiązania:
https://bibliotekanauki.pl/articles/121700.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
packet networks
synchronous network
sieci pakietowe
sieć synchroniczna
Opis:
The problem of calculating routing probabilities in packet synchronous networks, such as optically-switched packet networks, involves enumerating packet arrangements. Previously we published a method for enumerating the most probable packet arrangements, and in this article we present its novel graph interpretation and evaluate the method for several stop conditions and for the Poisson and geometric probability distributions of arriving packets.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2011, 16; 147-152
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Survey of Several IP Traceback Mechanisms and Path Reconstruction
Autorzy:
Rajkumar, M. Newlin
Amsarani, R.
Shiny, M. U.
Powiązania:
https://bibliotekanauki.pl/articles/1191427.pdf
Data publikacji:
2016
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Dos attack
Packet marking
Packet logging
Probabilistic packet marking
Hash based scheme
reflector attack
ICMP
passive IP traceback
contol flooding
input debugging
Opis:
In real world the peoples having a lot of attacks troubles in the network. The unauthorized persons or hackers are use the another person’s IP address or use the attackers nearest IP address with in the area. If some kinds attacks such as DOS, DDOS attacks are create a lot of issues in network so difficult to find the spoofers or attackers. In this papper presents the Several IP Traceback Mechanism and Path Reconstruction.
Źródło:
World Scientific News; 2016, 40; 12-22
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hermite and Laguerre wave packet expansions
Autorzy:
Epperson, Jay
Powiązania:
https://bibliotekanauki.pl/articles/1218865.pdf
Data publikacji:
1997
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Opis:
This paper describes expansions in terms of Hermite and Laguerre functions similar to the Frazier-Jawerth expansion in Fourier analysis. The wave packets occurring in these expansions are finite linear combinations of Hermite and Laguerre functions. The Shannon sampling formula played an important role in the derivation of the Frazier-Jawerth expansion. In this paper we use the Christoffel-Darboux formula for orthogonal polynomials instead. We obtain estimates on the decay of the Hermite and Laguerre wave packets by investigating two closely related oscillatory integrals.
Źródło:
Studia Mathematica; 1997, 126, 3; 199-217
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SMM Clos-Network Switches under SD Algorithm
Autorzy:
Kleban, J.
Warczyński, J.
Powiązania:
https://bibliotekanauki.pl/articles/307990.pdf
Data publikacji:
2018
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
clos-network switch
packet dispatching algorithms
packet switching networks
stability of switching network
Opis:
This paper is devoted to evaluating the performance of Space-Memory-Memory (SMM) Clos-network switches under a packet dispatching scheme employing static connection patterns, referred to as Static Dispatching (SD). The control algorithm with static connection patterns can be easily implemented in the SMM fabric due to bufferless switches in the first stage. Stability is one of the very important performance factors of packet switching nodes. In general, a switch is stable for a particular arrival process if the expected length of the packet queues does not increase without limitation. To prove the stability of the SMM Clos-network switches considered under the SD packet dispatching scheme the discrete Markov chain model of the switch is used and Foster’s criteria to extend Lyapunov’s second (direct) method of stability investigation of discrete time stochastic systems are used. The results of simulation experiments, in terms of average cell delay and packet queue lengths, are shown as well.
Źródło:
Journal of Telecommunications and Information Technology; 2018, 1; 24-31
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Use of Modified Adaptive Heuristic Critic Algorithm for Novel Scheduling Mechanism in Packet-Switched Networks
Autorzy:
Jednoralski, M.
Kacprzak, T.
Powiązania:
https://bibliotekanauki.pl/articles/92909.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
reinforcement learning
telecommunication networks
packet scheduling
Opis:
In this paper a novel scheduling algorithm of packet selection in a switch node for transmission in a network channel, based on Reinforcement Learning and modified Adaptive Heuristic Critic is introduced. A comparison of two well known scheduling algorithms: Earliest Deadline First and Round Robin shows that these algorithms perform well in some cases, but they cannot adapt their behavior to traffic changes. Simulation studies show that novel scheduling algorithm outperforms Round Robin and Earliest Deadline First by adapting to changing of network conditions.
Źródło:
Studia Informatica : systems and information technology; 2005, 2(6); 21-34
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tunnelling effects of a Gaussian wave packet impinging on a barrier
Autorzy:
Papadopoulos, George J.
Powiązania:
https://bibliotekanauki.pl/articles/1954608.pdf
Data publikacji:
2020
Wydawca:
Politechnika Gdańska
Tematy:
quantum tunnelling
Gaussiam wave packet
potential barrier
tunelowanie kwantowe
fale Gaussama
potencjalna bariera
Opis:
A general procedure based on momentum-like quantity provides the reflection and transmission amplitudes for a given barrier sandwiched by semiconductor reservoirs is presented. Furthermore, the evolution of the wave function stemming from an initial Gaussian wave packet located on the left hand side of the barrier with ignorable barrier overlap is obtained. The evolving wave function enables obtaining the associated probability and current densities space and time-wise. As application, the case of smooth double barrier is considered. The numerical results exhibit similar picture as obtained via propagator in the limited case of square barrier, e.g. repeated current density reversal at the barrier entrance, while being unidirectional at the exit. Presently, the treatment takes account of any barrier, inclusive of applied voltage. The basic quantity required is the value of the momentum-like quantity at the barrier entrance, which is obtained solving a Riccati equation governing the quantity, in question, whose value is known at the barrier exit in terms of the carrier energy and applied bias.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2020, 24, 1; 83-91
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Packet switch architecture with multiple output queueing
Autorzy:
Danilewicz, G.
Głąbowski, M.
Kabaciński, W.
Kleban, J.
Powiązania:
https://bibliotekanauki.pl/articles/308342.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
high-speed packet switching
output queueing
buffer
switch fabric
switching node
multicast
Opis:
In this paper the new packet switch architecture with multiple output queuing (MOQ) is proposed. In this architecture the nonblocking switch fabric, which has the capacity of N _N2 N2, and output buffers arranged into N separate queues for each output, are applied. Each of N queues in one output port stores packets directed to this output only from one input. Both switch fabric and buffers can operate at the same speed as input and output ports. This solution does not need any speedup in the switch fabric as well as arbitration logic for taking decisions which packets from inputs will be transferred to outputs. Two possible switch fabric structures are considered: the centralized structure with the switch fabric located on one or several separate boards, and distributed structure with the switch fabric distributed over line cards. Buffer arrangements as separate queues with independent write pointers or as a memory bank with one pointer are also discussed. The mean cell delay and cell loss probability as performance measures for the proposed switch architecture are evaluated and compared with performance of OQ architecture and VOQ architecture. The hardware complexity of OQ, VOQ and presented MOQ are also compared. We conclude that hardware complexity of proposed switch is very similar to VOQ switch but its performance is comparable to OQ switch.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 4; 76-83
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods for evaluation packet delay distribution of flows using Expedited Forwarding PHB
Autorzy:
Kaczmarek, S.
Narloch, M.
Powiązania:
https://bibliotekanauki.pl/articles/308193.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
packet delay distribution
Expedited Forwarding PHB
differentiated services
Service Level Specification
IP QoS
Opis:
The paper regards problem of providing statistical performance guarantees for real-time flows using Expedited Forwarding Per Hop Behavior (EF PHB) in IP Differentiated Services networks. Statistical approach to EF flows performance guarantees, based on calculation of probability that end-to-end packet delay is larger than certain value, allows larger network utilization than previously proposed deterministic approach. In the paper different methods of packet delay distribution evaluation are presented and compared. Considered cases comprise evaluation of delay distribution models for the core network and evaluation of end-to-end packet delay in the network consisted of edge node and chain of core nodes. Results obtained with aid of analytical models are compared with simulation results.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 2; 29-37
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simulation of Package Waves
Autorzy:
Sadatian, S. Davood
Powiązania:
https://bibliotekanauki.pl/articles/1182890.pdf
Data publikacji:
2016
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Wave Packet; Synchrotron radiation
Opis:
An important application of simulation methods in the fields of Computational Physics, Physical Chemistry and quantum chromodynamics used to perform complex calculations related to the construction of the thermal covering on a spacecraft. In this study, we tried to establish a framework of appropriate software known as Computational Physics Laboratory and simulate a propagation of waves by computer.
Źródło:
World Scientific News; 2016, 53, 3; 309-322
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Oprogramowanie Herkules do obliczania parametrów wytrzymałosciowych elementów obudowy górniczej
The packet Herkules of software for calculation results of strength tests of mining support units
Autorzy:
Pacześniowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/340853.pdf
Data publikacji:
2010
Wydawca:
Główny Instytut Górnictwa
Tematy:
pakiet Herkules
Herkules packet
Opis:
Przedstawiono założenia, opis oraz sposób posługiwania się programami komputerowymi zawartymi w pakiecie Herkules, które są przeznaczone do obliczania parametrów wytrzymałościowych elementów obudów górniczych, na podstawie wyników badań stanowiskowych.
Assumptions, description, as well as the way of use of computer programmes contained in Herkules packet were presented, which are designed for calculation of strength parameters of mining support units, on the basis of results of stand tests.
Źródło:
Prace Naukowe GIG. Górnictwo i Środowisko / Główny Instytut Górnictwa; 2010, 4; 59-73
1643-7608
Pojawia się w:
Prace Naukowe GIG. Górnictwo i Środowisko / Główny Instytut Górnictwa
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dekompozycja falkowa profilu powierzchni obrobionej po toczeniu
Wavelet packet decomposition of turned surface profile
Autorzy:
Zawada-Tomkiewicz, A.
Powiązania:
https://bibliotekanauki.pl/articles/156457.pdf
Data publikacji:
2009
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
powierzchnia obrobiona
dekompozycja metodą pakietów falkowych
entropia
machined surface
wavelet packet decomposition
entropy
Opis:
Powierzchnię obrobioną po toczeniu można scharakteryzować jako zbiór różnych składowych częstotliwości. Jedną z metod opisu tego typu powierzchni jest dekompozycja przy zastosowaniu transformaty pakietów falkowych. Celem pracy była optymalizacja struktury drzewa uzyskanych metodą pakietów falkowych dla dekompozycji profilu powierzchni obrobionej. Dokonano rozdziału sygnału profilu dla 1480 przypadków różnych profili powierzchni i uogólniono statystycznie dobór najlepszego drzewa.
The optimisation of wavelet packets tree structure for turned surface decomposition is the aim of the work. The machined surface after the process of turning is characterised by the set of irregularities left by tool wedge pass. Tool geometry, feed rate and tool chipping are the basic factors influencing the surface features [1, 2]. The machined surface profile can be described by a continuous spectrum of wavelength. The information about the tool chipping and other maladjustments is contained in higher frequency components [3, 4, 5]. One of the techniques of machined surface profile decomposition is a wavelet packet transform. It enables to select the appropriate wavelet function and, simultaneously, to perform deep and complete analysis [6, 7, 8]. The wavelet packet decomposition was performed with use of the Coiflet wavelet function. The previous investigations had confirmed the usefulness of this wavelet function for the turned surface description [8]. For 1480 different machined surface profiles the best tree was statistically elaborated with use of the entropy criterion [10, 11, 12]. The discrete wavelet transform tree was indicated to be optimal for 69% machined surface profile decompositions. The completion of this tree with additional detail vectors enabled the analysis to be more thorough. The statistically optimal tree contained 97% optimal subtrees (Tab. 1.) and was treated as an optimal one.
Źródło:
Pomiary Automatyka Kontrola; 2009, R. 55, nr 4, 4; 243-246
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of Latency-Aware Network Slicing in 5G Packet xHaul Networks
Autorzy:
Klinkowski, Mirosław
Powiązania:
https://bibliotekanauki.pl/articles/27311921.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
5G
radio access networks
packet-switched xHaul
latency-sensitive network
network slicing
traffic prioritization
network optimization
Opis:
Packet-switched xHaul networks are a scalable solution enabling convergent transport of diverse types of radio data flows, such as fronthaul / midhaul / backhaul (FH / MH / BH) flows, between remote sites and a central site (hub) in 5G radio access networks (RANs). Such networks can be realized using the cost-efficient Ethernet technology, which enhanced with time-sensitive networking (TSN) features allows for prioritized transmission of latency-sensitive fronthaul flows. Provisioning of multiple types of 5G services of different service requirements in a shared network, commonly referred to as network slicing, requires adequate handling of transported data flows in order to satisfy particular service / slice requirements. In this work, we investigate two traffic prioritization policies, namely, flowaware (FA) and latency-aware (LA), in a packet-switched xHaul network supporting slices of different latency requirements. We evaluate the effectiveness of the policies in a networkplanning case study, where virtualized radio processing resources allocated at the processing pool (PP) facilities, for two slices related to enhanced mobile broadband (eMBB) and ultra-reliable low latency communications (URLLC) services, are subject to optimization. Using numerical experiments, we analyze PP cost savings from applying the LA policy (vs. FA) in various network scenarios. The savings in active PPs reach up to 40% − 60% in ring scenarios and 30% in a mesh network, whereas the gains in overall PP cost are up to 20% for the cost values assumed in the analysis.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 2; 335--340
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Noise Detection for Biosignals Using an Orthogonal Wavelet Packet Tree Denoising Algorithm
Autorzy:
Schimmack, M.
Mercorelli, P.
Powiązania:
https://bibliotekanauki.pl/articles/226940.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
noise detection
wavelet packet transform
wavelet analysis
Daubechies wavelet
linux-based embedded system
ARM processor platform
Opis:
This article deals with the noise detection of discrete biosignals using an orthogonal wavelet packet. In specific, it compares the usefulness of Daubechies wavelets with different vanishing moments for the denoising and compression of the digitalised biosignals in case of surface electromyography (sEMG) signals. The work is based upon the discrete wavelet transform (DWT) version of wavelet package transform (WPT). A noise reducing algorithm is proposed to detect unavoidable noise in the acquired data in a model independent way. The noise of a signal sequence will be defined by a seminorm. This method was developed for a possible observation during a fracture healing period. The proposed method is general for signal processing and its design was based upon the wavelet packet.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 1; 15-21
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Study on Packet Scheduling Algorithms for Healthcare Contents over Fifth Generation (5G) Mobile Cellular Network
Autorzy:
Ramli, Huda Adibah Mohd
Powiązania:
https://bibliotekanauki.pl/articles/1844466.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
packet scheduling
5G
flexible frame structure
transmission reliability
scalable TTI
Opis:
This paper models the downlink Fifth Generation (5G) network that supports a flexible frame structure and a shorter Round-Trip Time (RTT) for Hybrid Automatic Repeat Request (HARQ). Moreover, the design of the renowned Time Division Multiple Access (TDMA) packet scheduling algorithms is revised to allow these algorithms to support packet scheduling in the downlink 5G. Simulation results demonstrate that the Proportional Fair provides a comparable performance to the delay–aware Maximum-Largest Weighted Delay First for simultaneously providing the desired transmission reliability of the Guaranteed Bit Rate (GBR) and Non-Guaranteed Bit Rate (Non - GBR) healthcare contents whilst maximizing the downlink 5G performance.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 4; 729-735
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wavelet Packet Transform based Speech Enhancement via Two-Dimensional SPP Estimator with Generalized Gamma Priors
Autorzy:
Sun, P.
Qin, J.
Powiązania:
https://bibliotekanauki.pl/articles/177782.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
speech enhancement
speech presence probability
wavelet packet transform
two-dimensional Teager energy operator
Opis:
Despite various speech enhancement techniques have been developed for different applications, existing methods are limited in noisy environments with high ambient noise levels. Speech presence probability (SPP) estimation is a speech enhancement technique to reduce speech distortions, especially in low signalto-noise ratios (SNRs) scenario. In this paper, we propose a new two-dimensional (2D) Teager-energyoperators (TEOs) improved SPP estimator for speech enhancement in time-frequency (T-F) domain. Wavelet packet transform (WPT) as a multiband decomposition technique is used to concentrate the energy distribution of speech components. A minimum mean-square error (MMSE) estimator is obtained based on the generalized gamma distribution speech model in WPT domain. In addition, the speech samples corrupted by environment and occupational noises (i.e., machine shop, factory and station) at different input SNRs are used to validate the proposed algorithm. Results suggest that the proposed method achieves a significant enhancement on perceptual quality, compared with four conventional speech enhancement algorithms (i.e., MMSE-84, MMSE-04, Wiener-96, and BTW).
Źródło:
Archives of Acoustics; 2016, 41, 3; 579-590
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Light Weight Clustered Trust Sensing Mechanism for Internet of Things Network
Autorzy:
Rajendra Prasad, M.
Krishna Reddy, D.
Powiązania:
https://bibliotekanauki.pl/articles/2055236.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
internet of things
trust sensing
clustering
mobility
packet forwarding factor
malicious detection rate
packet delivery ratio
Opis:
Internet of Things (IoT) is the new research paradigm which has gained a great significance due to its widespread applicability in diverse fields. Due to the open nature of communication and control, the IoT network is more susceptible to several security threats. Hence the IoT network requires a trust aware mechanism which can identify and isolate the malicious nodes. Trust Sensing has been playing a significant role in dealing with security issue in IoT. A novel a Light Weight Clustered Trust Sensing (LWCTS) model is developed which ensures a secured and qualitative data transmission in the IoT network. Simulation experiments are conducted over the proposed model and the performance is compared with existing models. The obtained results prove the effectiveness when compared with existing approaches.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 1; 5--12
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of AQM queues with queue size based packet dropping
Autorzy:
Chydziński, A.
Chróst, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/907529.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system kolejkowy
porzucanie pakietu
wielkość rozproszenia
aktywne zarządzanie kolejką
single-server queue
packet dropping
queue size distribution
active queue management
Opis:
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 567-577
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for the optimization of total weighted completion time for asynchronous transmission in a packet data transmission system
Autorzy:
Piórkowski, A.
Werewka, J.
Bielecka, M.
Powiązania:
https://bibliotekanauki.pl/articles/206673.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
total weighted completion time
total cost factor
optimization
heuristic algorithms
packet transmission
Opis:
In this paper, the minimization of total weighted completion time (total cost) for asynchronous transmission in distributed systems is discussed. Special attention has been paid to the problem of message scheduling on the sender side. Messages to be sent form a queue, therefore the order in which they are to be sent has to be set. Scheduling algorithms can be chosen to optimize scheduling criteria such as total completion time or total weighted completion time. The message scheduling problem becomes complicated considerably when the transmitted data stream between the sender and the receiver is formed into packets. TheWSPT (Weighted Shortest Processing Time) scheduling rule, which orders messages according to non-decreasing length and weight ratios has been proven to be non-optimal. It has been demonstrated that the problem of minimizing the total weighted completion time is NP-hard. Here, we propose heuristic algorithms for scheduling messages and experimentally evaluate the performance of these scheduling algorithms.
Źródło:
Control and Cybernetics; 2014, 43, 4; 507-529
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Rattle Signal Denoising and Enhancing Method Based on Wavelet Packet Decomposition and Mathematical Morphology Filter for Vehicle
Autorzy:
Liang, Linyuan
Chen, Shuming
Li, Peiran
Powiązania:
https://bibliotekanauki.pl/articles/2141688.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
rattle signals
wavelet packet decomposition
mathematical morphology filter
critical frequency band
information entropy
Opis:
Buzz, squeak and rattle (BSR) noise has become apparent in vehicles due to the significant reductions in engine noise and road noise. The BSR often occurs in driving condition with many interference signals. Thus, the automatic BSR detection remains a challenge for vehicle engineers. In this paper, a rattle signal denoising and enhancing method is proposed to extract the rattle components from in-vehicle background noise. The proposed method combines the advantages of wavelet packet decomposition and mathematical morphology filter. The critical frequency band and the information entropy are introduced to improve the wavelet packet threshold denoising method. A rattle component enhancing method based on multi-scale compound morphological filter is proposed, and the kurtosis values are introduced to determine the best parameters of the filter. To examine the feasibility of the proposed algorithm, synthetic brake caliper rattle signals with various SNR ratios are prepared to verify the algorithm. In the validation analysis, the proposed method can well remove the disturbance background noise in the signal and extract the rattle components with well SNR ratios. It is believed that the algorithm discussed in this paper can be further applied to facilitate the detection of the vehicle rattle noise in industry.
Źródło:
Archives of Acoustics; 2022, 47, 1; 43-55
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
All-Optical Techniques Enabling Packet Switching with Label Processing and Label Rewriting
Autorzy:
Jung, H.
Llorente, J. H.
Tangdiongga, E.
Koonen, T.
Dorren, H.
Powiązania:
https://bibliotekanauki.pl/articles/308821.pdf
Data publikacji:
2009
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
label processor
optical flip-flop memory
optical packet switching
optical signal processing
wavelength converter
Opis:
Scalability of packet switched cross-connects that utilize all-optical signal processing is a crucial issue that eventually determines the future role of photonic signal processing in optical networks. After reviewing several labeling techniques, we discuss label stacking and label swapping techniques and their benefits for scalable optical packet switched nodes. All-optical devices for implementing the packet switch based on the labeling techniques will be described. Finally, we present a 1×4 all-optical packet switch based on label swapping technique that utilizes a scalable and asynchronous label processor and label rewriter. Error-free operation indicates a potential utilization of the swapping technique in a multihop packet-switched network.
Źródło:
Journal of Telecommunications and Information Technology; 2009, 1; 20-28
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flow caching effectiveness in packet forwarding applicati
Autorzy:
Czekaj, Maciej
Jamro, Ernest
Powiązania:
https://bibliotekanauki.pl/articles/305321.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
computer networks
caching
SDN
Opis:
Routing algorithms are known to be potential bottlenecks for packet processing. Network ow caching can function as a general acceleration technique for packet processing workloads. The goal of this article is to evaluate the effectiveness of packet ow caching techniques in high-speed networks. The area of focus is the data distribution characteristics that lead to the effectiveness of caching network ows (connections). Based on a statistical analysis and simulations, the article sets the necessary conditions for the effective use of caches in packet forwarding applications. Public domain network traces were examined and measured for data locality. Software simulations show a strong correlation between the ow packet distance metrics and the cache hit rate.
Źródło:
Computer Science; 2019, 20 (2); 145-163
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatyzacja pomiarów pakietowej stopy błędów w cyfrowym torze radiowym
Automation of packet error rate measurements in digital radio link
Autorzy:
Rzepka, D.
Krzak, Ł.
Worek, C.
Powiązania:
https://bibliotekanauki.pl/articles/152554.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
pakietowa stopa błędów
PER
tor radiowy
automatyzacja pomiarów
packet error rate
radio
testbed
measurement automation
Opis:
Ocena jakości cyfrowego systemu radiokomunikacyjnego polega najczę- ściej na określeniu stopy błędów dla różnych stanów kanału transmisyjnego. W artykule przedstawiono przykładowy tor pomiarowy, umożliwiający automatyzację tego rodzaju testów. Przeanalizowano również zależność dokładności pomiaru od ilości odebranych danych oraz zbadano wpływ iteracyjnego wyznaczania ilości danych na błąd pomiaru.
Design of digital radio networks requires procedures for verification of transmission quality for every device participating in data exchange. The primary criterion of quality level is measurement of packet error rate (PER). A testbed presented in this paper enables automation of such measurements according to a programmable scenario, using control interfaces of measurement devices and processing results. The test transmitter consists of a RF signal generator modulated with the signal from an arbitrary pattern generator. A PC computer generates a test signal, controls and processes the data. The required precision of PER (Pt) measurements can be achieved by sending a certain number of test frames (n), which can be evaluated analytically [I]. The presented radio testbed was used for projects "Radio voice communication and remote control system for safety blockades and machinery, designed to work in underground coal mines" [2] and "Photovoltaics and sensors in environmental development of Malopolska region", for verification of detection and synchronization algorithms designed and implemented on FPGA devices [3]. It resulted in significant decrease of the measurements time and effort, accelerating diagnostics for radio modules.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 8, 8; 990-993
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping
Autorzy:
Tikhonenko, O.
Kempa, W. M.
Powiązania:
https://bibliotekanauki.pl/articles/331288.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
AQM algorithm
finite buffer
loss probability
total packet volume
queue size distribution
aktywne zarządzanie kolejką
prawdopodobieństwo straty
rozkład wielkości kolejki
Opis:
A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 841-854
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies