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ł

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