Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.05958

Migration from Copper to Fiber Access Network using Passive Optical Network for Green and Dry Field Areas of Pakistan

Umar Farooq·Sajid Bashir·Tauseef Tasneem·A. Saboor·A. Rauf
View original source ↗Read source document ↗Export metadata ↓

Abstract

Passive Optical Networks (PON) technology brings an evolution in the industry of Telecommunication for the provisioning of High Speed Internet (HSI) and Triple Play bundled Services that includes Voice, Data, and Video Streaming throughout the world. In Pakistan most of the service providers are offering broadband services on traditional copper OSP (Outside Plant) network since 2000. Demand for the high speed internet and broadband is increasing rapidly, it is desired with great need to migrate from traditional copper based OSP network to PON _ FTTx (Fiber To The x) infrastructure. Considering the geographical requirements in Pakistan a scalable fiber network is required which can be optimized as per the users requirements and demands with high speed bandwidth efficiency, involving the minimum losses and with ideal capital expenditure (CAPEX). In this work a platform for migration from copper to fiber access network with a scalable and optimized PON _ FTTx infrastructure in green field and dry field areas of Pakistan have been proposed using Geographic Information system (GIS). In any developing country like Pakistan having the same cultural and geographical topology, this platform can be used to migrate from copper to fiber access network to provide the PON based telecom services. The developed platform for migration from copper to PON based fiber has been studied, planned, and then simulated on a selected geographical area of Pakistan with physical execution that showed better and efficient results with reduction in capital and operational expenditures. A factual plan without ambiguities assists the operators of Pakistan to analyze and forecast bandwidth requirements of an area, optimized network planning along with the in time and efficient deployment.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Umar Farooq, Sajid Bashir, Tauseef Tasneem, A. Saboor, A. Rauf. 2015-09-20. Migration from Copper to Fiber Access Network using Passive Optical Network for Green and Dry Field Areas of Pakistan. https://arxiv.org/abs/1509.05958

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

KEEP EXPLORING

Related papers

arXiv2026

Formal Abstractions for Packet Scheduling

Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaraman et al., offer a flexible and efficient primitive for programmable packet scheduling. Prior work has shown that PIFO trees can express a wide range of practical algorithms including strict priority, weighted fair queueing, and hierarchical schemes. However, the semantic properties of PIFO trees are not well understood. This paper studies PIFO trees from a programming language perspective. We formalize the syntax and semantics of PIFO trees in an operational model that decouples the scheduling policy running on a tree from the topology of the tree. Building on this formalization, we develop compilation algorithms that allow the behavior of a PIFO tree written against one topology to be realized using a tree with a different topology. Such a compiler could be used to optimize an implementation of PIFO trees, or realize a logical PIFO tree on a target with a fixed topology baked into the hardware. To support experimentation, we develop a software simulator for PIFO trees, and we present case studies illustrating its behavior on standard and custom algorithms.

cs.NI↗
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↗