2002
DOI: 10.1109/twc.2002.804176
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive routing for packet-oriented intersatellite link networks: performance in various traffic scenarios

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 63 publications
(40 citation statements)
references
References 10 publications
0
39
0
Order By: Relevance
“…The source and destination end-terminals are dispersed all over the world and the distribution of end-terminals is shown in Table 3. The traffic distribution is identical to [14]. The sources send data at constant rates from 0.8 Mbps to 1.5 Mbps.…”
Section: Simulation Setupmentioning
confidence: 99%
“…The source and destination end-terminals are dispersed all over the world and the distribution of end-terminals is shown in Table 3. The traffic distribution is identical to [14]. The sources send data at constant rates from 0.8 Mbps to 1.5 Mbps.…”
Section: Simulation Setupmentioning
confidence: 99%
“…A simple representative of a geographically dependent source/ destination distribution assumes homogeneous distribution over the landmasses, considering continents and major islands (called landmass distribution), while traffic intensity above the oceans equals 0 (Mohorcic et al, 2002b). More realistic source/destination distributions should reflect the geographic distribution of traffic intensity, which is related to several techno-economic factors including the population density and distribution, the existing telecommunication infrastructure, industrial development, service penetration and acceptance level, gross domestic product (GDP) in a given region, and pricing of services and terminals (Werner & Maral, 1997, Hu & Sheriff, 1997, Werner & Lutz 1998.…”
Section: Module For Global Distribution Of Traffic Sources and Destinmentioning
confidence: 99%
“…The centralized routing schemes that we tested were proposed in [4], [5] and are based on the Dijkstra shortest path algorithm. The link-cost function used for these protocols is based on a mixture of propagation and queueing delay:…”
Section: A Link Cost Metricsmentioning
confidence: 99%
“…The two other schemes take account of queuing delay. In [4], [5] different combinations of W F P D and W F QD were studied. For the sake of fairness we set W F P D = 1 and W F QD = 1 because this combination yields the best performance.…”
Section: A Link Cost Metricsmentioning
confidence: 99%
See 1 more Smart Citation