Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1911.11468

Dynamic MTU : Technique to reduce packet drops in IPv6 network resulted due to smaller path mtu size

Ishfaq Hussain·Janibul Bashir
View original source ↗Read source document ↗Export metadata ↓

Abstract

With an increase in the number of internet users and the need to secure internet traffic, the unreliable IPv4 protocol has been replaced by a more secure protocol, called IPv6 for Internet system. The IPv6 protocol does not allow intermediate routers to fragment the on-going IPv6 packet. Moreover, due to IP tunneling, some extra headers are added to the IPv6 packet, exceeding the packet size higher than the maximum transmission unit (MTU), resulting in increase in packet drops. One probable solution is to find the MTU of every link in advance using the Internet Control Message Protocol (ICMP) packets and accordingly fragment the packets at the source itself. However, most of the intermediate routers and the network firewalls do not allow ICMP packets to traverse through their network, resulting in network black holes, where we cannot know the MTU of some links in advance. This method tries to handle the packet drops in IPv6 network by proposing a DMTU scheme where we dynamically adjust the MTU of each link depending upon the original size of the IPv6 packet, thereby reducing the number of packet drops by a significant amount. Using mathematical and graphical analysis, our scheme proves to be much more efficient than the state-of-the-art PMTUD scheme. In this paper the method, mathematical and graphical representations are focusing solely in IPv6 Internet communication.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ishfaq Hussain, Janibul Bashir. 2020-11-16. Dynamic MTU : Technique to reduce packet drops in IPv6 network resulted due to smaller path mtu size. https://doi.org/10.1016/j.jksuci.2021.06.011

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI↗
arXiv2026

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI↗
arXiv2026

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI↗