Dynamic capacity adjustment for virtual-path based networks using neuro-dynamic programming

Simple item page
buir.advisorAkar, Nail
dc.contributor.authorŞahin, Cem
dc.date.accessioned2016-07-01T10:58:55Z
dc.date.available2016-07-01T10:58:55Z
dc.date.issued2003
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractDynamic capacity adjustment is the process of updating the capacity reservation of a virtual path via signalling in the network. There are two important issues to be considered: bandwidth (resource) utilization and signaling traffic. Changing the capacity too frequently will lead to efficient usage of resources but has a disadvantage of increasing signaling traffic among the network elements. On the other hand, if the capacity is adjusted for the highest possible value and kept fixed for a long time period, a significant amount of bandwidth will be wasted when the actual traffic rate is small. We proposed two formulations for dynamic capacity adjustment problem. In the first formulation cost parameters are assigned for bandwidth usage and signalling, optimal solutions are reached for different values of these parameters. In the second formulation, our aim is to maximize the bandwidth efficiency with a given signaling requirement. In this formulation, a leaky bucket counter is used in order to regulate the signaling rate. We used dynamic programming and neuro-dynamic programming techniques and we applied our formulations for voice traffic scenario (voice over packet networks) and a general network architecture using flow-based Internet traffic modelling. In the Internet traffic modelling case, we tested two different control strategies: event-driven control and time-driven control. In event-driven control, capacity update epochs are selected to be the time instants of either a flow arrival or a flow departure. In time-driven control, decision epochs are selected to be the equidistant time instants and excessive amount of traffic that cannot be carried will be buffered.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityŞahin, Cemen_US
dc.format.extentxiv, 65 leaves, tables, graphics, 30 cmen_US
dc.identifier.itemidBILKUTUPB071980
dc.identifier.urihttp://hdl.handle.net/11693/29388
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDynamic capacity adjustmenten_US
dc.subjectflow-based internet traffic modellingen_US
dc.subjectleaky bucket counteren_US
dc.subjectneuro-dynamic programmingen_US
dc.subjectdynamic programmingen_US
dc.subjectvirtual pathen_US
dc.subjectvoice over packet networksen_US
dc.subject.lccT57.83 .S34 2003en_US
dc.subject.lcshDynamic programming.en_US
dc.titleDynamic capacity adjustment for virtual-path based networks using neuro-dynamic programmingen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0002395.pdf
Size:
711.84 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Dept. of Electrical and Electronics Engineering - Master's degree