Relevant bibliographies by topics / Admission control / Dissertations / Theses

Dissertations / Theses on the topic 'Admission control'

To see the other types of publications on this topic, follow the link: Admission control.
Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Admission control.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Sandqvist, Mattias, and Robert Johansson. "Implementation av Network Admission Control." Thesis, Jönköping University, JTH, Computer and Electrical Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-901.

Full text
Abstract:

This examination work is about implementation of Cisco Systems Network Admission Control (NAC) within a leading IT-company in region of Jönköping. NAC is a technique that is used for securing the internal network from the inside. NAC can verify that the client who connects to the network has the latest antivirus updates and latest operative system hotfixes. Clients who don’t meet the criteria can be placed in quarantine VLAN where they only have access to the update servers. There are also functions that handle VLAN assignment for users.

The assignment where to produce a solution for an implementation of NAC in the company’s computer network. The questions that where asked are the following, if and how could NAC be implemented in the company’s computer network.

An analysis where made of the company’s computer network, to see if the computer network meet the requirements for implementing NAC. The result of this analysis showed that there where a loss of functions needed for a working NAC solution. The computer network where rebuild from scratch to meet the new demands for NAC. After completion of the new computer network the NAC solution were taking shape. This was made in consultation with the company to get a clear picture of the needs. The result of the discussion lead to a so called “Out-of-band virtual gateway” solution. The solution builds on that the client is placed in an authentication VLAN when connecting to the computer network, after that an authentication process begins. During this process the client is checked to verify that the criteria’s are fulfilled, if so the client is moved to his access VLAN.

These solutions increase the internal security in the computer network and reduce the risks for virus spreading within the network.

APA, Harvard, Vancouver, ISO, and other styles
2

Jaising, Rahul. "Measurement Based Connection Admission Control." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-09152002-022405/.

Full text
Abstract:
We consider the problem of using the real-time measurements of the network elements for connection admission control on QoS aware networks. Our objective is to study the measurement process and determine the real-time utilization of a link, and use these measurements to determine the admission of new flows into the network, while providing statistical guarantees on the QoS ensured for the existing admitted flows. First we survey the vast amount of existing literature in the field and identify the components of a measurement-based admission control system, and the various factors which affects the performance of an algorithm. We use the ns-2 simulator to simulate some of the proposed (though not all) algorithms and test the performance of these algorithms for various arrival processes at the connection level. We use the results from these simulations to verify the performance claims of the various algorithms, and use the performance tuning parameters to find optimal performance regions. We study the buffer dynamics at the burst level and analyze the loss caused by admitting excessive flows. Our work extends from the existing literature in studying the effect of different arrival processes on the blocking probabilities of new flows and surveying an ad-hoc mix-and-match approach of the estimation technique and decision process to explore a higher performance benchmark.
APA, Harvard, Vancouver, ISO, and other styles
3

Jayaraman, Deepa. "IP multicast admission control for IPTV." Thesis, Wichita State University, 2012. http://hdl.handle.net/10057/5400.

Full text
Abstract:
Video streaming over the Internet has become the most sought after application and is growing at a very fast rate. Internet Protocol Television (IPTV) is a technology that has been growing fast, replacing traditional cable TV. With the rapid development in the high speed networks, multimedia streaming over the internet has increased incredibly, of which video streaming is the major source of traffic in the core network. Hence IPTV video streaming over the core network has become one of the active topics for research. The major challenge associated with IPTV traffic is the fact that video traffic requires more bandwidth and is more sensitive to delay and packet loss due to congestion. Lots of research has been done to provide an Admission Control algorithm for IPTV traffic. Admission Control becomes an essential part as it is typically enforced to ensure QoS in the network. It helps prevent bottleneck in the core network. This thesis proposes an efficient method to provide admission control for IPTV traffic in the core network by using multiple GRIP probe packets to check the resource availability in the core network for the new incoming channel request. Moreover, the algorithm proves that using multiple video qualities in the network helps increase the number of channels delivered to the end user, thus satisfying more users, as opposed to single video quality. Using multiple GRIP packets made the proposed method more reliable and it was seen that on an average, the number of channels delivered to the end user was increase over 90%.
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Science Engineering
APA, Harvard, Vancouver, ISO, and other styles
4

Ho, Chi-Jui. "Call admission control in cellular networks." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/15730.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dimitriou, Nikos. "Call admission control for multimedia CDMA." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/930/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dutkiewicz, Eryk. "Connection admission control in ATM networks /." Title page, abstract and contents only, 1991. http://web4.library.adelaide.edu.au/theses/09SM/09smd976.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jiao, QingZhong. "Admission control and congestion control in ATM/CDMA network." Thesis, Connect to online version, 1995. http://0-wwwlib.umi.com.mercury.concordia.ca/cr/concordia/fullcit?pMQ90887.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kroeger, Robert. "Admission Control for Independently-authored Realtime Applications." Thesis, Waterloo, Ont. : University of Waterloo, 2004. http://etd.uwaterloo.ca/etd/rjkroege2004.pdf.

Full text
Abstract:
Thesis (Ph.D.)--University of Waterloo, 2004.
"A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science". Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
9

Más, Ivars Ignacio. "Probe-based admission control in IP networks." Licentiate thesis, KTH, Microelectronics and Information Technology, IMIT, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1571.

Full text
Abstract:

The current Internet design is based on a best–effortservice, which combines high utilization of network resourceswith simplicity. As a consequence of this design, the Internetis unable to provide guaranteed or predictable quality ofservice (QoS), required to offer real–time services thathave constraints on end–to–end delay, delay jitterand packet loss.

To add QoS capabilities to the present Internet, newfunctions need to be simple to implement, while allowing highnetwork utilization. In recent years, different methods havebeen investigated to provide the required QoS. Most of thesemethods include some form of admission control so that newflows are only admitted to the network if the admission doesnot decrease the quality of connections that are already inprogress below some defined level. To achieve the requiredsimplicity a new family of admission control methods, calledend–to–end measurement–based admission control(EMBAC) moves the admission decision to the edges of thenetwork.

