Automatic Repair Method for D2D Communication Routing Buffer Overflow Vulnerability in Cellular Network

Repairing D2D communication routing buffer overflow in a cellular network is of great significance in improving communication quality and security. Due to the increase of user usage, the communication data are easy to exceed the boundary of the buffer, resulting in the reduction of covered data information. The traditional repair methods mainly repair through the characteristics of covered data information, ignoring the impact of network topology information transmission delay and packet loss during calculation, resulting in the problem of low communication security. A cellular network routing buffer overflow repair algorithm based on the homomorphic analysis of node residual energy is proposed; the cellular network D2D communication routing protocol is designed; the cellular network D2D communication protocol path index is determined; then, the cellular network D2D communication routing protocol is designed by analyzing node residual energy; and the cellular network D2D communication network routing optimization method based on AHP is designed. Big constructs the energy model of cellular network D2D communication network, solves and sets the routing optimization objective function, realizes the control of network routing, and repairs the buffer overflow. The experiment results show that the improved method can effectively reduce the packet loss rate of communication data, improve the anti-interference ability of the system, and ensure the security of network communication.

On the Time to Buffer Overflow in a Queueing Model with a General Independent Input Stream and Power-Saving Mechanism Based on Working Vacations

A single server GI/M/1 queue with a limited buffer and an energy-saving mechanism based on a single working vacation policy is analyzed. The general independent input stream and exponential service times are considered. When the queue is empty after a service completion epoch, the server lowers the service speed for a random amount of time following an exponential distribution. Packets that arrive while the buffer is saturated are rejected. The analysis is focused on the duration of the time period with no packet losses. A system of equations for the transient time to the first buffer overflow cumulative distribution functions conditioned by the initial state and working mode of the service unit is stated using the idea of an embedded Markov chain and the continuous version of the law of total probability. The explicit representation for the Laplace transform of considered characteristics is found using a linear algebra-based approach. The results are illustrated using numerical examples, and the impact of the key parameters of the model is investigated.

Noise-Immune Labels of Residual Codes for Improving Solution Efficiency to Packet Overflow in an Optical Label-Switched Buffer

In this paper, an optical buffering solution based on label switching is proposed, where packets are buffered by identifying and renewing the light labels of pseudo-orthogonal codes. The buffer overflow occurs when label switching fails to perform on the queued packets due to the insufficient labels. Assigning an increased code number to the buffer could reduce the overflow effect, but the decoder noise mitigates its efficiency. Therefore, we study a noise-immune labeling method of residual function by advancing the correlation properties of the existing codes. The proposed label-switching scheme improves the solution efficiency to buffer overflow as a lower code-error probability can be reached. Moreover, multiple label codes can be simultaneously generated from a shared light source to achieve a power-efficient buffer structure.

Buffer Overflow

Buffer overflow is the most common type or form of cyber security vulnerability in the last ten years. Buffer over flow is the vulnerability of remote network penetration area vulnerabilities, where a hacker, Attacker or anonymous user can have the gain or control of a host. Buffer over flow vulnerability can be effectively be eliminated, the big part of the serious security threats would be removed. In this paper, we learn, what is buffer over flow vulnerability, what are the methodology, what are the steps to exploit the buffer over flow vulnerability.

Real-time Attack-Scheme Visualization for Complex Exploit Technique Comprehension

Recent exploit techniques are highly complex, and it is not easy for cybersecurity learners to understand the attack strategies quickly and clearly. For efficient and comprehensive learning, this paper proposes an attack-scheme visualization system that fulfills three requirements: attack progress visualization in real-time, memory and register-level description, and concise description of the attack schemes. This paper exemplifies two cases: stack buffer overflow and ROP attacks, and demonstrates how the system operates and how users can learn that existing defense technologies are effective or ineffective depending on the execution environments.