Pages that link to "Item:Q1960517"
From MaRDI portal
The following pages link to On-line routing in all-optical networks (Q1960517):
Displaying 14 items.
- Scheduling light-trails on WDM rings (Q455990) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- On-line maximum matching in complete multi-partite graphs with an application to optical networks (Q896661) (← links)
- Routing on networks of optical crossbars (Q1128720) (← links)
- Provably good algorithms for transmission scheduling in WDM optical networks (Q1306098) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Online packet-routing in grids with bounded buffers (Q2408091) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- A comparative study of cost effective multiplexing approaches for online permutation embedding and scheduling in optical networks (Q5929018) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
- On-line competitive algorithms for call admission in optical networks (Q5946121) (← links)