Heuristic algorithms for path selection in private ATM networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/icccn/JiangY97
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/icccn/JiangY97
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tao_Yang
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Xuedong_Jiang
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FICCCN.1997.623338
>
foaf:
homepage
<
https://doi.org/10.1109/ICCCN.1997.623338
>
dc:
identifier
DBLP conf/icccn/JiangY97
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FICCCN.1997.623338
(xsd:string)
dcterms:
issued
1997
(xsd:gYear)
rdfs:
label
Heuristic algorithms for path selection in private ATM networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tao_Yang
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Xuedong_Jiang
>
swrc:
pages
372-377
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/icccn/1997
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/icccn/JiangY97/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/icccn/JiangY97
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/icccn/icccn1997.html#JiangY97
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ICCCN.1997.623338
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/icccn
>
dc:
subject
asynchronous transfer mode; heuristic algorithms; path selection; private ATM networks; shortest path problem; multiple constraints; NP-complete problem; minimum hop path; end-to-end delay requirement; maximum load level; call admission control; probability; unconstrained shortest path problem; simulation study; randomly generated networks; call blocking ratio; network routing; link metric; performance
(xsd:string)
dc:
title
Heuristic algorithms for path selection in private ATM networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document