Scalability and performance are major challenges in developing high-performance multicast packet switching technologies in the 5G/6G core networks. We propose a novel scheme called Two-Dimensional ...Scalar-matrix and Vectors Routing and Forwarding (2D-SVRF) to address these two issues. Our scheme improves upon commonly used algorithms, Bloom filter (BF) and Scalar-pair Vectors Routing and Forwarding (SVRF), which have limitations in space and time efficiency, especially in carrier-grade Packet Forwarding Engines (PFEs) with high port-density and large membership-capacity. 2D-SVRF transforms a scalar-vector into a scalar-matrix by dividing an n-element group into N-rows (sub-blocks) and dividing an output-port bitmap with ρ-elements into M-columns within each sub-block. This enables the reuse of smaller and identical prime keys among different sub-blocks and sub-scalars. By leveraging this approach, multicast forwarding can be partitioned to exploit parallelism, resulting in reduced memory usage and lower computational complexity. Simulation evaluation confirms that 2D-SVRF outperforms competing algorithms in terms of scalability and efficiency, particularly when optimized with the (M, N) parameters. The 2D-SVRF approach is expected to make the implementation of SVRF feasible in carrier-grade multicast-enabled switches and routers.
The current Wireless Sensor Network (WSN) lacks the desired power owning to the non-availability of the power source. The challenge posed in the current scenario is conserving power for effective ...data transfer, which is seldom achieved. Added to the owes is the evolving technological innovations where the physical size of the Packet Forwarding Nodes (PFNs) is also reduced along with its power source, thereby reducing the power available to the system and making it inefficient. The existing methodology employed in monitoring the parameters used in Epidemic Algorithm (EA) and Incentive Compatible Routing Protocol (ICRP) protocols which are power guzzlers, the power available for data transfer is greatly reduced making the entire system inefficient. This paper attempts to mitigate the challenges posed by the EA & ICRP, the proposed protocol, “Incentive Routing Protocol with Virtual Projection (IRPVP)”, employs a Relay Sensing Node (RSN) which is designed to be distributed in a square cross-sectional area where each node acts as a unique Sensing Point (SP) monitoring each of the essential parameters like energy consumption, vibrant & non-vibrant SPN count, residual energy and routing overhead while still retaining power for data transfer since the RSN is connected to a dedicated power source. In IRPVP protocol, each packet of a node is subdivided into fragments that are designed to have fixed or variable lengths depending upon the application. Each of these packets is sent over multiple Packet Forwarding Nodes (PFNs) towards the data center. The selection of PFNs in the path is based on their trust levels like meeting probability, computation of residual energy, data weight, and security value. Special PFNs are placed in the network and are entrusted to deliver the packets to the data center without data loss during transmission. The result of the IRPVP protocol Vis-à-Vis the EA & ICRP protocol, backed by the simulation results proves that the IRPVP protocol is better in data handling and is more efficient.
The existing packet forwarding technology cannot meet the increasing requirements of Internet development due to its rigid framework. Application of artificial intelligence (AI) for efficient packet ...forwarding is gaining more and more interest as a new direction. Recently, the explosive development of programmable data plane (PDP) has provided a potential impetus to packet forwarding driven by AI. Therefore, this paper presents a survey on the recent research in AI-driven packet forwarding with PDP. First, we describe two of the most representative frameworks of the packet forwarding, i.e., the traditional AI-driven forwarding framework and the new one assisted by the PDP. Then, we focus on capacity of the packet forwarding under the two frameworks in four measures: delay, throughput, security, and reliability. For each measure, we organize the content with the evolution from simple packet forwarding, to packet forwarding capacity enhancement with the assistance of AI, to the latest research on AI-driven packet forwarding supported by the PDP. Finally, we identify three directions in the development of AI-driven packet forwarding, and highlight the challenges and issues in future research.
In wireless packet-forwarding networks with selfish nodes, application of a repeated game can induce the nodes to forward each others' packets, so that the network performance can be improved. ...However, the nodes on the boundary of such networks cannot benefit from this strategy, as the other nodes do not depend on them. This problem is sometimes known as the curse of the boundary nodes. To overcome this problem, an approach based on coalition games is proposed, in which the boundary nodes can use cooperative transmission to help the backbone nodes in the middle of the network. In return, the backbone nodes are willing to forward the boundary nodes' packets. Here, the concept of core is used to study the stability of the coalitions in such games. Then three types of fairness are investigated, namely, min-max fairness using nucleolus, average fairness using the Shapley function, and a newly proposed market fairness. Based on the specific problem addressed in this paper, market fairness is a new fairness concept involving fairness between multiple backbone nodes and multiple boundary nodes. Finally, a protocol is designed using both repeated games and coalition games. Simulation results show how boundary nodes and backbone nodes form coalitions according to different fairness criteria. The proposed protocol can improve the network connectivity by about 50%, compared with pure repeated game schemes.
The sensor nodes deployed in underwater environment has different routing mechanism in contrast to the terrestrial network. Getting underwater data on pollution detection, control of the ecosystem, ...marine mining, catastrophe avoidance and strategic surveillance thereby demands smooth packet transmission which can only be possible through a stable and astute communication link between sensor nodes. Therefore, selecting best link between source and destination node is a key challenge. The meticulous research has been conducted to search out the best link selection mechanism of bodacious underwater routing protocol EnOR, SURS‐PES and USPF; and recommended the protocol that offers a shrewd communication link. The performance has been evaluated through NS2 simulation for packet delivery ratio, end-to-end delay, network lifespan and network energy consumption.
Underwater Wireless Sensor Networks (UWSNs) are subjected to a multitude of real-life challenges. Maintaining adequate power consumption is one of the critical ones, for obvious reasons. This ...includes proper energy consumption due to nodes close to and far from the sink node (gateway), which affect the overall energy efficiency of the system. These wireless sensors gather and route the data to the onshore base station through the gateway at the sea surface. However, finding an optimum and efficient path from the source node to the gateway is a challenging task. The common reasons for the loss of energy in existing routing protocols for underwater are (1) a node shut down due to battery drainage, (2) packet loss or packet collision which causes re-transmission and hence affects the performance of the system, and (3) inappropriate selection of sensor node for forwarding data. To address these issues, an energy efficient packet forwarding scheme using fuzzy logic is proposed in this work. The proposed protocol uses three metrics: number of hops to reach the gateway node, number of neighbors (in the transmission range of a node) and the distance (or its equivalent received signal strength indicator, RSSI) in a 3D UWSN architecture. In addition, the performance of the system is also tested with adaptive and non-adaptive transmission ranges and scalable number of nodes to see the impact on energy consumption and number of hops. Simulation results show that the proposed protocol performs better than other existing techniques or in terms of parameters used in this scheme.
Network Functions Virtualization (NFV) replaces the specialized hardware with the software-based forwarding to promise the flexibility, scalability and automation benefits. With an increasing range ...of applications, NFV must ultimately forward packets at rates that are comparable to the native and specialized hardware-based approaches. However, the transition packet forwarding from specialized hardware to software-based has turned out to be more challenging than expected. Thus, NFV acceleration is desperately needed to play a crucial role in the development of NFV. It is an interesting issue how to address the persistent performance tuning in a way that provides far greater flexibility to meet the demands of power. The existing developments are very inefficient, since that the uncontrollable and unanticipated performance regressions frequently occur. Besides, the environments for full system simulations are traditionally expensive and time consuming to evaluate the system performance. In this paper, we propose the methodology named as "NFV Acceleration via Lean Measurements (NALM)" to tune the performance for the NFV acceleration. NALM provides a holistic measurement approach through combining individual measures to quickly identify the bottlenecks, which can help developers with a better understanding of the design tradeoffs. Moreover, the environments for large scale performance simulation are replaced by a debugger. Thus, the waste is eliminated in terms of time consumption and infrastructure costs of the full system simulation. The systematic analysis of the multi-cores speedup ratio highlights the potential optimization space and rules. We further propose the improvement recommendations on efficient practices. The experiments evaluate the specific effects, and the relationship between the metrics and forwarding performance.
In intermittent connectivity wireless networks, packets are always transmitted to their destinations through the cooperation of intermediate nodes, and the limited network resources can be ...effectively utilized through network coding approaches. However, a large amount of resources will be consumed while all the nodes act as coding nodes simultaneously; meanwhile, redundant coded packets are injected into the network. Therefore, to determine the number of coding nodes and restrain the diffusion of coded packets, a new dynamic coding control mechanism is proposed. In this mechanism, coding nodes are scheduled in a distributed manner based on the network community scale. Moreover, the coding opportunities and forwarding priorities of packets are determined according to the packet redundancy. Simulation results show that the connection opportunities can be exploited, and the utilization of network resources can be optimized.
The MANET packet routing method of geographic greedy forwarding involves the selection of distance reducing intermediate relays towards a destination. The efficacy of the greedy methods differs and ...varies; nevertheless, the algorithms are similar and process the same data at a forwarding node. Their commonalities potentially allow the online assignment of different methods for more efficient progress forwarding in heterogeneous MANET environments. We define a multimethod multi-greedypacket forwarding approach in this paper. Using the IPFIX packet flow measures, we demonstrate the multi-greedy scheme for the performance of repetitive packet routing tasks that permit exploration-exploitation application. The flows report reveal the optimal efficiency of each base greedy method in each flow which aggregates to the multi-greedy design. In comparison to the base methods, the case multi-greedy methods show considerable performance improvement in PDR, hop-count, and delay measures.
PDF