This thesis presents the probe–based admission control(PBAC), which belongs to the family of EMBAC schemes. PBACprovides a reliable upper bound to the packet loss probabilitya flow will suffer in the network. The delay in the network isbounded by using small, packet–scale buffering in therouters. The admission control is done by measuring the lossratio of a stream of probe packets. Probe packets and datapackets of accepted flows are transmitted with low and highpriority respectively, to protect accepted flows from the loadof the probe streams. The probing is done at the peak rate ofthe connection and the flow is accepted if the probe packetloss rate is below a predefined threshold. This procedureensures that the packet loss of accepted flows is always belowthe threshold value.

The thesis offers a description of the probing procedure,with an extensive performance analysis by simulation, as wellas a mathematical model for the admission decision. The authoralso addresses the application of the admission control formulticast communications, and gives a general method to providesecurity features to measurement–based admission controlschemes.

APA, Harvard, Vancouver, ISO, and other styles
10

Cheung, Michael. "Call admission control in wireless communications networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0016/NQ53488.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Azzolin, de Carvalho Pires Gustavo. "Multi-Cell Admission Control for WCDMA Networks." Thesis, KTH, Kommunikationssystem, CoS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92203.

Full text
Abstract:
It has long been recognized that in multi-cell WCDMA networks the admission of a new session into the system can have undesirable impact on the neighboring cells. Although admission control algorithms that take into account such multi-cell impact have been studied in the past, little attention has been paid to multi-cell admission and rate control algorithms when traffic is elastic. In this thesis, we propose a model for multi-cell multi-service WCDMA networks to study the impact of multi-cell admission and rate control algorithms on key performance measures such as the class-wise blocking and outage probabilities, block error rates, and the noise rise violation probabilities. By means of simulation we compare the performance of load based multi-cell algorithms with that of a single cell algorithm. We find that with multi-cell based algorithms the system capacity and performance (in terms of the above mentioned measures) are (in some cases significantly) better in homogeneous load scenarios as well as in the heterogeneous ’hotspot’ and ’hotaround’ scenarios.
Det har länge varit känt att i multi-cellulära WCDMA nät så kan insläppandet av en ny användarei systemet ha en icke önskvärd effekt på intilliggande celler. Fastän insläppskontrollalgoritmer (AC)som tar hänsyn till sådana multi-cellulära effekter har studerats tidigare, så har endast begränsaduppmärksamhet ägnatsåt multi-cellulär insläpps- och bittaktskontrollalgoritmer när trafiken är elastisk.I detta arbete föreslår vi en modell för WCDMA-nät med multipla celler och multipla tjänster ochsom är applicerbar för studier av av hur multi-cellulär insläpps- och bittaktskontroll inverkar påviktiga prestandamått som klassvisa spärr- och utslagningssannolikheter, blockfelssannolikheter, ochsannolikheten för överträdande av tillåten interferensnivå. Med simuleringar jämför vi prestanda förlastbaserade multi-cellalgoritmer med prestanda för singel-cellalgoritmer. Vi har funnit att med multicellalgoritmerså är systemskapacitetet och prestanda (i termer av tidigare nämnda mått) i några fallbetydligt bättre i homogena lastscenarier, samt i heterogena lastscenarier av typerna ’hotspot’ och’hotround’.
APA, Harvard, Vancouver, ISO, and other styles
12

GARNIER, EDUARDO PASTOR. "ADMISSION CONTROL TECHNIQUES IN A DIFFSERV ENVIRONMENT." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5161@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
As disciplinas de Controle de Admissão constituem um recurso importante para a obtenção de Qualidade de Serviço em redes de comunicação. Nesse trabalho, é feito um estudo a respeito da aplicação do Controle de Admissão à Internet. Utilizando- se o software ns-2, é avaliado o desempenho de alguns desses mecanismos em cenários distintos e sob diversas condições de tráfego.
Admission control disciplines are un important resource in the search for Quality of Service on communications networks. In this work, we studt the Admission control applications on the Internet. Using the ns-2 networks simulation software, we evaluate the performance of some of these mechanisms on distinct scenarios, and under several circunstances and traffic conditions.
APA, Harvard, Vancouver, ISO, and other styles
13

Gawlick, Rainer. "Admission control and routing : theory and practice." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36636.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (leaves 183-190).
by Rainer Gawlick.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
14

Ghazzawi, Hashem Ali. "Feedback admission control for workflow management systems." Thesis, University of York, 2015. http://etheses.whiterose.ac.uk/12342/.

Full text
Abstract:
We propose a novel feedback admission control (FAC) algorithm based on control theory as a unified framework to improve the real-time scheduling (RTS) performance in industrial workflow management systems (WMSs). Our FAC algorithm is based on four main principles. First, it does not require the knowledge of RTS parameters of jobs prior to their arrival to the system for scheduling and processing. Second, it does not require a change of the scheduling architecture/policy in the industrial WMS which is a requirement in some industries including the one under consideration in this thesis. Third, we derive dynamic models for computing systems for the purpose of performance control. Finally, we apply established control laws to manage the trade-offs in meeting deadlines and increasing platform utilisation (classical RTS objectives). The generality and efficiency of our proposed FAC algorithm are demonstrated by its application in three typical scheduling scenarios in industry. First, we tested our algorithm with simple tasks that are periodic and independent. For this application, we developed two FAC versions based on basic and advanced control laws to compare their performance with respect to the RTS objectives. Second, we added task dependencies as a scheduling constraint because they are witnessed in some industrial workloads. We evaluated our FAC algorithm against other baseline algorithms like the completion-ratio admission controller with respect to the RTS objectives. Third, we extended our FAC algorithm to support enterprise resource planning decisions in acquiring additional computing processors in real-time to further achieve the RTS objectives while constrained by industrial projects’ financial budgets.
APA, Harvard, Vancouver, ISO, and other styles
15

