A cost-efficient scheduling algorithm for traffic grooming (Q5405936)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6279078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cost-efficient scheduling algorithm for traffic grooming |
scientific article; zbMATH DE number 6279078 |
Statements
A Cost-Efficient Scheduling Algorithm for Traffic Grooming (English)
0 references
3 April 2014
0 references
traffic grooming
0 references
fiber lengths minimization problem
0 references
minimizing total fiber length
0 references
longest link interval first (LLF)
0 references
0.8244746923446655
0 references
0.822920024394989
0 references
0.818589985370636
0 references
0.7937706708908081
0 references
0.7869552969932556
0 references
