| 1. |
- Das, Shovan, et al.
(författare)
-
A Link State Advertisement Protocol for Optical Transparency Islands
- 2007
-
Ingår i: 2007 WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING. ; , s. 1-6
-
Konferensbidrag (refereegranskat)abstract
- Plug and play optical (PPO) nodes enable fast, re-configurable, and flexible ad hoc deployment of optical networks. Once plugged, the PPO nodes provide all-optical circuits between client nodes to alleviate the electronic processing bottleneck of high speed networks. To offer these wavelength routing functionalities to client nodes the PPO nodes must self-adjust to possible changes of the optical physical topology and fiber propagation characteristics. To discover such changes the PPO nodes must make use of a link state advertisement (LSA) protocol that is scalable in the number of plugged PPO nodes. This paper describes a scalable LSA protocol with constrained message flooding to match the limited propagation reach of the optical signal, i.e., the PPO node transparency island (TI). Scalability is thus achieved naturally by limiting the link state advertisement scope to only those PPO nodes that need to receive the link updates. As discussed in the paper, the proposed protocol appears to be a viable solution when the TI size is relatively small, e.g., in optical networks without signal regeneration.
|
|
| 2. |
- Das, Shovan, et al.
(författare)
-
Optical Corridor Routing Protocols
- 2007
-
Ingår i: ICTON 2007. ; , s. 188-192
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- The scalability of routing and resource advertisement protocols is a key issue in large optical networks. A commonly used solution is based on the hierarchical approach adopted in IP/MPLS-TE networks, i.e., multiple areas or autonomous systems are pre-established to contain the geographical scope of the resource advertisement protocols and the related routing information. With arbitrarily pre-established areas, routing decision might be sub-optimal. Thus, special care must be paid by the network designer to subdivide effectively the network into areas. This paper presents and discusses an alternative routing technique that attempts to improve both optimality and scalability of routing and resource advertisement protocols without requiring the use of manually pre-established areas.
|
|