Naghavi, Nika. "Call admission control in wireless mesh networks." Thesis, King's College London (University of London), 2017. https://kclpure.kcl.ac.uk/portal/en/theses/call-admission-control-in-wireless-mesh-networks(01d122ee-b6fe-4baa-b78c-9f5093136956).html.

Full text
Abstract:
Efficiency in managing scarce wireless resources has been a major design obstacle in wireless mobile networks since its advent. A large body of work has been published on the subject in relation to the first two generation and third generation (3G) of wireless networks. However, these solutions are not readily applicable to the future IP based multi-hop wireless networks. Increased trend in the number of users accessing multimedia rich traffic, and the impacts of mobility management support mechanisms alongside the shared nature of backhaul nodes demand exploration of new avenues of resource management policies. In this thesis a set of schemes are proposed to address the issue of Call Admission Control (CAC) in future multi-hop IP based mobile networks. The first scheme is based on a joint CAC and route assignment design mechanism in Wireless Mesh Networks (WMNs) environment, addressing issues such as pricing policies, wireless resource constraints of the access and backhaul links as well as maximising network provider's revenue. Study's focus is then shifted towards CAC design in Mobility Agent (MA) based Proxy Mobile IPv6 (PMIPv6) networks. A novel class-based CAC mechanism was proposed with the aim of eliminating bottleneck effect at the MAs. To further improve the overall capacity of the network, in conjunction with the proposed CAC mechanism, a modified version of a previously proposed Route Optimisation (RO) scheme is implemented. The performance of the proposed schemes is investigated and analysed through extensive simulations. Comparative studies are then carried out to examine the network provider's total revenue gain in WMNs environment, total blocking probability and per class blocking probability in PMIPv6 networks.
APA, Harvard, Vancouver, ISO, and other styles
16

Yusuf, Adewale, Jerry Lartey, and Vilhelm Wareus. "Network Admission Control (NAC)Securing end point devices." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-5507.

Full text
Abstract:

There have been remarkable growths in wireless communication networks in

recent years; this is because of its merits over the wired networks such as

Mobility and convenience. Wireless networks transmit the signal over the

open air via radio waves of different frequencies, this makes it to be

vulnerable to several attacks and anybody on the street can easily intercept the

wireless data or inject new data into the entire network. There has been

existence of wired equivalent privacy (WEP) protocol (IEEE 802.11i), which

was designed for wireless network security. There were concerns of security

vulnerabilities in WEP; this made it necessary for the implementation of

another solution to overcome the weaknesses of the previous wireless

network security. The IEEE 802.1X (port-based network admission control)

which is defined on Extensible Authentication protocol (EAP) provides

effective and efficient admission control to wireless and other networks

devices [8].

Our thesis investigates the efficiency of NAC (IEEE 802.1X) as a security

solution, access different vendor solutions, protocols supported and look into

the inter-operability of these various vendors. In as much as we support the

premise of NAC being an excellent solution, we will also make brilliant

recommendations in this thesis to be considered for future refinements of this

security solution as well as deployment scenarios for the university network.

APA, Harvard, Vancouver, ISO, and other styles
17

Giang, Truong Minh Triet, and trietgiang@yahoo com. "Efficient Admission Control Schemes in Cellular IP Networks." RMIT University. Electrical and Computer Engineering, 2006. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20060829.113000.

Full text
Abstract:
The thesis reviews current admission control schemes in cellular IP networks. It proposes an improved version of Threshold Access Sharing and a new scheme: weight-based scheme. Finally, an admission control scheme for hierarchical cellular network is introduced.
APA, Harvard, Vancouver, ISO, and other styles
18

Shi, Zhaogong. "Connection admission control methods for multimedia communication systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq22016.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Rios, Miguel. "Broadband networks design models and admission control algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0020/NQ48114.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Chen, Feng Kulkarni Vidyadhar G. "Admission control and routing in multi-priority systems." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2006. http://dc.lib.unc.edu/u?/etd,178.

Full text
Abstract:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2006.
Title from electronic title page (viewed Oct. 10, 2007). "... in partial fulfillment of the requirements for the degree of Do ctor of Philosophy in the Department of Statistics and Op erations Research." Discipline: Statistics and Operations Research; Department/School: Statistics and Operations Research.
APA, Harvard, Vancouver, ISO, and other styles
21

Raad, Raad. "Neuro-fuzzy admission control in mobile communications systems." Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20061030.153500/index.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Kailayanathan, Subaharan, and Jimmy Norling. "Admission Control In A Heterogeneous Software-Defined Network." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-42753.

Full text
Abstract:
Software Defined Networking (SDN) provides centralized control by separating the control plane from the data plane on network devices. Subareas of networking such as Quality of Service (QoS) can greatly benefit from this separation as QoS policies can be provided globally for the network. One way of providing QoS is to reserve and monitor network resources to guarantee a specific data rate for a requested transmission end-to-end. The presented thesis looks into possible ways of controlling the wireless medium using SDN to provide QoS. A method for providing QoS in a multihop SDN network supporting wired and wireless communication was implemented. The method was evaluated using network performance metrics such as throughput and packet jitter. The results of the experiments showed that the implemented method could limit bandwidth utilization and prioritize bandwidth usage for higher priority nodes. The performance of the network was concluded to have severe issues with dropped packets and irregular packet jitter spikes.
APA, Harvard, Vancouver, ISO, and other styles
23

Du, Yong. "Online Admission Control for Multi-Switch Ethernet Networks." Thesis, Mälardalens högskola, Inbyggda system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-29854.

