Packet-switched Data Research Articles

Pengaruh Push, Pull, dan Mooring terhadap Switching Intention pada Konsumen Pengguna Wifi di Era Pandemi Covid-19

Internet use during the current pandemic is increasing, and most are done online. Work From Home (WFH) and School From Home (SFH) require stable and smooth internet. In addition to the internet, smartphones also play an essential role in people's daily lives during restrictions due to the pandemic. This study aims to analyze and discuss the effect of push, pull and mooring on switching intention. This study uses a push-pull-mooring model with an approach through switching intention. Respondents in this study were at least 20 years old. Due to this age, respondents have entered the adult stage in switching intentions from internet data packages to wifi. The sample used is 110 respondents—the sampling method used non-probability sampling with the judgmental sampling method. The analysis technique uses multiple linear regression with SPSS26 software. Based on the results obtained, it is known that the push variable on switching intention to use wifi has a positive effect. The pull variable has a positive impact on switching intention to use wifi. When the push and pull are getting stronger, consumers will switch. Mooring variable does not affect internet data packet switching intention to private wifi. This result shows that the switching intention of data packets to use wifi privately at home is relatively high. Due to using private wifi, you can access or surf the internet at a stable speed compared to data packet internet, in contrast to using data packet internet whose network is unstable.

ІМОВІРНІСНА МОДЕЛЬ НЕЛЕГІТИМНОГО КОРЕСПОНДЕНТА ДРУГОГО РІВНЯ ЗАБЕЗПЕЧЕННЯ БЕЗПЕКИ IP-ТЕЛЕФОНІЇ

The paper proposes a probabilistic model for identifying an illegitimate second-level correspondent based on the Diffie-Hellman algorithm. Solves the following tasks: allows you to identify an active illegitimate correspondent who uses voice synthesis software; to identify an active illegitimate correspondent of IP - protocols in the communication channels of Internet telephony in the absence of previously distributed secret key information between the correspondents, the entrusted center. The model of an illegitimate correspondent can be used to assess methods for monitoring the security level of a packet-switched data stream in Internet telephony, which will ensure the reliability of IP telephony and increase security. The proposed model of an illegitimate correspondent will take into account the level of the attackers' capabilities. The second-level illegitimate correspondent model takes into account illegitimate correspondents who do not have an appropriate level of access to secure IP-telephony services. In this case, 55 illegitimate correspondents may include: unauthorized persons; persons of foreign states; representatives of foreign intelligence services; terrorist and criminal structures. The goals of illegitimate second-level subscribers in carrying out an active attack in order to obtain unauthorized access to the data stream of IP - telephony are determined: seizure of the operator's equipment; capture of the subscriber monitor. The ultimate goal of every active attack is to gain unauthorized access to the IP telephony data stream. The results of the analysis and research make it possible to indicate that the most well-known IP-protocols for the distribution of general secret information need to be improved in two directions: increasing the information security of IP-telephony and improving the main indicators of IP-protocols of Internet networks. One of the methods to improve the security of the IP protocol for the formation of shared secret information is to monitor and prohibit the execution of a meeting-in-the-middle attack through the use of several parallel independent channels of communication sessions in the Internet IP-telephony networks.

Моделирование гетерогенной сети передачи данных с коммутацией пакетов как системы массового обслуживания с абсолютным приоритетом и резервированием канального ресурса

The article deals with the solution of a timely and relevant scientific and technical problem of modeling the data transmission network of a system for monitoring the state of critical state facilities. The need to develop a new model of such a data transmission network is due to the introduction of means of dynamic multimodal authentication of the legitimacy and deviance of the person of critical objects. Such authentication tools for the data transmission network become new sources of incoming load with special properties. For highquality performance of the functions of monitoring a critical object, the article suggests a constructive approach to the development of a model of a heterogeneous packet-switched data transmission network, to which not only messages of traditional communication services, but also messages in a multimodal representation circulate. The protocol data blocks of multi-channel messages are small in size, but they must be transmitted to the management body of a critical object with high security re-quirements. In this regard, the object of modeling – a data transmission network with packet communication is represented as a queuing system with absolute priority and channel resource reservation. This approach avoids replacing more resource-intensive messages (traditional communication services) with less resource-intensive ones (messages in a multimodal representation) while meeting the quality of service requirements of both types of load. As a result of the simulation, expressions are obtained for calculating the quality of service indicators for incoming requests for messages of traditional communication services and messages in a multimodal representation. The proposed model, together with the existing models of queuing systems, will allow solving computational and research tasks to find rational design strategies for building data transmission networks with packet switching for monitoring critical state facilities.

