Modelling and Analysis of Routing and Resource Allocation Techniques in Multi-service Networks

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: WFRF:(Barta P) > Modelling and Analy...

G, Fodor (författare)

Modelling and Analysis of Routing and Resource Allocation Techniques in Multi-service Networks

Artikel/kapitelEngelska1999

Förlag, utgivningsår, omfång ...

WILEY,1999
printrdacarrier

Nummerbeteckningar

LIBRIS-ID:oai:DiVA.org:kth-203001
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-203001URI

Kompletterande språkuppgifter

Språk:engelska
Sammanfattning på:engelska

Ingår i deldatabas

SwePubSwePub

Klassifikation

Ämneskategori:ref swepub-contenttype
Ämneskategori:art swepub-publicationtype

Anmärkningar

UT: 000080017900002; ScopusID: 0032658879. QCR 20170321
In this paper a novel call level model based on the extension of the classical Erlang multi-rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi-service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IF-based integrated networks. In ATM, the CBR and VER service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IF, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in rime following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Copyright (C) 1999 John Wiley & Sons, Ltd.

Biuppslag (personer, institutioner, konferenser, titlar ...)

P, Barta (författare)
A, Marquetant (författare)
A, Racz (författare)
T, Henk (författare)

Sammanhörande titlar

Ingår i:International Journal of Communication Systems: WILEY12:2, s. 103-1231074-53511099-1131

Internetlänk

https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-203001

Hitta via bibliotek

International Journal of Communication Systems (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: G, Fodor; P, Barta; A, Marquetant; A, Racz; T, Henk

Artiklar i publikationen: International Jo ...

Av lärosätet: Kungliga Tekniska Högskolan

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se