Full text
Abstract:
The trend of using switched Ethernet protocols in real-time domains, where timing requirements exist, is increasing. This is mainly because of the features of switched Ethernet, such as its high throughput and availability. Compared to other network technologies, switched Ethernet can support higher data rate. Besides the timing requirements, that must be fulfilled in real-time applications, another requirement is normally demanded in real-time systems. This requirement is the ability of changing, adding or removing the messages crossing the network during run-time. This ability is known as on-line reconfiguration, and it should be done in a way that the real-time behavior of the network is not violated. This means that, the guarantee of meeting the timing requirements for the messages should not be affected by the changes in the network. In this thesis, we focus on on-line reconfiguration for multi-hop HaRTES architecture, which is a real-time switched Ethernet network. The HaRTES switch is a modified Ethernet switch that provides real-time guarantees as well as an admission control to be used for on-line reconfiguration. We study the existing reconfiguration methods including centralized and distributed approaches. Then, we propose a solution to provide on-line reconfiguration for the multi-hop HaRTES architecture, based on the studied methods. For this purpose, we use a hybrid method to achieve the advantages of both traditional centralized and distributed approaches. Moreover, we perform two different experiments. In the first experiment we focus on the decision making part of the method. The decision making part decides whether the requested reconfiguration is feasible. We calculate the time required to make the decision in different network settings. In the second experiment, we focus on the entire reconfiguration process, where the decision making is part of it. Again, we show the time needed to do the reconfiguration in several network settings. Finally, we conclude the thesis by presenting possible future works
APA, Harvard, Vancouver, ISO, and other styles
24

Más, Ignacio. "On Admission Control for IP Networks Based on Probing." Doctoral thesis, KTH, Kommunikationsnät, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4818.

Full text
Abstract:
The current Internet design is based on a best-effort service, which combines high utilization of network resources with architectural simplicity. As a consequence of this design, the Internet is unable to provide guaranteed or predictable quality of service (QoS) to real-time services that have constraints on end-to-end delay, delay jitter and packet loss. To add QoS capabilities to the present Internet, the new functions need to be simple to implement, while allowing high network utilization. In recent years, different methods have been investigated to provide the required QoS. Most of these methods include some form of admission control so that new flows are only admitted to the network if the admission does not decrease the quality of connections that are already in progress below some defined level. To achieve the required simplicity a new family of admission control methods, called end-to-end measurement-based admission control moves the admission decision to the edges of the network. This thesis presents a set of methods for admission control based on measurements of packet loss. The thesis studies how to deploy admission control in an incremental way: First, admission control is included in the audiovisual real-time applications, without any support from the network. Second, admission control is enabled at the transport layer to differentiate between elastic and inelastic flows, by embedding the probing mechanism in UDP and using the inherent congestion control of TCP. Finally, admission control is deployed at the network layer by providing differentiated scheduling in the network for probe and data packets, which then allows the operator to control the blocking probability for the inelastic flows and the average throughput for the elastic flows. The thesis offers a description of the incremental steps to provide QoS on a DiffServ-based Internet. It analyzes the proposed schemes and provides extensive figures of performance based on simulations and on real implementations. It also shows how the admission control can be used in multicast sessions by making the admission decision at the receiver. The thesis provides as well two different mathematical analyses of the network layer admission control, which enable operators to obtain initial configuration parameters for the admission decision, like queue sizes, based on the forecasted or measured traffic volume. The thesis ends by considering a new method for overload control in WLAN cells, closely based on the ideas for admission control presented in the rest of the articles.
QC 20100826
APA, Harvard, Vancouver, ISO, and other styles
25

Nevin, Anne. "The Uncertainty of Decisions in Measurement Based Admission Control." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11561.

Full text
Abstract:
Most real-time voice and video applications are delay/loss sensitive but relaxed  in the sense that they can tolerate some packet loss/delay. Using this information, network utilization can be greatly improved by exploiting statistical multiplexing. To this end, Measurement Based Admission Control (MBAC) has for a long time been recognized as a promising solution. MBAC algorithms, do not require an a priori source characterization which in many cases may be difficult or impossible to attain. Instead, MBAC uses measurements to capture the behavior of existing flows and uses this information together with some coarse knowledge of a new flow when making an admission decision for this requesting flow. The number one requirement of MBAC to be successful is that it can robustly provide Quality of Service (QoS) to the accepted flows. Being robust means that MBAC must be able to withstand a sudden increase in the number of users trying to access the network, handle applications with various capacity requirements and handle an aggregate rate that may change in a highly unpredictable manner. These robustness issues become challenging since MBAC relies on erroneous measurements. Measurements are unavoidably inaccurate. This imperfection creates uncertainties which affect the MBAC decision process. The degree of uncertainty depends on flow characteristics, the length of the observation window and the flow dynamics. Flows will be accepted when they should have been rejected, false acceptance , and rejected when they should have been accepted, false rejections. For the service provider, false rejections translate into a decrease in utilization and for the end user, false acceptance means that the QoS of the flow can no longer be guaranteed. Basing admissions on measurements clearly requires the understanding of the measurement error and how this impacts the performance of MBAC. This thesis considers the uncertainty of the MBAC admission decision process and describes a methodology for analyzing measurement errors and the resulting performance of MBAC. When studying the performance of MBAC, the key is to focus on the time-scale over which measurements are collected and the admission decision is made. This is in contrast to the infinite time-scale used when evaluating the performance of MBAC with respect to utilization and loss/delay probabilities. We find how the uncertainty in the measurements vary with the length of the observation window. Non-homogeneous flows cause increased complexity for the MBAC decision algorithm and also for the estimation process. The concept of similar flows is introduced, which is a restriction to simplify the analytical expressions in a non-homogeneous flow environment. The probability of false acceptance can be reduced by adding a slack in bandwidth. When determining the size of this slack, the service provider is confronted with the trade-off between maximizing useful traffic and reducing useless traffic. We show how the system can be provisioned to meet predetermined performance criteria. This work is fundamentally different from any previous work concerning MBAC and opens up for new thinking and methods for analyzing MBAC performance.
APA, Harvard, Vancouver, ISO, and other styles
26

Hossain, Firoz, and Abu-Shadat-Mohammad Sohab. "Mathematical Modelling of Call Admission Control in WCDMA Network." Thesis, Blekinge Tekniska Högskola, Avdelningen för signalbehandling, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2933.