A novel localised network coding-based overhearing strategy

Network coding is a very effective approach to improve network throughput and reduce end-to-end delay. However, the existing approaches cannot thoroughly solve the problem of how to deal with newly overheard packets when the buffer is full, meanwhile, coding node does not schedule the packets in coding queue according to the packets' information in overhearing buffer. As a result, these methodologies lack flexibility and require quite a few assumptions. To address these limitations, we propose a new network coding overhearing strategy which is based on data packet switching and scheduling (DPSS) algorithm. First, when overhearing buffer is full and the sink nodes have overheard new packets, sink nodes will drop the recently overheard packets but record their IDs; second, sink nodes report the packets' information to the coding node that schedules the packets in coding queue for ease of encoding. Finally, sink nodes delete the packets which have been used for decoding, and call for the ever dropped packets when decoding ratio reaches the threshold. Theoretical analysis and simulation demonstrate that, compared with traditional overhearing policies, our scheme gets higher coding ratio and less delay.

Scheduling with Machine-Learning-Based Flow Detection for Packet-Switched Optical Data Center Networks

A scalable, low-latency, high-speed, and energy-efficient data center network is a key element in the deployment of future large-scale data centers, and photonic switching has recently been recognized as a promising solution to fulfill these goals. In this study, we present a packet-switched optical network (PSON) architecture with centralized control for intra-data-center connectivity. For efficient PSON operation, intelligent yet low-complexity bandwidth-scheduling algorithms are critical. To align with realistic traffic flows in a data center, we consider “mice flow,” which occurs frequently but carries a small number of bytes, and “elephant flow,” which occurs occasionally but has a huge number of bytes. To classify traffic flows with different characteristics, we investigate various machine-learning (classification) techniques, such as C4.5 and Naïve Bayes Discretization, and compare their performance in terms of accuracy and classification speed. We also develop a priority-aware scheduling algorithm for packet switching, which is optimized for PSON, and is adaptive to flow classification under a dynamic traffic scenario. Numerical simulations show that our proposed scheduling algorithm assisted by flow-classification techniques can outperform a benchmark algorithm in terms of average delay and packet-loss ratio.

User-to-User Mutual Authentication and Key Agreement Scheme for LTE Cellular System

Long Term Evolution LTE is the first technology that provides exclusively packet-switched data and modifies the security architecture of the 2G and 3G systems. The LTE security architecture offers confidentiality, access control, a kind of obscurity and mutual authentication. However, numerous types of attacks can be encountered during the mutual authentication process which is a challenge-response based technique. Therefore, a high secure public key algorithm can be implemented to improve the network security services. As the network operator is often considered as not being a highly trusted party and can thus face threats, the communications ends are the only secure parties to provide such security features. This paper pro- poses a secure mutual authentication and key agreement scheme for LTE cellular system with user-to-user security. The network side in this scheme operates as a proxy and non-trusted party to provide the security architecture with more exibility and reliability. This is achieved by using designated verifier proxy signature and key agreement protocol based bilinear pairing with some changes in both security algorithms and LTE security architecture within the LTE standardization. Our security and performance analysis demonstrated that the proposed scheme is more secure compared to the basic authentication and key agreements schemes.

Rate-Adaptive Scheduling Policies for Network Stability and Energy Efficiency

