Constraint-based routing in traffic engineering
dc.contributor.author | Karaman, Ayşe | en_US |
dc.date.accessioned | 2015-07-14T23:48:13Z | |
dc.date.available | 2015-07-14T23:48:13Z | |
dc.date.issued | 2006 | |
dc.department | Işık Üniversitesi, Fen Edebiyat Fakültesi, Enformasyon Teknolojileri Bölümü | en_US |
dc.department | Işık University, Faculty of Arts and Sciences, Department of Information Technologies | en_US |
dc.description.abstract | Traffic engineering (TE) describes a domain-wide perspective for traffic control as opposed to application-specific concerns of QoS. MPLS is today's most powerful architecture for TE. Constraint-based routing refers to the process of path assignment to flows to fulfill the TE objective which has been defined in a number of multi-constraint ways, and is the most significant component of TE. In this paper, we review constraint-based routing algorithms. We first provide an overview of MPLS/TE and place constraint-based routing within this approach. We then look into the potential path attributes and the underlying platform to characterize these algorithms before we present our review. Our study provides a comprehensive reference to the operational structure and specifications of constraint-based routing algorithms. | en_US |
dc.description.sponsorship | Bogazici University | en_US |
dc.description.sponsorship | IEEE | en_US |
dc.description.sponsorship | TUBITAK | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Karaman, A. & Karaman, A. (2006). Constraint-based routing in traffic engineering. Paper presented at the Proceedings of ISCN'06: 7th International Symosium on Computer Networks, 2006, 1-6. doi:10.1109/ISCN.2006.1662507 | en_US |
dc.identifier.doi | 10.1109/ISCN.2006.1662507 | |
dc.identifier.endpage | 54 | |
dc.identifier.isbn | 1424404916 | |
dc.identifier.isbn | 9781424404919 | |
dc.identifier.scopus | 2-s2.0-34247496882 | |
dc.identifier.scopusquality | N/A | |
dc.identifier.startpage | 49 | |
dc.identifier.uri | https://hdl.handle.net/11729/655 | |
dc.identifier.uri | http://dx.doi.org/10.1109/ISCN.2006.1662507 | |
dc.identifier.volume | 2006 | |
dc.identifier.wos | WOS:000239594100012 | |
dc.identifier.wosquality | N/A | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Conference Proceedings Citation Index – Science (CPCI-S) | en_US |
dc.institutionauthor | Karaman, Ayşe | en_US |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartof | Proceedings of ISCN'06: 7th International Symosium on Computer Networks | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Constraint-based routing | en_US |
dc.subject | MPLS | en_US |
dc.subject | Traffic engineering | en_US |
dc.subject | Communication system traffic control | en_US |
dc.subject | Life estimation | en_US |
dc.subject | Load management | en_US |
dc.subject | Multiprotocol label switching | en_US |
dc.subject | Packet switching | en_US |
dc.subject | Power engineering and energy | en_US |
dc.subject | Routing | en_US |
dc.subject | Telecommunication traffic | en_US |
dc.subject | Tellurium | en_US |
dc.subject | Traffic control | en_US |
dc.subject | QoS | en_US |
dc.subject | Constraint-based routing algorithms | en_US |
dc.subject | Operational structure | en_US |
dc.subject | Path assignment | en_US |
dc.subject | Quality of service | en_US |
dc.subject | Telecommunication congestion control | en_US |
dc.subject | Telecommunication network routing | en_US |
dc.title | Constraint-based routing in traffic engineering | en_US |
dc.type | Conference Object | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 655.pdf
- Boyut:
- 756.17 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version