Full text
Abstract:
WCDMA is an interference limited multiple access technique .It is widely used in the 3rd generation mobile networks like UMTS. When a new call arrives in the system to get admission, it checks whether the call is admitted or not based on some parameters like signal to interference ratio (SIR), transmission power of the Node B and the air interface load .If the call is accepted this will increase some interference to the ongoing calls. This new interference would degrade the ongoing calls and this will also add some extra load which may also lead to the exceeding capacity. So that the system has to decide this admission policy in a systematic way that all the users should maintain their communication with guaranteed quality of service. This decision making algorithm belongs to the radio resource management functionalities of the Radio Network Controller (RNC) in a WCDMA based UMTS network. This thesis paper focuses on the mathematical representation of the call admission control in an interference based environment. There is also a comparative study with different methods.
APA, Harvard, Vancouver, ISO, and other styles
27

Stevens-Navarro, Enrique. "Mobility management and admission control in heterogeneous wireless networks." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/5624.

Full text
Abstract:
The forthcoming fourth generation (4G) heterogeneous wireless networks are a mixture of overlapped networks using different wireless access technologies and addressing different needs from the users. Due to mobility, the users are able to switch connections among networks and hence to perform the so-called horizontal and vertical handoffs. The present thesis makes contributions to the field of mobility management with focus on handoff management and connection admission control in heterogeneous wireless networks. Two different integrated heterogeneous systems are investigated: 1) the interworking of cellular networks with wireless local area networks (WLANs) based on the I E E E 802.11 standard; 2) the interworking of cellular networks with wireless metropohtan area networks based on the I E E E 802.16e standard. To this end, first we develop a novel vertical handoff decision algorithm by modeling the vertical handoff problem as a Markov decision process. Our model considers the important tradeoff among the quality of service (QoS) of the connection and the signaling cost of performing a vertical handoff. We also take the connection duration into consideration for the handoff decision. Second, we propose an analytical model for admission control in c e l l u l a r / W L A N interworking and investigate the combination of different admission control policies. Our model considers mobihty of users, capacity and coverage of each network, admission policies, and QoS in terms of blocking and dropping probabilities. We introduce the concept of policy functions to model the admission control policies and formulate two different revenue maximization problems. T h i r d , we extend the virtual partitioning technique w i t h preemption for admission control in cellular/802.16e interworking. We propose admission control algorithms for each type of connection request. We also describe the expected mobility scenario in such integrated system. Finally, to achieve joint design at the connection-level and packet-level, a joint QoS optimization approach is used.
APA, Harvard, Vancouver, ISO, and other styles
28

De, Alwis Priyan Mihira. "Call admission control and resource utilization in WCDMA networks." Thesis, University of Canterbury. Electrical Engineering, 2005. http://hdl.handle.net/10092/9608.

Full text
Abstract:
Unlike FDMA or TDMA systems, CDMA is interference limited and has a soft capcity that changes depending on the interference felt at the base station at a given time. Admitting a new call and user movement increases the interference level in the system. Therefore a robust Call Admission and Power Control Mechanism is needed. This thesis discusses the main approaches mentioned in the literature on Call Admission Control and Power Control and analyses two modern solutions, namely the QoS aware Power Control and Handoff Prioritization scheme introduced by [T. Rachidi, A. Y. Elbatji, M. Sebbane, and H. Bouzekri 2004] and the Received Power based simulation model discussed in [A. Capone and S. Redana 2001], in greater detail. Then we proceed to recommend improvements that are then tested in a MATLAB simulation environment. The recommended changes improve the overall dropping and handoff loss probabilities. The impact of the NRT overload mechanism discussed in [T. Rachidi, A. Y. Elbatji, M. Sebbane, and H. Bouzekri 2004] is also investigated. The investigations determined the optimum solution achievable with the NRT overload parameter settings. As the final task, a discrete time dynamic feedback control system that aims to keep the dropping and handoff loss rates for RT services below a target value regardless of the traffic dynamics or the bandwidth requirements is designed. A simple Integral Feedback controller is chosen for this task because a controller that is capable of reducing steady state error is required. The controller is used for the NRT overload mechanism while the NRT error rate is left as best effort. The controller parameters are tuned using simulations and the final result is benchmarked against two algorithms that have fixed NRT overload parameters by simulating in environments under various Poisson call arrival rates and traffic loads. The NRT overload mechanism with our controller performed best by holding the RT error rate at the required target value while producing comparatively lower NRT error rates.
APA, Harvard, Vancouver, ISO, and other styles
29

Foo, Yu Chiann. "Call admission control for high altitude platform station UMTS." Thesis, University of Surrey, 2002. http://epubs.surrey.ac.uk/689/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