A key problem in the control of packet-switched data networks is to schedule the data so that the queue sizes remain bounded over time. Scheduling policies have been developed in a number of different models that ensure network stability as long as no queue is inherently overloaded. However, this literature typically assumes that each server runs at a fixed maximum rate. Although this is optimal for clearing queue backlogs as fast as possible, it may be suboptimal in terms of energy consumption. Indeed, a lightly loaded server could operate at a lower rate, at least temporarily, to save energy. Within an energy-aware framework, a natural question is how stability and other performance measures such as delay are affected by the reduced processing rate of the servers. In this paper, we demonstrate the following results toward answering that question. Starting with the simplest case of a single server in isolation, we consider two types of rate adaptation policies that exhibit a tradeoff between queue size and energy usage. We also present a lower bound on the best such tradeoff that can possibly be achieved. Next, we study a general network environment and investigate the connectionless model for which connection paths can rapidly change over time. We propose a combination of the above rate adaptation policies with the standard Farthest-to-Go scheduling policy. This approach provides stability in the network setting while using an amount of energy that is within a bounded factor of the optimum.

Optimal Virtual Slice Composition Toward Multi-Tenancy Over Hybrid OCS/OPS Data Center Networks

Multi-tenancy is a key feature of modern data centers. It allows for the existence of multiple independent virtual infrastructures, called virtual slices, on top of the same physical infrastructure, each of them specially tailored to the tenants' needs. In such a scenario, an optimal mapping of the virtual slices plays a capital role toward an efficient utilization of the data center network resources, potentially saving costs for the data center owner. However, due to the increasing trend of bringing optics to data center networks, specific virtual slice mapping mechanisms accounting for the particularities of the optical medium (e.g., wavelength continuity constraint) have to be investigated. For this, we present an integer linear programming (ILP) model for optimally mapping a set of virtual slices from different tenants in a hybrid optical circuit switching (OCS)/optical packet switching (OPS) data center network with the aim to minimize the necessary optical transponders to be equipped in the network. Additionally, we also present a lightweight heuristic for the cases in which the ILP model scalability is compromised. The benefits of the proposals are highlighted by benchmarking them against a pure OCS solution through extensive simulations.

Integrated circuit-packet switching NoC with efficient circuit setup mechanism

Reducing the NoC power is critical for scaling up the number of nodes in future many-core systems. Most NoC designs adopt packet-switching to benefit from its high throughput and excellent scalability. These benefits, however, come at the price of the power consumption and latency overheads of routers. Circuit-switching, on the other hand, enjoys a significant reduction in power and latency of communication by directing data over pre-established circuits, but the relatively large circuit setup time and low resource utilization of this switching mechanism is often prohibitive. In this paper, we address one of the major problems of circuit-switching, i.e. the circuit setup time overhead, by an efficient and fast algorithm based on the time-division multiplexing scheme. We then further improve the performance by reserving circuits for anticipated messages, and hence completely hide circuit setup time. To address the low resource utilization problem, we integrate the proposed circuit-switching into a packet-switched NoC and use unused circuit resources to transfer packet-switched data. Evaluation results show considerable reduction in NoC power consumption and packet latency.

Improving the performance of packet-switched networks-on-chip by SDM-based adaptive shortcut paths

Reducing the NoC power is critical for scaling up the number of nodes in future many-core systems. Most NoC designs adopt packet-switching to benefit from its high throughput and excellent scalability. These benefits, however, come at the price of the power consumption and latency overheads of routers. Circuit-switching, on the other hand, enjoys a significant reduction in power and latency of communication by directing data over pre-established circuits, but the relatively large circuit setup time and low resource utilization of this switching mechanism is often prohibitive. In this paper, we address one of the major problems of circuit-switching, i.e. the circuit setup time overhead, by an efficient and fast algorithm based on the time-division multiplexing (TDM) scheme. We then further improve the performance by reserving circuits for anticipated messages, and hence completely hide circuit setup time. To address the low resource utilization problem, we integrate the proposed circuit-switching into a packet switched NoC and use unused circuit resources to transfer packet-switched data. Evaluation results show considerable reduction in NoC power consumption and packet latency.

Optical flip–flop memory and data packet switching operation based on polarization bistability in a telecommunication optical fiber

We report the experimental observation of bistability and hysteresis phenomena of the polarization signal in a telecommunication optical fiber. This process occurs in a counterpropagating configuration in which the optical beam nonlinearly interacts with its own Bragg-reflected replica at the fiber output. The proof of principle of optical flip–flop memory and 10  Gbit/s routing operation is also reported based on this polarization bistability. Finally, we also provide a general physical understanding of this behavior on the basis of a geometrical analysis of an effective model of the dynamics. Good quantitative agreement between theory and experiment is obtained.

