To see the other types of publications on this topic, follow the link: Network performance (Telecommunication) Computer networks Computer networks Computer networks Hospitals.
Dissertations / Theses on the topic 'Network performance (Telecommunication) Computer networks Computer networks Computer networks Hospitals'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 46 dissertations / theses for your research on the topic 'Network performance (Telecommunication) Computer networks Computer networks Computer networks Hospitals.'
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
Dahal, Subharoj. "Implementing a redundant solution to improve network system reliability at XYZ Hospital." Online version, 2009. http://www.uwstout.edu/lib/thesis/2009/2009dahals.pdf.
Full text
2
Draai, Kevin. "A model for assessing and reporting network performance measurement in SANReN." Thesis, Nelson Mandela Metropolitan University, 2017. http://hdl.handle.net/10948/16131.
Full textAbstract:
The performance measurement of a service provider network is an important activity. It is required for the smooth operation of the network as well as for reporting and planning. SANReN is a service provider tasked with serving the research and education network of South Africa. It currently has no structure or process for determining network performance metrics to measure the performance of its network. The objective of this study is to determine, through a process or structure, which metrics are best suited to the SANReN environment. This study is conducted in 3 phases in order to discover and verify the solution to this problem. The phases are "Contextualisation", "Design",and "Verification". The "Contextualisation" phase includes the literature review. This provides the context for the problem area but also serves as a search function for the solution. This study adopts the design science research paradigm which requires the creation of an artefact. The "Design" phase involves the creation of the conceptual network performance measurement model. This is the artefact and a generalised model for determining the network performance metrics for an NREN. To prove the utility of the model it is implemented in the SANReN environment. This is done in the "Verification" phase. The network performance measurement model proposes a process to determine network performance metrics. This process includes getting NREN requirements and goals, defining the NRENs network design goals through these requirements, define network performance metrics from these goals, evaluating the NRENs monitoring capability, and measuring what is possible. This model provides a starting point for NRENs to determine network performance metrics tailored to its environment. This is done in the SANReN environment as a proof of concept. The utility of the model is shown through the implementation in the SANReN environment thus it can be said that it is generic.The tools that monitor the performance of the SANReN network are used to retrieve network performance data from. Through understanding the requirements, determining network design goals and performance metrics, and determining the gap the retrieving of results took place. These results are analysed and finally aggregated to provide information that feeds into SANReN reporting and planning processes. A template is provided to do the aggregation of metric results. This template provides the structure to enable metrics results aggregation but leaves the categories or labels for the reporting and planning sections blank. These categories are specific to each NREN. At this point SANReN has the aggregated information to use for planning and reporting. The model is verified and thus the study’s main research objective is satisfied.
3
McCaskey, Harold Orr. "Performance analysis of an integrated voice and data network." Thesis, Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/32966.
Full text
4
Stapelberg, Dieter. "Link failure recovery among dynamic routes in telecommunication networks." Thesis, Stellenbosch : University of Stellenbosch, 2009. http://hdl.handle.net/10019.1/2591.
Full textAbstract:
Thesis (MSc (Mathematical Sciences. Computer Science))--University of Stellenbosch, 2009.ENGLISH ABSTRACT: Since 2002 data tra c has overtaken voice tra c in volume [1]. Telecom / Network operators still generate most of their income carrying voice tra c. There is however a huge revenue potential in delivering reliable guaranteed data services. Network survivability and recovery from network failures are integral to network reliability. Due to the nature of the Internet, recovery from link failures needs to be distributed and dynamic in order to be scalable. Link failure recovery schemes are evaluated in terms of the survivability of the network, the optimal use of network resources, scalability, and the recovery time of such schemes. The need for recovery time to be improved is highlighted by real-time data tra c such as VoIP and video services carried over the Internet. The goal of this thesis is to examine existing link failure recovery schemes and evaluate the need for their extension, and to evaluate the performance of the proposed link failure recovery schemes. i
AFRIKAANSE OPSOMMING: Sedert 2002 het data verkeer die stem verkeer in volume verbygesteek [1]. Telekommunikasie / netwerk operateurs genereer egter steeds die meeste van hul inkomste met stem verkeer. Netwerk oorlewing en die herstel van netwerk mislukkings is integraal tot netwerk stabiliteit. Die samestelling van die Internet noodsaak dat die herstel van skakel mislukkings verspreid en dinamies van natuur moet wees. Die herstel-skema van skakel mislukkings word evalueer in terme van die oorleefbaarheid van die netwerk, die mees e ektiewe benutting van network bronne, aanpasbaarheid, en die herstel tydperk van die skema. Die vinnig moontlikste herstel tydperk word genoodsaak deur oombliklike data verkeer soos VoIP en beeld dienste wat oor die Internet gedra word. The doel van hierdie tesis is om bestaande skakel mislukking herstel skemas te evalueer, en dan verder ondersoek in te stel na hul uitbreiding. Daarna word die voorgestelde skakel mislukking skema se e ektiwiteit gemeet.
5
Combrink, J. J. (Jacobus Johannes). "A bandwidth market for traffic engineering in telecommunication networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/49808.
Full textAbstract:
Thesis (MSc)--University of Stellenbosch, 2004.ENGLISH ABSTRACT: Traffic engineering determines the bandwidth allocation required to meet the traffic loads in a network. Similarly an economic market determines the resource allocation required to meet the demand for resources. The term bandwidth market denotes traffic engineering methods that use economic market methodology to determine the bandwidth allocation required to meet the traffic loads. A bandwidth market is an attractive traffic engineering method because of its distributed nature and ability to respond quickly to changes in network architecture or traffic loads. Network terminology is frequently used to define bandwidth markets. Our approach is to use the concepts of microeconomics to define a bandwidth market. The result is that our bandwidth markets are similar to economic markets, which is advantageous for applying economic principles correctly. This thesis presents the theoretical basis for two bandwidth markets. The first bandwidth market is a framework for building bandwidth markets. The second bandwidth market represents a society of cooperating individuals. The society distributes resources via a mechanism based on economic principles. An implementation of the bandwidth market is presented in the form of an optimisation algorithm, followed by its application to several test networks. We show that, in the test networks examined, the optimisation algorithm reduces the network loss. For all test networks, the network loss achieved by the optimisation algorithm compares well with the network loss achieved by a centralised optimisation algorithm.
AFRIKAANSE OPSOMMING: Verkeersingenieurswese bepaal die nodige bandwydtetoekenning om die verkeersvolume in 'n netwerk te dra. Op 'n soortgelyke wyse bepaal 'n ekonomiese mark die nodige hulpbrontoekenning om die aanvraag vir hulpbronne te bevredig. Die terme bandwydtemark stel verkeersingenieurswesetegnieke voor wat ekonomiese-mark metodes gebruik om die bandwydtetoekenning vir die verkeersvolume in 'n netwerk te bepaal. 'n Bandwydtemark is 'n aantreklike verkeersingenieurswesetegniek omdat dit verspreid van aard is en vinnig kan reageer op veranderinge in netwerk argitektuur en verkeersvolume. Netwerkterminologie word gereeld gebruik om bandwydtemarkte te definieer. Ons benadering is om mikro-ekonomiese begrippe te gebruik om 'n bandwydtemark te definieer. Die resultaat is dat ons bandwydtemarkte soortgelyk aan ekonomiese markte is, wat voordelig is vir die korrekte toepassing van ekonomiese beginsels. Hierdie tesis lê die teoretiese grondwerk vir twee bandwydtemarkte. Die eerste bandwydtemark is 'n raamwerk vir die ontwikkeling van bandwydtemarkte. Die tweede bandwydtemark stel 'n vereniging van samewerkende individue voor. Die vereniging versprei bandwydte deur middel van 'n meganisme wat gebasseer is op ekonomiese beginsels. 'n Implementasie van hierdie bandwydtemark word voorgestel in die vorm van 'n optimeringsalgoritme, gevolg deur die toepassing van die optimeringsalgoritme op 'n aantal toetsnetwerke. Ons wys dat die bandwydtemark die netwerkverlies verminder in die toetsnetwerke. In terme van netwerkverlies vaar die bandwydtemark goed vergeleke met 'n gesentraliseerde optimeringsalgoritme.
6
Hoepner, Brian. "Methods of managing network user expectations." Menomonie, WI : University of Wisconsin--Stout, 2005. http://www.uwstout.edu/lib/thesis/2005/2005hoepnerb.pdf.
Full text
7
Yuen, Kwan Hung. "TCP performance over satellite networks /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20YUEN.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.Includes bibliographical references (leaves 68-71). Also available in electronic version. Access restricted to campus users.
8
Carter, Steven Michael. "Implementation and analysis of the IP measurement protocol (IPMP)." Master's thesis, Mississippi State : Mississippi State University, 2001. http://library.msstate.edu/etd/show.asp?etd=etd-11152001-090121.
Full text
9
Saple, Avdhoot Kishore Yilmaz Levent. "Agent-based simulation of behavioral anticipation in computer networks a comparative study of anticipatory fault management /." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Spring/master's/SAPLE_AVDHOOTKISHORE_37.pdf.
Full text
10
He, Rongsen. "Indirect interconnection networks for high performance routers/switches." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/R_He_072307.pdf.
Full text
11
Thompson, Richard. "Evaluating TCP/IP performance over satellite networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/49954.
Full textAbstract:
Thesis (MScEng) -- Stellenbosch University, 2004.ENGLISH ABSTRACT: Interest in TCP/IP as a communication protocol for use in space communication has increased substantially with the growth of the world wide web (WWW). TCP/IP is a relevant communication protocol for space based communication systems that need to access the broader terrestrial communication network. Low Earth Orbit(LEO) satellites have very short delay times between themselves and the ground, and correspondingly very short connection times. Staying in contact with a LEO satellite continuously through a space-based network requires large constellations of satellites and complex routing strategies. Connectivity with the world wide web using a widely accepted protocol such as TCP/IP is desirable because it would make communication with the satellite over a terrestrial station possible, were it to route communication onto the WWW. This thesis looks at the expected TCP/IP performance over satellite network links, identifies problem areas for current TCP/IP technologies, and makes suggestions for optimizing TCP/IP over such links. The thesis also introduces a new performance benchmark, the equivalence level, allowing for the simplified description of TCP throughput behaviour over a broad range of network parameters. The performance of the Linux kernel release 2.4.18 TCP/IP stack is also evaluated.
AFRIKAANSE OPSOMMING: Die belangstelling in TCP/IP as ’n kommunikasie protokol vir gebruik in die ruimte het kenmerklik toegeneem met die groei van die wereld wye web (WWW). TCP/IP is ’n relevante protokol vir kommunikasie stelsels in die ruimte, veral met die doel om toegang tot land gebaseerde kommunikasie netwerke te kry. Lae wentelbaan sateliete het baie kort vertragingstye tussen die aarde en die sateliet, en gevolglik baie kort verbindingstye. Groot sateliet konstelasies en komplekse verbintenis strategie word benodig om ’n lae wentelbaan sateliet deurentyd in kontak te hou met ’n ruimtegebaseerde netwerk. Verbinding met die wereld wye web deur die gebruik van ’n wyd aanvaarde protokol, soos TCP/IP, is wenslik, want dit sal kommunikasie met die sateliet oor ’n aardgebaseerde stasie moontlik maak, sou dit kommunikasie oor die wereld wye web stuur. Hierdie tesis kyk na die verwagte werking van TCP/IP oor sateliet netwerk konneksies, identifiseer probleme met huidiglike TCP/IP tegnologie, en maak voorstellings vir die optimale funtionering van TCP/IP oor sulke konneksies. Hierdie tesis stel ook ’n nuwe werkverrigtings maatstaf, die gelykheidsvlak, wat die vereenvoudige beskrywing van TCP/IP data tempo gedrag oor ’n groot variasie van netwerk parameters toelaat. Die werking van die Linux Kernel 2.4.18 TCP/IP stapel word ook geevalueer.
12
Wang, Kongxun. "Performance optimization with integrated consideration of routing, flow control, and congestion control in packet-switched networks." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/8305.
Full text
13
Baig, Adeel Computer Science & Engineering Faculty of Engineering UNSW. "Improving throughput and fairness of on-board mobile networks." Awarded by:University of New South Wales. School of Computer Science & Engineering, 2007. http://handle.unsw.edu.au/1959.4/28247.
Full textAbstract:
The Internet Engineering Task Force (IETF) has recently released network mobility standards that allow deployment of TCP/IP networks onboard a vehicle and maintain permanent network connectivity to the Internet via a vehicular mobile router. This recent development opens up new opportunities for providing efficient mobile computing for users on the move, especially for commuters traveling on public transports. Moreover, central and coordinated management of mobility in a single router, rather than by each user device individually, has numerous advantages. In this architecture, however, it becomes challenging to guarantee network performance due to the mobility of the network and inherently vulnerable nature of wireless links. In this thesis, a detailed performance study of onboard networks is conducted. It has been shown that disruptions in the mobile router connectivity can significantly degrade network throughput. Moreover, factors such as the limited wireless bandwidth of the access link, variations in the bandwidth due to technology switching, and the communication diversity of onboard users all contribute to the problem of unfair sharing of wireless bandwidth. By leveraging the fact that all onboard communications go through the mobile router, performance enhancing solutions are proposed that can be deployed in the mobile router to transparently address the throughput and fairness problems. In this architecture, when the route is known in advance and repetitive (e.g. for public transport or a regularly commuting private vehicle), a certain degree of prediction of impending link disruptions is possible. An anticipatory state freezing mechanism is proposed that relies on the prediction of link disruptions to freeze and unfreeze the state machine of TCP, the widely used transport protocol in the Internet. Simulation study shows that TCP throughput has a non-linear relationship with the prediction accuracy. As prediction accuracy increases, throughput problem diminishes quickly. An adaptive mobile router based fairness control mechanism is proposed to address the unfair sharing of wireless bandwidth in highly dynamic scenarios. The fairness is controlled by dynamically estimating the round-trip-times of all onboard TCP connections and transparently adjusting the protocol control parameters at the router. The thesis also discusses implementation issues for the proposed solutions.
14
Al-Fuqaha, Ala Isam Chaudhry Ghulam M. "Routing and wavelength assignment in all-optical DWDM networks with sparse wavelength conversion capabilities." Diss., UMK access, 2004.
Find full textAbstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2004."A dissertation in engineering and computer networking." Advisor: Ghulam Chaudhry. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Feb. 22, 2006. Includes bibliographical references (leaves 135-157). Online version of the print edition.
15
Kumar, Abhishek. "Network Data Streaming: Algorithms for Network Measurement and Monitoring." Diss., Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-11172005-143837/.
Full textAbstract:
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2006.Dr. Mostafa Ammar, Committee Member ; Dr. Mark Crovella, Committee Member ; Dr. Constantinos Dovrolis, Committee Member ; Dr. Ellen Zegura, Committee Chair ; Dr. Jun Xu, Committee Chair. Vita. Includes bibliographical references.
16
Prasad, Ravi S. "An evolutionary approach to improve end-to-end performance in TCP/IP networks." Diss., Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22543.
Full textAbstract:
Despite the persistent change and growth that characterizes the Internet,
the Transmission Control Protocol (TCP) still dominates at
the transport layer, carrying more than 90\% of the global traffic.
Despite its astonishing success, it has been observed that TCP
can cause poor end-to-end performance, especially for large transfers
and in network paths with high bandwidth-delay product.
In this thesis, we focus on mechanisms that can
address key problems in TCP performance, without
any modification in the protocol itself.
This evolutionary approach is important in practice, as the deployment
of clean-slate transport protocols in the Internet has been proved
to be extremely difficult.
Specifically, we identify a number of TCP-related problems
that can cause poor end-to-end performance.
These problems include poorly dimensioned socket buffer
sizes at the end-hosts, suboptimal buffer sizing at routers and switches,
and congestion unresponsive TCP traffic aggregates.
We propose solutions that can address these issues,
without any modification to TCP. In network paths with significant available bandwidth, increasing the TCP window till observing loss can result in much lower throughput than the path's available bandwidth. We show that changes in TCP are {em not required} to utilize all the available bandwidth, and propose the application-layer SOcket Buffer Auto-Sizing (SOBAS) mechanism to achieve this goal. SOBAS relies on run-time estimation of the round trip time (RTT) and receive rate, and limits its socket buffer size when the receive rate approaches the path's available bandwidth. In a congested network, SOBAS does not limit its socket buffer size. Our experiment results show that SOBAS improves TCP throughput in uncongested network without hurting TCP performance in congested networks.
Improper router buffer sizing can also result in poor TCP throughput. Previous research in router buffer sizing focused on network performance metrics such as link utilization or loss rate. Instead, we focus on the impact of buffer sizing on end-to-end TCP performance. We find that the router buffer size that optimizes TCP throughput is largely determined by the link's output to input capacity ratio. If that ratio is larger than one, the loss rate drops exponentially with the buffer size and the optimal buffer size is close to zero. Otherwise, if the output to input capacity ratio is lower than one, the loss rate follows a power-law reduction with the buffer size and significant buffering is needed. The amount of buffering required in this case depends on whether most flows end in the slow-start phase or in the congestion avoidance phase.
TCP throughput also depends on whether the cross-traffic reduces its send rate upon congestion. We define this cross-traffic property as {em congestion responsiveness}. Since the majority of Internet traffic uses TCP, which reduces its send rate upon congestion, an aggregate of many TCP flows is believed to be congestion responsive. Here, we show that the congestion responsiveness of aggregate traffic also depends on the flow arrival process. If the flow arrival process follows an open-loop model, then even if the traffic consists exclusively of TCP transfers, the aggregate traffic can still be unresponsive to congestion. TCP flows that arrive in the network in a closed-loop manner are always congestion responsive, on the other hand. We also propose a scheme to estimate the fraction of traffic that follows the closed-loop model in a given link, and give practical guidelines to increase that fraction with simple application-layer modifications.
17
Mascarenhas, da Veiga Alves Manoel Eduardo. "Characterisation of end-to-end performance for web-based file server respositories." Title page, contents and abstract only, 2001. http://web4.library.adelaide.edu.au/theses/09ENS/09ensm395.pdf.
Full textAbstract:
Bibliography: leaves 128-135. Investigates the behaviour of TCP bulk file transfer application sessions in a broadband access environment. Introduces some concepts for evaluating network behaviour: a path instability parameter for analyzing different TCP connections; a minimum RTT delay and a minimum typical path for estimating path characteristics between a client and application servers.
18
Nurubhashu, Mabusubhan Vali. "OPNET Based Design and Performance Evaluation of ZigBee Networks." Thesis, University of North Texas, 2017. https://digital.library.unt.edu/ark:/67531/metadc1062853/.
Full textAbstract:
ZigBee is a substandard of IEEE 802.15 family that is specially designed to take care of factors such as power, data rate and area that primarily affect network performance. This has controlling and monitoring capability, which finds potential applications in different sectors. ZigBee allows the concept of hybrid networks and mobility. A comprehensive analysis of ZigBee networks was carried out by constructing and simulating the networks to evaluate the performance in terms of throughput, delay, network load, and packets dropped. This research is aimed at evaluating the effect of network topology on the system performance. A careful review of simulation platforms brought the conclusion of using OPNET Modeler which has the required frame work. Different network topologies of simple and hybrid were built and simulated. Throughout the simulations, the best-case scenarios were drawn to the conclusion by the graphical analysis of parameters of evaluation. Mobile networks were constructed and simulated to investigate the effect of mobility on communication.
19
Ng, Hwee Ping. "Performance analysis of management techniques for SONET/SDH telecommunications networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FNg.pdf.
Full text
20
Zhu, Jing. "Layer 2 (LL/MAC) performance analysis and improvement of wireless heterogeneous networks /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/5950.
Full text
21
Lam, Lai-lan. "Gain-scheduled PID controllers in networked control systems." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B44193725.
Full text
22
Lam, Lai-lan, and 林麗蘭. "Gain-scheduled PID controllers in networked control systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B44193725.
Full text
23
Zhao, Qi. "Towards Ideal Network Traffic Measurement: A Statistical Algorithmic Approach." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19821.
Full textAbstract:
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2008.Committee Chair: Xu, Jun; Committee Member: Ammar, Mostafa; Committee Member: Feamster, Nick; Committee Member: Ma, Xiaoli; Committee Member: Zegura, Ellen.
24
Lee, Myounghwan. "Quality of service with DiffServ architecture in hybrid mesh/relay networks." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34694.
Full textAbstract:
The objective of this research is to develop an optimized quality of service (QoS) assurance algorithm with the differentiated services (DiffServ) architecture, and a differentiated polling algorithm with efficient bandwidth allocation for QoS assurance in the hybrid multi-hop mesh/relay networks. These wide area networks (WANs), which will employ a connection-based MAC protocol, along with QoS-enabled wireless local area networks (WLANs) that use a contention-based MAC protocol, need to provide an end-to-end QoS guarantee for data communications, particularly QoS-sensitive multimedia communications.
Due to the high cost of construction and maintenance of infrastructure in wireless networks, engineers and researchers have focused their investigations on wireless mesh/relay networks with lower cost and high scalability. For current wireless multi-hop networks, an end-to-end QoS guarantee is an important functionality to add, because the demand for real-time multimedia communications has recently been increasing. For real-time multimedia communication in heterogeneous networks, hybrid multi-hop mesh/relay networks using a connection-based MAC protocol, along with QoS-enabled WLANs that use a contention-based MAC protocol can be an effective multi-hop network model , as opposed to multi-hop networks with a contention-based MAC protocol without a QoS mechanism. To provide integrated QoS support for different QoS mechanisms, the design of the cross-layer DiffServ architecture that can be applied in wireless multi-hop mesh/relay networks with WLANs is desirable.
For parameterized QoS that requires a specific set of QoS parameters in hybrid multi-hop networks, an optimized QoS assurance algorithm with the DiffServ architecture is proposed here that supports end-to-end QoS through a QoS enhanced WAN for multimedia communications.
For a QoS assurance algorithm that requires a minimum per-hop delay, the proper bandwidth to allow the per-hop delay constraint needs to be allocated. Therefore, a polling algorithm with a differentiated strategy at multi-hop routers is proposed here. The proposed polling algorithm at a router differentially computes and distributes the polling rates for routers according to the ratio of multimedia traffic to overall traffic, the number of traffic connections, and the type of polling service.
By simulating the architecture and the algorithms proposed in this thesis and by analyzing traffic with the differentiated QoS requirement, it is shown here that the architecture and the algorithms produce an excellent end-to-end QoS guarantee.
25
Sharma, Ameeth. "Performance comparison of two dynamic shared-path protection algorithms for WDM optical mesh networks." Diss., Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-01262009-141918/.
Full text
26
Rakotoarivelo, Thierry Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Distributed discovery and management of alternate internet paths with enhanced quality of service." Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/27316.
Full textAbstract:
The convergence of recent technology advances opens the way to new ubiquitous environments, where network-enabled devices collectively form invisible pervasive computing and networking environments around the users. These users increasingly require extensive applications and capabilities from these devices. Recent approaches propose that cooperating service providers, at the edge of the network, offer these required capabilities (i.e services), instead of having them directly provided by the devices. Thus, the network evolves from a plain communication medium into an endless source of services. Such a service, namely an overlay application, is composed of multiple distributed application elements, which cooperate via a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS on the communication paths of the corresponding overlay association. This thesis asserts and shows that it is possible to provide QoS to an overlay application by using alternate Internet paths resulting from the compositions of independent consecutive paths. Moreover, this thesis also demonstrates that it is possible to discover, select and compose these independent paths in a distributed manner within an community comprising a limited large number of autonomous cooperating peers, such as the fore-mentioned service providers. Thus, the main contributions of this thesis are i) a comprehensive description and QoS characteristic analysis of these composite alternate paths, and ii) an original architecture, termed SPAD (Super-Peer based Alternate path Discovery), which allows the discovery and selection of these alternate paths in a distributed manner. SPAD is a fully distributed system with no single point of failure, which can be easily and incrementally deployed on the current Internet. It empowers the end-users at the edge of the network, allowing them to directly discover and utilize alternate paths.
27
Anjali, Tricha. "DiffServ/MPLS Network Design and Management." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5191.
Full textAbstract:
The MultiProtocol Label Switching (MPLS) framework is used in many networks to provide efficient load balancing which distributes the traffic for efficient Quality of Service (QoS) provisioning in the network. If the MPLS framework is combined with Differentiated Services (DiffServ) architecture, together they can provide aggregate-based service differentiation and QoS. The combined use of DiffServ and MPLS in a network is called DiffServ-aware Traffic Engineering (DS-TE). Such DiffServ-based MPLS networks demand development of efficient methods for QoS provisioning. In this thesis, an automated manager for management of these DiffServ-based MPLS networks is proposed. This manager, called Traffic Engineering Automated Manager (TEAM), is a centralized authority for adaptively managing a DiffServ/MPLS domain and it is responsible for dynamic bandwidth and route management. TEAM is designed to provide a novel and unique architecture capable of managing large scale MPLS/DiffServ domains without any human interference. TEAM constantly monitors the network state and reconfigures the network for efficient handling of network events. Under the umbrella of TEAM, new schemes for Label Switched Path (LSP) setup/teardown, traffic routing, and network measurement are proposed and evaluated through simulations. Also, extensions to include Generalized MPLS (GMPLS) networks and inter-domain management are proposed.
28
Heidari, Fariba. "Quality of service routing using decentralized learning." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=115672.
Full textAbstract:
This thesis presents several decentralized, learning-based algorithms for on-line routing of bandwidth guaranteed paths. The presented routing algorithms do not need any a-priori knowledge of traffic demand; they use only their locally observed events and update their routing policy using learning schemes. The employed learning algorithms are either learning automata or the multi-armed bandit algorithms. We investigate the asymptotic behavior of the proposed routing algorithms and prove the convergence of one of them to the user equilibrium. Discrete event simulation results show the merit of these algorithms in terms of improving the resource utilization and increasing the network admissibility compared with shortest path routing.We investigate the performance degradation due to decentralized routing as opposed to centralized optimal routing policies in practical scenarios. The system optimal and the Nash bargaining solutions are two centralized benchmarks used in this study. We provide nonlinear programming formulations of these problems along with a distributed recursive approach to compute the solutions. An on-line partially-decentralized control architecture is also proposed to achieve the system optimal and the Nash bargaining solution performances. Numerical results in some practical scenarios with well engineered networks, where the network resources and traffic demand are well matched, indicate that decentralized learning techniques provide efficient, stable and scalable approaches for routing the bandwidth guaranteed paths.
In the context of on-line learning, we propose a new algorithm to track the best action-selection policy when it abruptly changes over time. The proposed algorithm employs change detection mechanisms to detect the sudden changes and restarts the learning process on the detection of an abrupt change. The performance analysis of this study reveals that when all the changes are detectable by the change detection mechanism, the proposed tracking the best action-selection policy algorithm is rate optimal. On-line routing of bandwidth guaranteed paths with the potential occurrence of network shocks such as significant changes in the traffic demand is one of the applications of the devised algorithm. Simulation results show the merit of the proposed algorithm in tracking the optimal routing policy when it abruptly changes.
29
Jia, Long University of Ballarat. "Optimization based methods for solving some problems in telecommunications and the internet." University of Ballarat, 2005. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/12802.
Full textAbstract:
The purpose of this thesis is to develop some new algorithms based on optimization techniques for solving some problems in some areas of telecommunications and the Internet. There are two main parts to this thesis. In the first part we discuss optimization based stochastic and queueing models in telecommunications network corrective maintenance. In the second part we develop optimization based clustering (OBC) algorithms for network evolution and multicast routing. The most typical scenario encountered during mathematical optimization modelling in telecommunications, for example, is to minimize the cost of establishment and maintenance of the networks subject to the performance constraints of the networks and the reliability constraints of the networks as well. Most of these optimization problems are global optimization, that is, they have many local minima and most of these local minima do not provide any useful information for solving these problems. Therefore, the development of effective methods for solving such global optimization problems is important. To run the telecommunications networks with cost-effective network maintenance,we need to establish a practical maintenance model and optimize it. In the first part of the thesis, we solve a known stochastic programming maintenance optimization model with a direct method and then develop some new models. After that we introduce queue programming models in telecommunications network maintenance optimization. The ideas of profit, loss, and penalty will help telecommunications companies have a good view of their maintenance policies and help them improve their service. In the second part of this thesis we propose the use of optimization based clustering (OBC) algorithms to determine level-constrained hierarchical trees for network evolution and multicast routing. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artifiicial and real-world databases are reported.Doctor of Philosophy
30
Jia, Long. "Optimization based methods for solving some problems in telecommunications and the internet." University of Ballarat, 2005. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/14637.
Full textAbstract:
The purpose of this thesis is to develop some new algorithms based on optimization techniques for solving some problems in some areas of telecommunications and the Internet. There are two main parts to this thesis. In the first part we discuss optimization based stochastic and queueing models in telecommunications network corrective maintenance. In the second part we develop optimization based clustering (OBC) algorithms for network evolution and multicast routing. The most typical scenario encountered during mathematical optimization modelling in telecommunications, for example, is to minimize the cost of establishment and maintenance of the networks subject to the performance constraints of the networks and the reliability constraints of the networks as well. Most of these optimization problems are global optimization, that is, they have many local minima and most of these local minima do not provide any useful information for solving these problems. Therefore, the development of effective methods for solving such global optimization problems is important. To run the telecommunications networks with cost-effective network maintenance,we need to establish a practical maintenance model and optimize it. In the first part of the thesis, we solve a known stochastic programming maintenance optimization model with a direct method and then develop some new models. After that we introduce queue programming models in telecommunications network maintenance optimization. The ideas of profit, loss, and penalty will help telecommunications companies have a good view of their maintenance policies and help them improve their service. In the second part of this thesis we propose the use of optimization based clustering (OBC) algorithms to determine level-constrained hierarchical trees for network evolution and multicast routing. This problem is formulated as an optimization problem with a non-smooth, non-convex objective function. Different algorithms are examined for solving this problem. Results of numerical experiments using some artifiicial and real-world databases are reported.Doctor of Philosophy
31
Sathyanarayana, Supreeth. "Characterizing the effects of device components on network traffic." Thesis, Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47640.
Full textAbstract:
When a network packet is formed by a computer's protocol stack, there are many components (e.g., Memory, CPU, etc.) of the computer that are involved in the process. The objective of this research is to identify, characterize and analyze the effects of the various components of a device (e.g., Memory, CPU, etc.) on the device's network traffic by measuring the changes in its network traffic with changes in its components. We also show how this characterization can be used to effectively perform counterfeit detection of devices which have counterfeit components (e.g., Memory, CPU, etc.).
To obtain this characterization, we measure and apply statistical analyses like probability distribution fucntions (PDFs) on the interarrival
times (IATs) of the device's network packets (e.g., ICMP, UDP, TCP, etc.). The device is then modified by changing just one component (e.g., Memory, CPU, etc.) at a time while holding the rest constant and acquiring the IATs again. This, over many such iterations provides an understanding of the effect of each component on the overall device IAT statistics. Such statistics are captured for devices (e.g., field-programmable gate arrays (FPGAs) and personal computers (PCs)) of different types. Some of these statistics remain stable across different IAT captures for the same device and differ for different devices (completely different devices or even the same device with its components changed). Hence, these statistical variations can be used to detect changes in a device's composition, which lends itself well to counterfeit detection.
Counterfeit devices are abundant in today's world and cause billions of dollars of loss in revenue. Device components are substituted with inferior quality components or are replaced by lower capacity components. Armed with our understanding of the effects of various device components on the device's network traffic, we show how such substitutions or alterations of legitimate device components can be detected and hence perform effective counterfeit detection by statistically analyzing the deviation of the device's IATs from that of the original legitimate device. We perform such counterfeit detection experiments on various types of device configurations (e.g., PC with changed CPU, RAM, etc.) to prove the technique's efficacy. Since this technique is a fully network-based solution, it is also a non-destructive technique which can quickly, inexpensively and easily verify the device's legitimacy. This research also discusses the limitations of network-based counterfeit detection.
32
Lutshete, Sizwe. "An analysis of the correlation beween packet loss and network delay on the perfomance of congested networks and their impact: case study University of Fort Hare." Thesis, University of Fort Hare, 2013. http://hdl.handle.net/10353/d1006843.
Full textAbstract:
In this paper we study packet delay and loss rate at the University of Fort Hare network. The focus of this paper is to evaluate the information derived from a multipoint measurement of, University of Fort Hare network which will be collected for a duration of three Months during June 2011 to August 2011 at the TSC uplink and Ethernet hubs outside and inside relative to the Internet firewall host. The specific value of this data set lies in the end to end instrumentation of all devices operating at the packet level, combined with the duration of observation. We will provide measures for the normal day−to−day operation of the University of fort hare network both at off-peak and during peak hours. We expect to show the impact of delay and loss rate at the University of Fort Hare network. The data set will include a number of areas, where service quality (delay and packet loss) is extreme, moderate, good and we will examine the causes and impacts on network users.
33
Constantopoulos, Vassilios. "Highly variable real-time networks: an Ethernet/IP solution and application to railway trains." Doctoral thesis, Universite Libre de Bruxelles, 2006. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210864.
Full textAbstract:
In this thesis we study the key requirements and solutions for the feasibility and application of Ethernet-TCP/IP technology to the networks we termed Highly-Variable Real-Time Networks (HVRN). This particular class of networks poses exceptionally demanding requirements because their physical and logical topologies are both temporally and spatially variable. We devised and introduced specific mechanisms for applying Ethernet-TCP/IP to HVRNs with particular emphasis on effective and reliable modular connectivity. Using a railroad train as a reference, this work analyzes the unique requirements of HVRNs and focuses on the backbone architecture for such a system under Ethernet and TCP/IP.Doctorat en sciences appliquées
info:eu-repo/semantics/nonPublished
34
Narasimha, Rajesh. "Application of Information Theory and Learning to Network and Biological Tomography." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19889.
Full textAbstract:
Studying the internal characteristics of a network using measurements obtained from endhosts is known as network tomography. The foremost challenge in measurement-based approaches is the large size of a network, where only a subset of measurements can be obtained because of the inaccessibility of the entire network. As the network becomes larger, a question arises as to how rapidly the monitoring resources (number of measurements or number of samples) must grow to obtain a desired monitoring accuracy. Our work studies the scalability of the measurements with respect to the size of the network. We investigate the issues of scalability and performance evaluation in IP networks, specifically focusing on fault and congestion diagnosis. We formulate network monitoring as a machine learning problem using probabilistic graphical models that infer network states using path-based measurements. We consider the theoretical and practical management resources needed to reliably diagnose congested/faulty network elements and provide fundamental limits on the relationships between the number of probe packets, the size of the network, and the ability to accurately diagnose such network elements. We derive lower bounds on the average number of probes per edge using the variational inference technique proposed in the context of graphical models under noisy probe measurements, and then propose an entropy lower (EL) bound by drawing similarities between the coding problem over a binary symmetric channel and the diagnosis problem. Our investigation is supported by simulation results. For the congestion diagnosis case, we propose a solution based on decoding linear error control codes on a binary symmetric channel for various probing experiments. To identify the congested nodes, we construct a graphical model, and infer congestion using the belief propagation algorithm. In the second part of the work, we focus on the development of methods to automatically analyze the information contained in electron tomograms, which is a major challenge since tomograms are extremely noisy. Advances in automated data acquisition in electron tomography have led to an explosion in the amount of data that can be obtained about the spatial architecture of a variety of biologically and medically relevant objects with sizes in the range of 10-1000 nm A fundamental step in the statistical inference of large amounts of data is to segment relevant 3D features in cellular tomograms. Procedures for segmentation must work robustly and rapidly in spite of the low signal-to-noise ratios inherent in biological electron microscopy. This work evaluates various denoising techniques and then extracts relevant features of biological interest in tomograms of HIV-1 in infected human macrophages and Bdellovibrio bacterial tomograms recorded at room and cryogenic temperatures. Our approach represents an important step in automating the efficient extraction of useful information from large datasets in biological tomography and in speeding up the process of reducing gigabyte-sized tomograms to relevant byte-sized data. Next, we investigate automatic techniques for segmentation and quantitative analysis of mitochondria in MNT-1 cells imaged using ion-abrasion scanning electron microscope, and tomograms of Liposomal Doxorubicin formulations (Doxil), an anticancer nanodrug, imaged at cryogenic temperatures. A machine learning approach is formulated that exploits texture features, and joint image block-wise classification and segmentation is performed by histogram matching using a nearest neighbor classifier and chi-squared statistic as a distance measure.
35
Mrabet, Radouane. "Reusability and hierarchical simulation modeling of communication systems for performance evaluation: Simulation environment, basic and generic models, transfer protocols." Doctoral thesis, Universite Libre de Bruxelles, 1995. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212586.
Full textAbstract:
The main contribution of this thesis is the emphasis made on the reusability concept, on one side, for designing a simulation environment, and on the other side, for defining two different levels of granularity for reusable network component libraries.
The design of our simulation environment, called AMS for Atelier for Modeling and Simulation, was based on existing pieces of software, which proved their usefulness in their respective fields. In order to carry out this integration efficiently, a modular structure of the atelier was proposed. The structure has been divided into four phases. Each phase is responsible of a part of the performance evaluation cycle. The main novelty of this structure is the usage of a dedicated language as a means to define a clear border between the editing and simulation phases and to allow the portability of the atelier upon different platforms. A prototype of the atelier has been developed on a SUN machine running the SunOs operating system. It is developed in C language.
The kernel of the AMS is its library of Detailed Basic Models (DBMs). Each DBM was designed in order to comply with the most important criterion which is reusability. Indeed, each DBM can be used in aeveral network architectures and can be a component of generic and composite models. Before the effective usage of a DBM, it is verified and validated in order to increase the model credibility. The most important contribution of this research is the definition of a methodology for modeling protocol entities as DBMs. We then tried to partly bridge the gap between specification and modeling. This methodology is based on the concept of function. Simple functions are modeled as reusable modules and stored into a library. The Function Based Methodology was designed to help the modeler to build efficiently and rapidly new protocols designed for the new generation of networks where several services can be provided. These new protocols can be dynamically tailored to the user' s requirements.
Doctorat en sciences appliquées
info:eu-repo/semantics/nonPublished
36
"Efficient tracking of significant communication patterns in computer networks." Thesis, 2011. http://library.cuhk.edu.hk/record=b6075491.
Full textAbstract:
Shi, Xingang.Thesis (Ph.D.)--Chinese University of Hong Kong, 2011.
Includes bibliographical references (leaves 135-152).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese.
37
She, Qingya. "Design and analysis of survivability for emerging network applications /." 2008. http://proquest.umi.com/pqdweb?did=1663060081&sid=6&Fmt=2&clientId=10361&RQT=309&VName=PQD.
Full text
38
"Design and analysis of multi-path routing." 2003. http://library.cuhk.edu.hk/record=b5891512.
Full textAbstract:
Ma Ke.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 64-68).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.1
Chapter 1.2 --- Motivation --- p.2
Chapter 1.3 --- Contribution --- p.3
Chapter 1.4 --- Organization --- p.4
Chapter 2 --- Literature Review --- p.5
Chapter 2.1 --- Overview --- p.5
Chapter 2.2 --- Multi-Path Routing --- p.6
Chapter 2.2.1 --- OSPF-ECMP --- p.7
Chapter 2.2.2 --- LFI --- p.7
Chapter 2.2.3 --- QSMP and QDMP --- p.9
Chapter 2.2.4 --- WDP --- p.10
Chapter 2.2.5 --- DMPR --- p.11
Chapter 2.2.6 --- Cidon's Analysis --- p.13
Chapter 3 --- LSLF and SLSLF Conditions --- p.15
Chapter 3.1 --- Problem Formulation --- p.15
Chapter 3.2 --- LFI Conditions --- p.16
Chapter 3.3 --- LSLF Conditions --- p.17
Chapter 3.4 --- SLSLF Conditions --- p.20
Chapter 4 --- Performance of LSLF and SLSLF --- p.24
Chapter 4.1 --- Overview --- p.24
Chapter 4.2 --- Numerical Results --- p.26
Chapter 5 --- Analysis of Multi-path Routing --- p.42
Chapter 5.1 --- Assumptions --- p.43
Chapter 5.2 --- M/M/C/C Queueing System --- p.44
Chapter 5.3 --- Performance Analysis --- p.48
Chapter 5.3.1 --- "Case 1 Only QoS flows between (s, d) exist" --- p.48
Chapter 5.3.2 --- Case 2 QoS flows between other SD pairs also exist --- p.50
Chapter 5.3.3 --- Case 3 A QoS flow can try m times before it is dropped --- p.53
Chapter 5.4 --- Numerical Results --- p.56
Chapter 6 --- Conclusion --- p.62
39
"A study of the effects of TCP designs on server efficiency and throughputs on wired and wireless networks." 2003. http://library.cuhk.edu.hk/record=b5896124.
Full textAbstract:
Yeung, Fei-Fei.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 144-146).
Abstracts in English and Chinese.
Introduction --- p.1
Chapter Part I: --- A New Socket API for Enhancing Server Efficiency --- p.5
Chapter Chapter 1 --- Introduction --- p.6
Chapter 1.1 --- Brief Background --- p.6
Chapter 1.2 --- Deficiencies of Nagle's Algorithm and Goals and Objectives of this Research --- p.7
Chapter 1.2.1 --- Effectiveness of Nagle's Algorithm --- p.7
Chapter 1.2.2 --- Preventing Small Packets via Application Layer --- p.9
Chapter 1.2.3 --- Minimum Delay in TCP Buffer --- p.10
Chapter 1.2.4 --- Maximum Delay in TCP Buffer --- p.11
Chapter 1.2.5 --- New Socket API --- p.12
Chapter 1.3 --- Scope of Research and Summary of Contributions --- p.12
Chapter 1.4 --- Organization of Part 1 --- p.13
Chapter Chapter 2 --- Background --- p.14
Chapter 2.1 --- Review of Nagle's Algorithm --- p.14
Chapter 2.2 --- Additional Problems Inherent in Nagle's Algorithm --- p.17
Chapter 2.3 --- Previous Proposed Modifications on Nagle's Algorithm --- p.22
Chapter 2.3.1 --- The Minshall Modification --- p.22
Chapter 2.3.1.1 --- The Minshall Modification --- p.22
Chapter 2.3.1.2 --- The Minshall et al. Modification --- p.23
Chapter 2.3.2 --- The Borman Modification --- p.23
Chapter 2.3.3 --- The Jeffrey et al. Modification --- p.25
Chapter 2.3.3.1 --- The EOM and MORE Variants --- p.25
Chapter 2.3.3.2 --- The DLDET Variant --- p.26
Chapter 2.3.4 --- Comparison Between Our Proposal and Related Works --- p.26
Chapter Chapter 3 --- Min-Delay-Max-Delay TCP Buffering --- p.28
Chapter 3.1 --- Minimum Delay --- p.29
Chapter 3.1.1 --- Why Enabling Nagle's Algorithm Alone is Not a Solution? --- p.29
Chapter 3.1.2 --- Advantages of Min-Delay TCP-layer Buffering versus Application-layer Buffering --- p.30
Chapter 3.2 --- Maximum Delay --- p.32
Chapter 3.2.1 --- Why Enabling Nagle's Algorithm Alone is Not a Solution? --- p.32
Chapter 3.2.2 --- Advantages of Max-delay TCP Buffering versus Nagle's Algorithm --- p.33
Chapter 3.3 --- Interaction with Nagle's Algorithm --- p.34
Chapter 3.4 --- When to Apply Our Proposed Scheme? --- p.36
Chapter 3.5 --- New Socket Option Description --- p.38
Chapter 3.6 --- Implementation --- p.40
Chapter 3.6.1 --- Small Packet Transmission Decision Logic --- p.42
Chapter 3.6.2 --- Modified API --- p.44
Chapter Chapter 4 --- Experiments --- p.46
Chapter 4.1 --- The Effect of Kernel Buffering Mechanism on the Service Time --- p.47
Chapter 4.1.1 --- Aims and Methodology --- p.47
Chapter 4.1.2 --- Comparison of Transmission Time Required --- p.49
Chapter 4.2 --- Performance of Min-Delay-Max-Delay Scheme --- p.56
Chapter 4.2.1 --- Methodology --- p.56
Chapter 4.2.1.1 --- Network Setup --- p.56
Chapter 4.2.1.2 --- Traffic Model --- p.58
Chapter 4.2.1.3 --- Delay Measurement --- p.60
Chapter 4.2.2 --- Efficiency of Busy Server --- p.62
Chapter 4.2.2.1 --- Performance of Nagle's algorithm --- p.62
Chapter 4.2.2.2 --- Performance of Min-Delay TCP Buffering Scheme --- p.67
Chapter 4.2.3 --- Limiting Delay by Setting TCP´ؤMAXDELAY --- p.70
Chapter 4.3 --- Performance Sensitivity Discussion --- p.77
Chapter 4.3.1 --- Sensitivity to Data Size per Invocation of send() --- p.77
Chapter 4.3.2 --- Sensitivity to Minimum Delay --- p.83
Chapter 4.3.3 --- Sensitivity to Round Trip Time --- p.85
Chapter Chapter 5 --- Conclusion --- p.88
Chapter Part II: --- Two Analytical Models for a Refined TCP Algorithm (TCP Veno) for Wired/Wireless Networks --- p.91
Chapter Chapter 1 --- Introduction --- p.92
Chapter 1.1 --- Brief Background --- p.92
Chapter 1.2 --- Motivation and Two Analytical Models --- p.95
Chapter 1.3 --- Organization of Part II --- p.96
Chapter Chapter 2 --- Background --- p.97
Chapter 2.1 --- TCP Veno Algorithm --- p.97
Chapter 2.1.1 --- Packet Loss Type Identification --- p.97
Chapter 2.1.2 --- Refined AIMD Algorithm --- p.99
Chapter 2.1.2.1 --- Random Loss Management --- p.99
Chapter 2.1.2.2 --- Congestion Management --- p.100
Chapter 2.2 --- A Simple Model of TCP Reno --- p.101
Chapter 2.3 --- Stochastic Modeling of TCP Reno over Lossy Channels --- p.103
Chapter Chapter 3 --- Two Analytical Models --- p.104
Chapter 3.1 --- Simple Model --- p.104
Chapter 3.1.1 --- Random-loss Only Case --- p.105
Chapter 3.1.2 --- Congestion-loss Only Case --- p.108
Chapter 3.1.3 --- The General Case (Random + Congestion Loss) --- p.110
Chapter 3.2 --- Markov Model --- p.115
Chapter 3.2.1 --- Congestion Window Evolution --- p.115
Chapter 3.2.2 --- Average Throughput Formulating --- p.119
Chapter 3.2.2.1 --- Random-loss Only Case --- p.120
Chapter 3.2.2.2 --- Congestion-loss Only Case --- p.122
Chapter 3.2.2.3 --- The General Case (Random + Congestion Loss) --- p.123
Chapter Chapter 4 --- Comparison with Experimental Results and Discussions --- p.127
Chapter 4.1 --- Throughput versus Random Loss Probability --- p.127
Chapter 4.2 --- Throughput versus Normalized Buffer Size --- p.132
Chapter 4.3 --- Throughput versus Bandwidth in Asymmetric Networks --- p.135
Chapter 4.3 --- Summary --- p.136
Chapter Chapter 5 --- Sensitivity of TCP Veno Throughput to Various Parameters --- p.137
Chapter 5.1 --- Multiplicative Decrease Factor (α) --- p.137
Chapter 5.2 --- Number of Backlogs (β) and Fractional Increase Factor (γ) --- p.139
Chapter Chapter 6 --- Conclusions --- p.142
Bibliography --- p.144
40
"Frequency allocation, transmit power control, and load balancing with site specific knowledge for optimizing wireless network performance." Thesis, 2007. http://hdl.handle.net/2152/3016.
Full text
41
Chen, Jeremy Kang-pen. "Frequency allocation, transmit power control, and load balancing with site specific knowledge for optimizing wireless network performance." 2007. http://hdl.handle.net/2152/13184.
Full text
42
"Variable-rate linear network coding." 2007. http://library.cuhk.edu.hk/record=b5893348.
Full textAbstract:
Fong, Lik Hang Silas.Thesis (M.Phil.)--Chinese University of Hong Kong, 2007.
Includes bibliographical references (leaves 40).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iii
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Linear Network Code --- p.4
Chapter 2.1 --- Linear Network Code without Link Failures --- p.4
Chapter 2.1.1 --- Linear Multicast and Linear Broadcast --- p.6
Chapter 2.2 --- Linear Network Code with Link Failures --- p.8
Chapter 2.2.1 --- Static Linear Multicast and Static Linear Broadcast --- p.9
Chapter 3 --- Variable-Rate Linear Network Coding --- p.11
Chapter 3.1 --- Variable-Rate Linear Network Coding without Link Failures --- p.11
Chapter 3.1.1 --- Problem Formulation --- p.11
Chapter 3.1.2 --- Algorithm and Analysis --- p.12
Chapter 3.2 --- Variable-Rate Linear Network Coding with Link Failures --- p.23
Chapter 3.2.1 --- Problem Formulation --- p.23
Chapter 3.2.2 --- Algorithm and Analysis --- p.23
Chapter 3.3 --- The Maximum Broadcast Rate of Linear Network Code --- p.28
Chapter 4 --- Conclusion --- p.38
Bibliography --- p.40
43
"A unified framework for linear network coding." 2008. http://library.cuhk.edu.hk/record=b5893688.
Full textAbstract:
Tan, Min.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.
Includes bibliographical references (p. 35-36).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Previous Work --- p.1
Chapter 1.2 --- Motivation --- p.2
Chapter 1.3 --- Contributions --- p.2
Chapter 1.4 --- Thesis Organization --- p.3
Chapter 2 --- Linear Network Coding Basics --- p.5
Chapter 2.1 --- Formulation and Example --- p.5
Chapter 2.2 --- Some Notations --- p.9
Chapter 3 --- A Unified Framework --- p.13
Chapter 3.1 --- Generic Network Codes Revisited --- p.13
Chapter 3.2 --- A Unified Framework --- p.24
Chapter 3.3 --- Simplified Proofs --- p.29
Chapter 4 --- Conclusion --- p.33
Bibliography --- p.35
44
Minerve, Mampaka Maluambanzila. "Quadri-dimensional approach for data analytics in mobile networks." Diss., 2018. http://hdl.handle.net/10500/25882.
Full textAbstract:
The telecommunication market is growing at a very fast pace with the evolution of new technologies to support high speed throughput and the availability of a wide range of services and applications in the mobile networks. This has led to a need for communication service providers (CSPs) to shift their focus from network elements monitoring towards services monitoring and subscribers’ satisfaction by introducing the service quality management (SQM) and the customer experience management (CEM) that require fast responses to reduce the time to find and solve network problems, to ensure efficiency and proactive maintenance, to improve the quality of service (QoS) and the quality of experience (QoE) of the subscribers. While both the SQM and the CEM demand multiple information from different interfaces, managing multiple data sources adds an extra layer of complexity with the collection of data.
While several studies and researches have been conducted for data analytics in mobile networks, most of them did not consider analytics based on the four dimensions involved in the mobile networks environment which are the subscriber, the handset, the service and the network element with multiple interface correlation.
The main objective of this research was to develop mobile network analytics models applied to the 3G packet-switched domain by analysing data from the radio network with the Iub interface and the core network with the Gn interface to provide a fast root cause analysis (RCA) approach considering the four dimensions involved in the mobile networks. This was achieved by using the latest computer engineering advancements which are Big Data platforms and data mining techniques through machine learning algorithms.Electrical and Mining Engineering
M. Tech. (Electrical Engineering)
45
"A multiple ant colony optimization approach for load-balancing." 2003. http://library.cuhk.edu.hk/record=b5891640.
Full textAbstract:
Sun Weng Hong.Thesis submitted in: October 2002.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 116-121).
Abstracts in English and Chinese.
Chapter 1. --- Introduction --- p.7
Chapter 2. --- Ant Colony Optimization (ACO) --- p.9
Chapter 2.1 --- ACO vs. Traditional Routing --- p.10
Chapter 2.1.1 --- Routing information --- p.10
Chapter 2.1.2 --- Routing overhead --- p.12
Chapter 2.1.3 --- Adaptivity and Stagnation --- p.14
Chapter 2.2 --- Approaches to Mitigate Stagnation --- p.15
Chapter 2.2.1 --- Pheromone control --- p.15
Chapter 2.2.1.1 --- Evaporation: --- p.15
Chapter 2.2.1.2 --- Aging: --- p.16
Chapter 2.2.1.3 --- Limiting and smoothing pheromone: --- p.17
Chapter 2.2.2 --- Pheromone-Heuristic Control --- p.18
Chapter 2.2.3 --- Privileged Pheromone Laying --- p.19
Chapter 2.2.4 --- Critique and Comparison --- p.21
Chapter 2.2.4.1 --- Aging --- p.22
Chapter 2.2.4.2 --- Limiting pheromone --- p.22
Chapter 2.2.4.3 --- Pheromone smoothing --- p.23
Chapter 2.2.4.4 --- Evaporation --- p.25
Chapter 2.2.4.5 --- Privileged Pheromone Laying --- p.25
Chapter 2.2.4.6 --- Pheromone-heuristic control --- p.26
Chapter 2.3 --- ACO in Routing and Load Balancing --- p.27
Chapter 2.3.1 --- Ant-based Control and Its Ramifications --- p.27
Chapter 2.3.2 --- AntNet and Its Extensions --- p.35
Chapter 2.3.3 --- ASGA and SynthECA --- p.40
Chapter 3. --- Multiple Ant Colony Optimization (MACO) --- p.45
Chapter 4. --- MACO vs. ACO --- p.51
Chapter 4.1 --- Analysis of MACO vs. ACO --- p.53
Chapter 5. --- Applying MACO in Load Balancing --- p.89
Chapter 5.1 --- Applying MACO in Load-balancing --- p.89
Chapter 5.2 --- Problem Formulation --- p.91
Chapter 5.3 --- Types of ant in MACO --- p.93
Chapter 5.3.1 --- Allocator. --- p.94
Chapter 5.3.2 --- Destagnator. --- p.95
Chapter 5.3.3 --- Deallocator. --- p.100
Chapter 5.4 --- Global Algorithm --- p.100
Chapter 5.5 --- Discussion of the number of ant colonies --- p.103
Chapter 6. --- Experimental Results --- p.105
Chapter 7. --- Conclusion --- p.114
Chapter 8. --- References --- p.116
Appendix A. Ants in MACO --- p.122
Appendix B. Ants in SACO. --- p.123
46
Vojini, Sumith Dev. "Reducing handoff latency in proxy mobile IPv6." Thesis, 2014. http://hdl.handle.net/1805/4449.
Full textAbstract:
Indiana University-Purdue University Indianapolis (IUPUI)Mobile IP though allows mobility features to a node it suffers from signaling Latencies which are mainly incurred due to the fact that the MN itself is involved in the handover process. To overcome this problem proxy mobile IPv6(PMIPv6) was defined where the mobility signaling is taken care of by a proxy server while keeping track of the MN's movement. PMIPv6 has considerably reduced the handover latency but the demand for real time applications over the network has increased tremendously due to recent explosion of the cloud era. My thesis focuses on increasing the L3 handoff signaling efficiency by reducing the latency. This is achieved by our idea to do both the AAA authentication as well as the LMA registration in PMIPv6 at the same time. The simulation results show that our proposed approach perform better than the current PMIPv6 L3 handover signaling reducing the latency as well as packet loss.