LODI, CLAUDIA QUEVEDO. "ADMISSION CONTROL AND RESOURCE RESERVATION IN MOBILE CELLULAR NETWORKS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=12360@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Esta tese apresenta novos algoritmos para controle de admissão de usuários em redes móveis celulares. É utilizada a técnica de reserva de recursos, também conhecida por uso de canais de guarda, para atingir os graus de qualidade de serviço desejados para cada tipo de usuário. São propostos algoritmos dinâmicos, capazes de se adaptar ao perfil de tráfego presente na rede e que possuem diferentes filosofias de projeto. Inicialmente, foi considerado o caso de uma classe que resulta em dois tipos de usuários: chamadas novas e chamadas em handoff. Os algoritmos propostos são testados em condições de tráfego representadas por diversas distribuições para o tempo de permanência do usuário na célula. Foi desenvolvido um novo simulador em linguagem C que é capaz de verificar o desempenho dos algoritmos propostos. Resultados analíticos para desempenho dos algoritmos de uma classe e um número fixo de recursos reservados são apresentados empregando uma modelagem por Cadeia de Markov. Foi desenvolvido um método que permite calcular a intensidade de tráfego máxima a qual o sistema pode ser submetido, e a quantidade de recursos a ser reservada assumindo que o objetivo é maximizar a utilização do sistema atendendo os valores de qualidade de serviço estabelecidos, no caso de tempo de retenção do recurso de rádio modelado por uma chamada com distribuição exponencial. Foi proposto um algoritmo simples, dinâmico e distribuído, baseado em medidas em tempo real, cuja meta é acompanhar a curva ótima de número de recursos reservados. Posteriormente, os resultados analíticos empregando Cadeia de Markov são generalizados para M classes. Alguns dos algoritmos definidos para o caso de uma classe são estendidos para o caso de duas classes e seu desempenho é avaliado, utilizando o simulador desenvolvido neste trabalho. O método para calcular a intensidade máxima de recursos que o sistema comporta, sem violar os requisitos de qualidade de serviço, é estendido para o caso de duas classes. Finalmente, são definidos parâmetros que permitem comparar o desempenho dos algoritmos com 2M classes, considerando uma distribuição genérica para o tempo de permanência do usuário na célula.
This thesis presents new algorithms for Channel Admission Control in wireless communications systems. We investigate techniques based in resource reservation, also known as guard channel, to achieve the quality of service desired for each class of users. We propose dynamic schemes based in the cell traffic. Each algorithm has a different goal, some try to minimize the probability of handoff fail, others try to maximize the traffic intensity when the limit imposed by QoS is being approached. First, we considered one class (M = 1) divided in two classes: new users and handoff users. In order to test the new schemes we developed a simulator in C that uses different distributions for the dwell-time. During the simulation, the measures of channel solicitations and the result of their allocation are used to decide whether new calls will be admitted. We also obtained analytic results using a Markov Chain model. We developed a method to calculate the maximum traffic intensity that the system supports without violating the established quality of service constraints, assuming one class of users and the dwell-time modelled by a exponential distribution. This method allows to identify the maximum traffic intensity supported by the system and also the exact number of resources to be reserved for each value of traffic intensity. We proposed a new, dynamic and distributed algorithm based on real time measures which targets to follow the optimum number of reserved curve obtained from our procedure. We generalized the analytic results using M-dimensional Markov Chains to 2M classes of users. Some of the algorithms defined to two classes (M = 1) were extended to the case of four classes (M = 2) and their performances are evaluated using the simulator developed in this work. The method to evaluate the maximum intensity of traffic within the limits of QoS is also extended to the case of four classes. Finally we define new parameters that allow the performance comparison among 2M class algorithms, considering any dwell- time distribution.
APA, Harvard, Vancouver, ISO, and other styles
31

Papaioannou, Dimitri A. 1971. "Channel allocation and admission control in cellular communications networks." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/46120.

Full text
Abstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 62-64).
by Dimitri A. Papaioannou.
M.S.
APA, Harvard, Vancouver, ISO, and other styles
32

Lee, Daniel C. (Daniel Chonghwan). "On open-loop admission control into a queueing system." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/12776.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.
Includes bibliographical references (leaves 156-159).
by Daniel Chonghwan Lee.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
33

Más, Ignacio. "On admission control for IP networks based on probing /." Stockholm : School of Electrical Engineering, KTH, Royal Institute of Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Venkatachari, Badrinath. "Better admission control and disk scheduling for multimedia applications." Link to electronic thesis, 2002. http://www.wpi.edu/Pubs/ETD/Available/etd-0501102-153840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Chen, Hairong. "Dynamic admission and dispatching control of stochastic distribution systems /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202003%20CHEN.

Full text
Abstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 117-130). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
36

Mao, Guoqiang. "Statistical multiplexing and connection admission control in ATM networks." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2001. https://ro.ecu.edu.au/theses/1053.

Full text
Abstract:
Asynchronous Transfer Mode (ATM) technology is widely employed for the transport of network traffic, and has the potential to be the base technology for the next generation of global communications. Connection Admission Control (CAC) is the effective traffic control mechanism which is necessary in ATM networks in order to avoid possible congestion at each network node and to achieve the Quality-of-Service (QoS) requested by each connection. CAC determines whether or not the network should accept a new connection. A new connection will only be accepted if the network has sufficient resources to meet its QoS requirements without affecting the QoS commitments already made by the network for existing connections. The design of a high-performance CAC is based on an in-depth understanding of the statistical characteristics of the traffic sources.
APA, Harvard, Vancouver, ISO, and other styles
37

Pillai, Anju. "A Connection Admission Control Framework for UMTS based Satellite Systems.An Adaptive Admission Control algorithm with pre-emption control mechanism for unicast and multicast communications in satellite UMTS." Thesis, University of Bradford, 2011. http://hdl.handle.net/10454/5487.

Full text
Abstract:
In recent years, there has been an exponential growth in the use of multimedia applications. A satellite system offers great potential for multimedia applications with its ability to broadcast and multicast a large amount of data over a very large area as compared to a terrestrial system. However, the limited transmission capacity along with the dynamically varying channel conditions impedes the delivery of good quality multimedia service in a satellite system which has resulted in research efforts for deriving efficient radio resource management techniques. This issue is addressed in this thesis, where the main emphasis is to design a CAC framework which maximizes the utilization of the scarce radio resources available in the satellite and at the same time increases the performance of the system for a UMTS based satellite system supporting unicast and multicast traffic. The design of the system architecture for a UMTS based satellite system is presented. Based on this architecture, a CAC framework is designed consisting of three different functionalities: the admission control procedure, the retune procedure and the pre-emption procedure. The joint use of these functionalities is proposed to allow the performance of the system to be maintained under congestion. Different algorithms are proposed for different functionalities; an adaptive admission control algorithm, a greedy retune algorithm and three pre-emption algorithms (Greedy, SubSetSum, and Fuzzy). A MATLAB simulation model is developed to study the performance of the proposed CAC framework. A GUI is created to provide the user with the flexibility to configure the system settings before starting a simulation. The configuration settings allow the system to be analysed under different conditions. The performance of the system is measured under different simulation settings such as enabling and disabling of the two functionalities of the CAC framework; retune procedure and the pre-emption procedure. The simulation results indicate the CAC framework as a whole with all the functionalities performs better than the other simulation settings.
APA, Harvard, Vancouver, ISO, and other styles
38

