KEYWORDS: Satellites, Data transmission, Reflection, Satellite communications, Aerospace engineering, Mathematical optimization, Design and modelling, Data modeling, Receivers, Process modeling
In recent years, with the advancement of aerospace integration and the development of space missions, micro-nano satellites have become a hot research direction in aerospace field. Limited by the performance limitations of single micro-nano satellites, the networking of micro-nano satellite constellation is becoming the main trend. Optimized Link State Routing (OLSR) protocol is widely adopted as the micro-nano satellite networks routing protocol. For the micro- nano satellite constellation networks, frequent changes of the network topology caused by the rapid movement of satellite nodes pose a high challenge to the invulnerability of routing protocols. However, traditional OLSR routing protocol lacks awareness of the satellite node running trajectory and running status, resulting in untimely updates of network topology changes, the invulnerability cannot be guaranteed. To this end, in view of the predictability of the micro-nano satellite constellation orbit, we propose an improved OLSR protocol based on link survival time optimization. By adding the interaction of position and other information in OLSR protocol, link survival time is predicted based on satellite orbit. Extensive simulation experiments show that improved OLSR protocol based on link lifetime optimization has significantly improvement in transmission success rate and invulnerability.
We propose a Mixed Sharing Auxiliary Graph (MSAG) for dynamic traffic grooming in heterogeneous WDM mesh
networks. Based on MSAG model, a novel heuristic named BLSW-ILMS (Backup LSP Shared Working Lightpath with
Inter-layer Mixed Sharing) is proposed. Simulation results show that the proposed algorithm can efficiently decrease the
blocking probability.
In this paper, we focus on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups)
constraints in WDM mesh networks. Our objective is to minimize the total network resource for a given traffic
demands metric. An efficient simplified ILP (Integer Linear Programming) mathematical formulation is presented.
Considering the computational complexity of ILP, a fast heuristic algorithm named Cross Layer Information
Routing & Multi-Layer Traffic Grooming (CLIR-MLTG) is proposed and evaluated. We compare our simplified
ILP model with the regular ILP model, and the CLIR-MLTG algorithm is also compared both with our simplified
model and a heuristic algorithm named SSR in the literature [1]. Finally, we demonstrate in numerical results that our
simplified ILP model obtains optimal performance and costs much less time compared to the regular ILP model, and
the CLIR-MLTG algorithm outperforms the SSR scheme and it obtains similar performance compared to the ILP
model.
In this paper, the problem of how to provide survivability to multi-domain optical mesh networks is studied.
Differing from the survivable research on single-domain networks, the whole network topology is unknown for all
the source nodes. According to this point, we propose a novel protection algorithm called Enhanced Local Segment-
Shared Protection (ELSSP) based on the simplified virtual topology for dynamic connections in multi-domain
optical mesh networks. For the dynamic connections, ELSSP assigns rational link-cost for the virtual link on the
virtual topology when calculating the primary path, and provides segment-shared protection in the passing domains
of the primary path. Simulation results show the good network performance of ELSSP.
In this paper, we propose a novel multi-modular optimal capacity algorithm for SDH (Synchronous Digital Hierarchy) mesh networks. Our objective is to minimize total capital cost of the SDH mesh networks with modularity. First, the optimization problem is formulated as an integer linear programming (ILP) model. Then considering the time complexity of ILP formulation for large-scale networks, a fast heuristic algorithm named Multi-Modular Optimal Capacity (MMOC) is proposed. Several network models, which serve as test cases, are provided and the numerical results show our heuristic algorithm has low time complexity and good performance (in terms of network cost) near to the ILP results.
In this paper, we propose a novel segment-shared protection algorithm (SSPA) for multi-domain optical mesh
networks. In SSPA, intra-domain links and inter-domain links are protected with segment-backup paths respectively.
The segment-working path is protected with path shared protection in single-domain and the inter-domain link is
protected with shared segment-backup path that it could traverse several domains. The major advantage of SSPA is
its shorter recovery time than previous path protection in multi-domain optical mesh networks. The SSPA resolves
the inter-domain link protection problem successfully. The computer simulation results show that resources
utilization ratio of our proposed SSPA is near to the optimization algorithm that requires the global knowledge of
network topology.
Pre-configuration Cycle (p-cycle) is a promising approach for protecting working capacities in wavelength-division-multiplexing (WDM) mesh networks because of its ability to achieve ring-like recovery speed while maintaining the capacity efficiency of a mesh-restorable network. The p-cycle design in WDM mesh networks is to determine a set of p-cycles requiring near-minimal spare capacity to fully protect a capacitated network with individually different working capacity quantities on each span. The spare capacity allocation for the p-cycles is to decide where to place spare capacity in the network and how much spare capacity must be reserved on the p-cycles to guarantee seamless communications services survivable to a set of failure scenarios. The p-cycles are formed in the spare capacity of the network, so a spare capacity allocation of the p-cycles can be done without affecting the working traffic. This paper investigates the spare capacity allocation problem for p-cycles in WDM mesh networks. We propose a heuristic method, called the Joint p-Cycle capacity allocation (JCCA), for p-cycles spare capacity allocation in WDM mesh networks. This method can allocate optimal spare capacity for p-cycles and ensure 100% restorability without using Integer Linear Programming (ILP). JCCA configures the p-cycles with considering the distribution of the capacity distribution of the networks and first assigns p-cycles with good actual efficiency. The performance of JCCA is evaluated by computer simulations on the real world network topology. And the comparisons of this method and traditional design algorithms are presented in the paper.
The paper considers the problem of establishing robust routes for multi-granularity connection requests in traffic-grooming WDM mesh networks and proposes a novel Valiant Load-Balanced robust routing scheme for the hose uncertain model. Our objective is to minimize the total network cost when assuring robust routing for all possible multi-granularity connection requests under the hose model. Since the optimization problem is recently shown to be NP-hard, two heuristic algorithms are proposed and compared. When implementing Valiant Load-Balanced robust routing scheme to WDM mesh networks, a novel traffic-grooming algorithm called MHF (minimal hop first) is proposed. We evaluate MHF by Valiant Load-Balanced robust routing with the traditional traffic-grooming algorithm by computer simulation.
In this paper, we propose Valiant Load-Balanced robust routing scheme for WDM mesh networks under the model of polyhedral uncertainty (i.e., hose model), and the proposed routing scheme is implemented with traffic grooming approach. Our Objective is to maximize the hose model throughput. A mathematic formulation of Valiant Load-Balanced robust routing is presented and three fast heuristic algorithms are also proposed. When implementing Valiant Load-Balanced robust routing scheme to WDM mesh networks, a novel traffic-grooming algorithm called MHF (minimizing hop first) is proposed. We compare the three heuristic algorithms with the VPN tree under the hose model. Finally we demonstrate in the simulation results that MHF with Valiant Load-Balanced robust routing scheme outperforms the traditional traffic-grooming algorithm in terms of the throughput for the uniform/non-uniform traffic matrix under the hose model.
In wavelength-division-multiplexing (WDM) mesh networks, previous routing algorithms are commonly used under the specific future traffic demand; however, it is difficult to predict the future traffic demand accurately in a practical sense. We propose a novel robust routing scheme based on Valiant load balancing in WDM mesh networks for the model of polyhedral uncertainty (i.e., hose model) and apply the scheme to low-speed connections with a traffic grooming approach. Our objective is to minimize total network cost. A mathematic formulation of the Valiant load-balancing robust routing scheme is presented and two fast heuristics are also proposed. When implementing the robust routing scheme to WDM mesh networks, a new traffic grooming algorithm called MHF (minimizing hop first) is proposed. We evaluate the MHF with the Valiant load-balancing robust routing scheme compared with traditional traffic-grooming algorithms.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.