Congestion aware ant colony optimisation algorithm for routing and spectrum assignment in flexi-grid optical burst switching networks
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Congestion aware ant colony optimisation algorithm for routing and spectrum assignment in flexi-grid optical burst switching networks ; volume:45 ; number:2 ; day:28 ; month:3 ; year:2023 ; pages:67-78 ; date:4.2023
Photonic network communications ; 45, Heft 2 (28.3.2023), 67-78, 4.2023
- Creator
-
Oladipo, Joshua
Plessis, Mathys C. du
Gibbon, Tim
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11107-023-00993-3
- URN
-
urn:nbn:de:101:1-2023090410123508518015
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Oladipo, Joshua
- Plessis, Mathys C. du
- Gibbon, Tim
- SpringerLink (Online service)
Other Objects (12)
Routing-proofness in congestion-prone networks
Greedy routing optimisation in hyperbolic networks
Routing congestion in VLSI circuits : estimation and optimization
Selfish routing of splittable flow with respect to maximum congestion
Solving assignment and routing problems in mixed traffic systems
Solving Assignment and Routing Problems in Mixed Traffic Systems
Routing optimization and capacity assignment in multi-service IP networks
Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion
Combinatorial optimisation problems of the assignment type and a partitioning approach
Hop-by-hop traffic-aware routing to congestion control in wireless sensor networks
HARE: History-Aware Adaptive Routing Algorithm for Endpoint Congestion in Networks-on-Chip
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Routing-proofness in congestion-prone networks
Greedy routing optimisation in hyperbolic networks
Routing congestion in VLSI circuits : estimation and optimization
Selfish routing of splittable flow with respect to maximum congestion
Solving assignment and routing problems in mixed traffic systems
Solving Assignment and Routing Problems in Mixed Traffic Systems
Routing optimization and capacity assignment in multi-service IP networks
Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion
Combinatorial optimisation problems of the assignment type and a partitioning approach
Hop-by-hop traffic-aware routing to congestion control in wireless sensor networks
HARE: History-Aware Adaptive Routing Algorithm for Endpoint Congestion in Networks-on-Chip
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Routing-proofness in congestion-prone networks
Greedy routing optimisation in hyperbolic networks
Routing congestion in VLSI circuits : estimation and optimization
Selfish routing of splittable flow with respect to maximum congestion
Solving assignment and routing problems in mixed traffic systems
Solving Assignment and Routing Problems in Mixed Traffic Systems
Routing optimization and capacity assignment in multi-service IP networks
Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion
Combinatorial optimisation problems of the assignment type and a partitioning approach
Hop-by-hop traffic-aware routing to congestion control in wireless sensor networks
HARE: History-Aware Adaptive Routing Algorithm for Endpoint Congestion in Networks-on-Chip