Huang, Wei. "Performance of CDMA power control and admission control in multi-service cellular systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0007/NQ34270.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Ma, Zhongjing 1975. "Call admission control and routing control in integrated communication networks via dynamic programming." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82615.

Full text
Abstract:
The problems of Connection-oriented Networking Call Admission Control (CAC) and Routing Control (RC) in Integrated Networks are formulated as finite and infinite horizon finite-state Stochastic Dynamic Programs. In particular, Poisson Markovian communication networks are analysed in detail. Because of the complexity of communication networks and of the operation of some kind of communication networks, such as the Internet, by multi-agents, it is effectively impossible to obtain the optimal solutions. Currently it is reasonable to use decentralized aggregation methods to obtain sub-optimal solutions for CAC and RC communication problems. In this thesis, stochastic dynamic programming methods for the optimal control of such network are studied. The notion of a doubly stochastic network, which possesses Markovian aggregated dynamics, is introduced, this is exploited in the hierarchical stochastic control of such hierarchical networks.
APA, Harvard, Vancouver, ISO, and other styles
40

Pillai, Anju. "A connection admission control framework for UMTS based satellite systems : an adaptive admission control algorithm with pre-emption control mechanism for unicast and multicast communications in satellite UMTS." Thesis, University of Bradford, 2011. http://hdl.handle.net/10454/5487.

Full text
Abstract:
In recent years, there has been an exponential growth in the use of multimedia applications. A satellite system offers great potential for multimedia applications with its ability to broadcast and multicast a large amount of data over a very large area as compared to a terrestrial system. However, the limited transmission capacity along with the dynamically varying channel conditions impedes the delivery of good quality multimedia service in a satellite system which has resulted in research efforts for deriving efficient radio resource management techniques. This issue is addressed in this thesis, where the main emphasis is to design a CAC framework which maximizes the utilization of the scarce radio resources available in the satellite and at the same time increases the performance of the system for a UMTS based satellite system supporting unicast and multicast traffic. The design of the system architecture for a UMTS based satellite system is presented. Based on this architecture, a CAC framework is designed consisting of three different functionalities: the admission control procedure, the retune procedure and the pre-emption procedure. The joint use of these functionalities is proposed to allow the performance of the system to be maintained under congestion. Different algorithms are proposed for different functionalities; an adaptive admission control algorithm, a greedy retune algorithm and three pre-emption algorithms (Greedy, SubSetSum, and Fuzzy). A MATLAB simulation model is developed to study the performance of the proposed CAC framework. A GUI is created to provide the user with the flexibility to configure the system settings before starting a simulation. The configuration settings allow the system to be analysed under different conditions. The performance of the system is measured under different simulation settings such as enabling and disabling of the two functionalities of the CAC framework; retune procedure and the pre-emption procedure. The simulation results indicate the CAC framework as a whole with all the functionalities performs better than the other simulation settings.
APA, Harvard, Vancouver, ISO, and other styles
41

Liu, Hui. "Dynamic call admission control under partial separation in ATM networks." Thesis, University of Ottawa (Canada), 2001. http://hdl.handle.net/10393/8975.

Full text
Abstract:
A dynamic call admission control scheme is proposed for ATM networks to support multiple Quality of Service (QoS) requirements. The scheme is based on the notion of partial separation. It divides the overall traffic flows into classes, within which each traffic source has similar QoS requirements, but may have different traffic characteristics, and the bandwidth of a link is dynamically allocated among the classes. A dynamic bandwidth allocation strategy is introduced. It achieves the goal of bandwidth allocation by optimizing a cost function defined as an estimate of the overall cell loss rate that would be generated by the total offered load. It is dynamic in the sense that the bandwidth allocation is adjusted each time when a connection requires for an acceptance or a leave. While optimizing the overall cell loss rate across classes, cell level constraint is satisfied for each class by deploying the cell loss rate estimate algorithm, proposed by H. Esaki in Connection Admission Control in ATM Networks. A simulation program is developed to validate the accuracy of the algorithm. Extensive numerical and simulation results are presented. Numerical search method is deployed to locate the optimal bandwidth assignment set. Numerical results are presented to evaluate the efficiency and adequacy of the CAC scheme.
APA, Harvard, Vancouver, ISO, and other styles
42

Xu, Zhengdao. "Study of oscillations in admission control algorithm for Web servers." Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/26546.

Full text
Abstract:
The work of this thesis is oriented towards solving the problem of system performance oscillations. We first establish the relationship between the number of users in the system and the average response time. Then we study a theoretical model of the oscillation of the number of users in the system. Then we propose a probabilistic approach to admission control where the probability of rejecting a new user increases as the load increases. Using the theoretical model, we prove that with a probabilistic approach, the oscillations will normally be suppressed, and the number of users in the system reaches a stable point. We also test the effect of different probability functions and the impact of different inter-observation time intervals on the oscillation by careful simulation experiment. Finally, the probabilistic approach is used to provide differentiated classes of service to different user groups. (Abstract shortened by UMI.)
APA, Harvard, Vancouver, ISO, and other styles
43

Saintillan, Yves. "Performance evaluation of online call routing and admission control algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0005/MQ43558.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Li, Ming. "Resource discovery and fair intelligent admission control over scalable Internet /." Electronic version, 2004. http://adt.lib.uts.edu.au/public/adt-NTSM20050314.180037/index.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Asif, Muhammad. "Flow aware admission control protocol for QoS provisioning in MANETs." Thesis, University of Surrey, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560502.

