2005
DOI: 10.1109/jlt.2005.856254
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic optical-network architectures and technologies for existing and emerging grid services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
53
0

Year Published

2007
2007
2012
2012

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 95 publications
(53 citation statements)
references
References 20 publications
0
53
0
Order By: Relevance
“…There are two types of models proposed for scheduling network and grid resources in wavelength switched grids [9]. The first is the overlay model, where applications request resource scheduling from the grid middleware.…”
Section: The Need For a Low Latency Grid Architecturementioning
confidence: 99%
See 1 more Smart Citation
“…There are two types of models proposed for scheduling network and grid resources in wavelength switched grids [9]. The first is the overlay model, where applications request resource scheduling from the grid middleware.…”
Section: The Need For a Low Latency Grid Architecturementioning
confidence: 99%
“…The grid burst loss probability π l (∆ j ) can be computed by performing fixed-point iterations using (6)- (9). However, to simplify this analysis we assume that the low priority link loss probability, π B l , is independent of ∆ j , and we call it q B l .…”
Section: Analysis Of Optimum Offset Timementioning
confidence: 99%
“…3, and the input parameters are summarized in Table 1. The first used a fairly densely meshed European backbone network (the "Large Topology" taken from [22]), with artificially generated job arrival rates at each site (each rate λ i was with 30% chance uniformly chosen in [1,15] and 70% from [30,60]). …”
Section: Scenariomentioning
confidence: 99%
“…This bound was obtained by assuming that jobs only may be executed at the closest server site (see the simplifying assumption used in the server site selection approach of Section 3.1). Given this assumption, the maximal local processing rate at server site k equals 1-L k , with L k = L calculated using ErlangB formula (1) for N = n k the number of servers at site k, and λ = λ k the aggregate arrival rate of its closest Grid sites.…”
Section: Local Processing Ratesmentioning
confidence: 99%
“…Hence, service differentiation must be provided for such applications in order to reduce the loss rate while maintaining the lowest possible end-to-end delay. Accordingly, the high burst loss probability evident in OBS networks has become a critical issue that must be addressed in order to enable real deployment of OBS networks [5][6][7]. Most existing research in this area can be categorized into one of the mechanism shown in Fig.…”
Section: Introductionmentioning
confidence: 99%