ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • all-optical networks  (2)
  • Semi-stable Markov processes  (1)
  • 2000-2004  (3)
Collection
Publisher
Years
  • 2000-2004  (3)
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Photonic network communications 2 (2000), S. 163-184 
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Photonic network communications 2 (2000), S. 369-382 
    ISSN: 1572-8188
    Keywords: all-optical networks ; fault management ; distributed algorithm ; dynamic routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract This paper presents a distributed algorithm to determine fault avoiding routes between source-destination end-node pairs in an all-optical network. Fault-tolerant routing for WDM routed all-optical networks has not been studied in details in the literature except for using protection switching or loopback recovery. Such schemes use predetermined protection mechanism and hence assume that the protection path is not faulty. This paper considers extensions to a dynamic routing scheme (presented earlier by these authors for fault-free networks) to handle rerouting in case of fault occurrence. The performance degradations of the network because of fault occurrence are then studied in terms of blocking probability and set-up time through simulations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of theoretical probability 13 (2000), S. 951-976 
    ISSN: 1572-9230
    Keywords: time-space harmonic polynomials ; Lévy processes ; Semi-stable Markov processes ; Hochberg's measure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A time-space harmonic polynomial for a stochastic process M=(M t) is a polynomial P in two variables such that P(t, M t) is a martingale. In this paper, we investigate conditions for the existence of such polynomials of each degree in the second, “space,” argument. We also describe various properties a sequence of time-space harmonic polynomials may possess and the interaction of these properties with distributional properties of the underlying process. Thus, continuous-time conterparts to the results of Goswami and Sengupta,(2) where the analoguous problem in discrete time was considered, are derived. A few additional properties are also considered. The resulting properties of the process include independent increments, stationary independent increments and semi-stability. Finally, a generalization to a “measure” proposed by Hochberg(3) on path space is obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...