Full text
Abstract:
In Mobile Ad hoc Networks (MANETs), mobile nodes communicate over an error prone wireless channel without any centralized control. MANETs have n9 fixed topology because mobile nodes can freely join or leave the network at any time. As a consequence, it is difficult to guarantee Quality of Service (QoS) in these networks. The current routing , protocols provide only best effort services to the applications. Multimedia communications become very popular and require various types of QoS guarantee from the network such as guranteed throughput, bounded end-to-end delay. The QoS-aware routing (QA) and Admission Control (AC) protocols try to address the issue of QoS to some extent. In this work, a novel Flow Aware Admission Control (FAAC) protocol is designed to assure the guaranteed throughput to data sessions. It utilizes the route cache of routing protocol and devises a new admission technique to accept or reject data session to the network. It is partially coupled with the Oynamic Source Routing (OSR) protocol as it has used the basic functionality of route search of the OSR protocol. The protocol has two phases: (i) route discovery and (ii) test the route nodes resources for a data session entry. The performance evaluations show that the protocol outperforms the existing best effort routing and QAR and AC protocols such as OSR and Contention Aware Admission Control (CACP) protocols in providing QoS in MANETs. Mobility is a big challenge to assure guaranteed throughput to data sessions. To address this issue, we have designed F AAC-Multipath protocol that uses multiple routes for data transmission. The protocol maintains two tested routes for each data session and devises new fast switching mechanisms that switch the data flow from one route to another to guarantee the throughput. Multimedia applications require guaranteed throughput as well as bounded end-to-end delay. To address this issue we.have designed Flow Aware Admission Control-Multipath with Multiple constraints (F AAC-MM). This protocol assures the application with guaranteed throughput as well as bounded end-to-end delay. FAAC-MM switches the data flow from primary to secondary route on the basis of achieved throughput and end-to-end delay. We have also analyzed and compared the proposed protocols with the state of the art protocols such as CACP and Multi-path for Mobile Ad Hoc Networks. The simulation results show that our protocol outperforms the above mentioned protocols.
APA, Harvard, Vancouver, ISO, and other styles
46

Yang, Xu. "Call admission control in wireless networks using a neuroevolution algorithm." Thesis, Queen Mary, University of London, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.515513.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Bunde, David Pattison. "Scheduling and admission control /." 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3242803.

Full text
Abstract:
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006.
Source: Dissertation Abstracts International, Volume: 67-11, Section: B, page: 6498. Adviser: Jeff Erickson. Includes bibliographical references (leaves 64-69) Available on microfilm from Pro Quest Information and Learning.
APA, Harvard, Vancouver, ISO, and other styles
48

Tsai, Ming-Ying, and 蔡明穎. "Call Admission Control in ATM Networks." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/18121525023789473329.

Full text
Abstract:
碩士
國立交通大學
電信研究所
83
In this thesis, we mainly investigate the traffic control performed at the call setup phase in an ATM network loaded with heterogeneous sources. And this is what so called "Call Control". Under this topic, it is still divided into two categories:first, based on the numerical comparison results between the allowable number of connections from the exact analysis and that from the effective bandwidth method, here, we propose a new bandwidth allocation method for the call admission control to heterogeneous on-off sources in an infinite-buffer queueing system, which the network system accommodating the delay-tolerable but almost loss-free required sources. In the second part, we propose an optimum quantization scheme for the Markov-modulated sources in a bufferless fluid- flow model of an ATM network. Following the real-time computation algorithm for on-off sources proposed in \cite{duann}, with little modification, we extend the application to a more general source model, Markov-modulated sources. Furthermore, considering the quantization loss that might be caused under the computation algorithm in \cite{duann}, we suggest a policy for the sources to minimize the loss and achieve better utilization of link capacity.
APA, Harvard, Vancouver, ISO, and other styles
49

Yang, Hung-Chun, and 楊鴻鈞. "Admission Control with Maximizing QoS Satisfactions." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/37247675850186106187.

Full text
Abstract:
碩士
國立中山大學
資訊管理學系研究所
91
The progresses of technology bring up the bandwidth of the network, that can afford the increasing data amount from text to multimedia and make the network application development change with every passing day and become more varied. Recently, the rising of the wireless network attracts the public’s attention. Compared with the traditional network, the wireless network has the advantage in its convenience and extensibility, but it has shortcoming in its bandwidth and stability. Because of the limited resources of the wireless network, introducing QoS (Quality of Service) can use the resources more efficiently. QoS guarantee the ability to achieve the special network applications’ requests by using the network components or technology. QoS can differentiate between different classes of network services and allocate the system resources much better. Our research adopts the reward-penalty model to differentiate between different kinds of service requests to maximize the system’s earning. It is decided by three QoS parameters, reward rate, delay penalty rate and drop penalty. In the reward-penalty model, the admission control’s goal is to maximize the system’s benefit. The purpose of our research is to design an efficient and dynamic resource allocation method, including admission control and resource allocation, to find the most efficient solution under the constraint of limited resources and smoothly adjust the resources of the existing users to promise the QoS. The consequences of simulation experiments show that MDI, posed in our research, has a better performance than other algorithms. Under different network environments, e.g. arrival rate, request bandwidth, transmission time, MDI is better and more stable than other algorithms. MDI can adjust QoS parameters, e.g. reward rate, delay penalty rate, drop penalty, to achieve different system’s goal, like low delay rate or low drop rate. Thus it can be seen that MDI is able to not only make an efficient use of system resources but also adjust the QoS parameters to counter the change of the network environment in order to have a better performance.
APA, Harvard, Vancouver, ISO, and other styles
50

Dutkiewicz, Eryk. "Connection admission control in ATM networks." Thesis, 1991. http://hdl.handle.net/2440/122148.

Full text
Abstract:
In this thesis a study of connection admission control for use in future ATM networks is presented. Traffic management and control strategies proposed in the literature are suveyed. An architecture for managing and controlling traffic in ATM networks is then presented. Based on this framework a connection admission model is proposed. Two major aspects of the model, involving the solution of a finite deterministic queue with an arrival process modelled by a two-state Markov-modulated Poisson process and the superposition of two-state Markov-modulated poisson processes, are presented. The resultant algorithms are then combined to produce an algorithm for connection admission control in ATM networks.
Thesis (MSc) -- University of Adelaide, Dept. of Applied Mathematics, 1992
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Admission control' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography