ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Algorithms for Dynamic Routing in All-Optical Networks (2000)
    Springer
    Photonic network communications 2 (2000), S. 163-184 
    Details
    ISSN: 1572-8188
    Keywords: wavelength routed optical network ; dynamic lightpath assignment ; all-optical networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic wavelength allocation. In the first scheme we have assumed the existence of a central agent to maintain a database of existing lightpaths where the central agent attempts to generate a new lightpath in response to a request for communication. In the second scheme, we attempt to generate a new lightpath using a distributed algorithm. In the first scheme we have exploited the existence of multiple paths between any pair of nodes in a network in order to reduce the blocking probability. For the second scheme, we have proposed three distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We have studied the performances of both the schemes using Monte Carlo simulation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010088407041
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    An Optical Layer Lightpath Management Protocol for WDM AONs (2000)
    Springer
    Photonic network communications 2 (2000), S. 185-198 
    Details
    ISSN: 1572-8188
    Keywords: all-optical networks (AONs) ; WDM ; lightpath management ; optical layer protocol ; specification ; communicating finite state machine (CFSM) ; validation and reachability analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this work, we propose a control protocol for lightpath management in the optical layer of all-optical networks (AONs). AONs follow a layered structure, as used by various network standards, where each layer communicates with its peer through Protocol Data Units (PDUs). In the context of Open System Interconnection (OSI) Reference Model (RM), a new layer, called optical layer, has been introduced in the AON architecture to manage the lightpath related functions. The optical layer lies in between the physical layer and the data link layer. The objective of this paper is to define a specification for an optical layer protocol for managing lightpaths in AONs. In order to study the dynamics of the optical layer protocol system, we first employ the communicating finite state machine model to represent the protocol. Then a reachability analysis of the model is performed to verify the protocol. This paper shows how the optical layer protocol can be specified formally and made error-free by the step-wise refinement of an initial specification, where validation is done after each refinement.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010040523879
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...