A multi-processor NoC-based architecture for real-time image/video enhancement

The paper presents a multi-processor architecture for real-time and low-power image and video enhancement applications. Differently from other state-of-the-art parallel architectures the proposed solution is composed of heterogeneous tiles. The tiles have computational and memory capabilities, support different algorithmic classes and are connected by a novel Network-on-Chip (NoC) infrastructure. The proposed packet-switched data transfer scheme avoids communication bottlenecks when more tiles are working concurrently. The functional performances of the NoC-based multi-processor architecture are assessed by presenting the achieved results when the platform is programmed to support different enhancement algorithms for still images or videos. The implementation complexity of the NoC-based multi-tile platform, integrated in 65 nm CMOS technology, is reported and discussed.

Commercialization of packet switching (1975-1985): A Canadian perspective [History of Communications

The following article provides a fast-moving, exciting account of the early days of commercial packet switching in the 1970s, focusing on X.25 and, in particular, on Datapac, the X.25-based Canadian packet switching network. It follows an earlier article in this Column on packet switching in the United Kingdom. We hope to publish additional papers on the history of packet switching from other countries as well. We are so used to the Internet and its amazing suite of ever growing applications that we may tend to forget that in the 1970s and well into the 1980s, common carriers and computer manufacturers worked together in a concerted effort to introduce data packet switching capability worldwide. This effort required the rapid development of an international standard, X.25. This standard, once introduced, led to quick deployment of multiple data networks in many countries, helping lay the groundwork for the Internet. The Canadian Datapac network, in particular, was the first network to fully implement the X.25 suite. Tony Rybczynski, the author of the article, was a key figure in these developments. He describes both the technical and political discussions involved in expediting the introduction of the standard and data networks using it. All readers of this magazine will, I feel, gain considerably in reading this article.

Packet switching start–stop bits generation based on bifurcation behavior of light in a micro ring resonator

This paper proposes the interesting nonlinear behavior of light known as bifurcation, where the use of such behavior in a micro ring resonator to form the secure digital codes for optical packet switching application is demonstrated. A new concept of the stop–start bits in an optical packet switching protocol is formed by using the bifurcation codes. Bifurcation is introduced when light is input into a nonlinear micro ring device, where the refractive index of an InGaAsP/InP is one of device parameters. The other parameters of the device are coupling coefficient ( K) and the ring radius ( R), where the ring radii used are ranged from 5 to 10 μm. Simulation results obtained have shown that the packet switching data can be secured by using the generated start–stop bits as the secured codes.

Chaotic soliton switching generation using a nonlinear micro ring resonator for secure packet switching use

We propose a new design of the secure packet switching device using the nonlinear behaviors of soliton in a micro ring resonator, where the nonlinear penalty of light traveling in the device becomes beneficial. The chaotic signals are generated by a Kerr effects nonlinear type of the input soliton pulse in a micro ring resonator, where the control input power can be used to specify the output filtering signals. Some device parameters are chosen and simulated using the proposed model. The potential of using such a device for communication security is performed and discussed. For instance, the packet switching of the chaotic encoding data increases from the chaotic signal encoding of 100 bits −1. Results obtained have shown the potential of using such a proposed device for the tunable bandpass and band-stop filters, in which packet switching data can be performed and secured.

High-capacity and security packet switching using the nonlinear effects in micro ring resonators

We propose a new design of secured packet switching generated by using nonlinear behaviors of light in a micro ring resonator. The use of chaotic signals generated by the micro ring resonator to form the filtering and packet switching characteristics is described, where the high-capacity and security switching using such form is presented. The key advantage is that the high capacity of communication data can be secured in the transmission link, where the nonlinear penalty of light traveling in the device is beneficial. For instance, the required information can be transmitted and retrieved by using the proposed packet switching scheme. In principle, the chaotic signals are generated by a Kerr effects nonlinear type of light in a micro ring resonator, where the control input power can be specified by the required output filtering signals. The ring radii used range between 10 and 20 μm, κ=0.0225, α=0.5 dB and n 2=2.2×10 −15 m 2/W. Simulation results obtained have been described based on the practical device parameters. Three forms of the applications have been simulated, the potential of using for the tunable band pass and band stop filters, in which high-capacity packet switching data can be performed, and the fs switching time is plausible.

High Capacity Packet Switching with a Soliton Pulse in a Nonlinear Micro Ring Resonator

We propose a new design of the secured packet switching using the nonlinear behaviors of soliton in a micro ring resonator, where the nonlinear penalty of light traveling in the device becomes benefit. The chaotic signals are generated by a Kerr effects nonlinear type of soliton in a micro ring resonator, where the control input power can be used to specify the output filtering signals. Some device parameters are chosen and simulated using the proposed model. Results obtained have shown in good agreement with the practical device behaviors. The potential of using such a device for communication security is performed and discussed. For instance, the packet switching of the chaotic encoding data increases from the chaotic signal encoding of 100 bit/s. Results obtained have shown the potential of using such a proposed device for the tunable band-pass and band-stop filters, in which the packet switching data can be performed and secured.

Packet Switching Start-Stop Bits Generation Based on Bifurcation Behavior of Light in a Micro Ring Resonator

his paper proposes the interesting nonlinear behavior of light known as bifurcation, where the use of such behavior in a micro ring resonator to form the secure digital codes for optical packet switching application is demonstrated. A new concept of the stop-start bits in an optical packet switching protocol is formed by using the bifurcation codes. The bifurcation is introduced when light is input into a nonlinear micro ring device, where the refractive index of an InGaAsP/InP is one of device parameters. The other parameters of the device are coupling coefficient (K) and the ring radius (R), where the ring radii used are ranged from 5-10 microns. Simulation results obtained have shown that the packet switching data can be secured by using the generated start-stop bits as the secured codes.

Location-based assisted handover for the IP Multimedia Subsystem

The IP Multimedia Subsystem (IMS) is one promising candidate for merging currently deployed circuit-switched and packet-switched voice and data networks into a service-based All-IP architecture. One requirement common to all of these Next Generation Network (NGN) architectures is seamless user mobility – a mandatory feature in order to match with the tremendous success of today’s circuit-switched GSM voice networks. In addition most NGN architectures mandate the support for heterogeneous access technologies like WLAN, WiMAX, GPRS/EDGE, UMTS/HSDPA which raises the need for seamless vertical handover between these access technologies. Despite ongoing standardisation and technology developments like Generic Access Network (GAN), Voice Call Continuity (VCC) or Media Independent Handover (MIH, IEEE 802.21) we argue that there is currently no solution to enable seamless and application-transparent vertical handover in the IMS. In this paper, we review vertical handover standards for IMS and propose a novel vertical handover architecture which relies on geographical location and global network information as primary trigger or support for handover initiation. The underlying Session Initiation Protocol (SIP) notification framework – a Terminal-Centric IMS Location Enabler (LE) – is based on the key concept that location information is one specific kind of presence information which is optimally provisioned by mobile devices: the terminal knows best where it is located. The Location Enabler solicits notifications from the mobile device on specific events – e.g., entering or leaving specific geographical areas – thus dramatically reducing the amount of data transferred over the radio interface when compared to tracking or polling. The SIP registration and Re-Invite message flow is used to convey all handover-relevant information between the IMS core network and the mobile terminal. Using accurate access network measurement results the paper presents a performance estimation of the proposed vertical handover architecture with respect to handover duration and required handover area width at different velocities.

The evolving art of packet switching

Rapid developments in computer and information technology continue to expose new requirements for switched data services, e.g. teletext, electronic funds transfer, electronic mail. The features of packet switching make it attractive for many of these new services, and many countries, including the UK, now operate or plan to introduce public packet-switched data networks. But packet switching is a relatively new art, particularly in the realm of public-switched networks, and is itself developing rapidly, driven both by the increasing demand for switched data services and by advances in semiconductor technology. It tends therefore to be the preserve of a relatively small band of specialists. This paper reviews the principles, origins and evolution of packet switching, with particular reference to public-switched networks. The picture emerges of well laid foundations and the prospect of rapid expansion in public packet-switched networks throughout the world. The development of large switches, such as those being developed at BTRL, will play an important part in this.