Dissertations / Theses: 'Communication Telecommunication Computer networks'

1

Andrag, Walter H. "Reinforcement learning for routing in communication networks." Thesis, Stellenbosch : Stellenbosch University, 2003. http://hdl.handle.net/10019.1/53570.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2003.
ENGLISH ABSTRACT: Routing policies for packet-switched communication networks must be able to adapt to changing traffic patterns and topologies. We study the feasibility of implementing an adaptive routing policy using the Q-Learning algorithm which learns sequences of actions from delayed rewards. The Q-Routing algorithm adapts a network's routing policy based on local information alone and converges toward an optimal solution. We demonstrate that Q-Routing is a viable alternative to other adaptive routing methods such as Bellman-Ford. We also study variations of Q-Routing designed to better explore possible routes and to take into consideration limited buffer size and optimize multiple objectives.
AFRIKAANSE OPSOMMING:Die roetering in kommunikasienetwerke moet kan aanpas by veranderings in netwerktopologie en verkeersverspreidings. Ons bestudeer die bruikbaarheid van 'n aanpasbare roeteringsalgoritme gebaseer op die "Q-Learning"-algoritme wat dit moontlik maak om 'n reeks besluite te kan neem gebaseer op vertraagde vergoedings. Die roeteringsalgoritme gebruik slegs nabygelee inligting om roeteringsbesluite te maak en konvergeer na 'n optimale oplossing. Ons demonstreer dat die roeteringsalgoritme 'n goeie alternatief vir aanpasbare roetering is, aangesien dit in baie opsigte beter vaar as die Bellman-Ford algoritme. Ons bestudeer ook variasies van die roeteringsalgoritme wat beter paaie kan ontdek, minder geheue gebruik by netwerkelemente, en wat meer as een doelfunksie kan optimeer.

APA, Harvard, Vancouver, ISO, and other styles

2

Konta, Kaori. "Computer-mediated communication as the paradigm: Resistance to technology and the new style of human communication." CSUSB ScholarWorks, 1997. https://scholarworks.lib.csusb.edu/etd-project/1481.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kolar, Vinay. "Routing and traffic-engineering in multi-hop wireless networks an optimization based approach /." Diss., Online access via UMI:, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Guo, Xingang. "Predictable CPU bandwidth management framework for next-generation operating systems /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004274.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

He, Changhua, and 何昌華. "Resource management for handoff control in wireless/mobile networks using artificial neural networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31226000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Tae-jin. "Traffic management and design of multiservice networks : the Internet and ATM networks /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Baig, Adeel Computer Science &amp 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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

8

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

9

Barlow, David A. "Router-based traffic engineering in MPLS/DiffServ/HMIP radio access networks." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/15362.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Serbest, Yetik. "Resource management of integrated services networks /." Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

12

Bohannan, Chad Brian. "Performance evaluation of routing protocols for QOS support in rural mobile ad hoc networks." Thesis, Montana State University, 2008. http://etd.lib.montana.edu/etd/2008/bohannan/BohannanC0508.pdf.

Full text

Abstract:

We evaluate several routing protocols, and show that the use of bandwidth and delay estimation can provide throughput and delay guarantees in Mobile Ad Hoc Networks (MANETs). This thesis describes modifications to the Dynamic Source Routing (DSR) protocol to implement the Quality Aware Source Routing (QASR) network routing protocol operating on an 802.11e link layer. QASR network nodes exchange node location and flow reservation data periodically to provide information necessary to model and estimate both the available bandwidth and the end-to-end delay of available routes during route discovery. Bandwidth reservation is used to provide end-to-end Quality of Service, while also utilizing the differentiated Quality of Service provided by the 802.11e link layer. We show that QASR performs significantly better in several performance metrics over the DSR and the Ad-Hoc On-Demand Distance Vector (AODV) protocols, and performs more consistently in all quality metrics when traffic demand exceeds network capacity.

APA, Harvard, Vancouver, ISO, and other styles

13

Vuza, Xolisa. "Social and technical issues of IP-based multi-modal semi-synchronous communication: rural telehealth communication in South Africa." Thesis, University of the Western Cape, 2005. http://etd.uwc.ac.za/index.php?module=etd&amp.

Full text

Abstract:

Most rural areas of developing countries are faced with problems like shortage of doctors in hospitals, illiteracy and poor power supply. Because of these issues, Information and Communication Technology (ICT) is often sees as a useful solution for these areas. Unfortunately, the social environment is often ignored. This leads to inappropriate systems being developed for these areas. The aims of this thesis were firstly, to learn how a communication system can be built for a rural telehealth environment in a developing country, secondly to learn how users can be supported to use such a system.

APA, Harvard, Vancouver, ISO, and other styles

14

Hsiao, Hsu-Feng. "Multimedia streaming congestion control over heterogeneous networks : from distributed computation and end-to-end perspectives /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/5946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Pong, Dennis Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Quality of service support in multi-rate wireless networks." Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/25153.

Full text

Abstract:

Packet switched wireless networks have become increasingly popular due to improvements in transmission speed, ease of deployment and mobility. Wireless technologies such as the IEEE 802.11 Wireless Local Area Networks provide transmission speeds capable of supporting multimedia applications. However, wireless channels suffer from short term effects such as interference and fading, and long term effects such as signal strength changes that are caused by user mobility. In multi-rate networks, stations can adapt to the channel variations by adjusting their physical transmission rates. This introduces resource management problems as resource usage depends on the application's bit rate as well as the physical transmission rate used. Multimedia applications demand consistent Quality of Service (QoS) performance from the network. This does not fit well with the dynamic nature of wireless networks. In this thesis, we propose a link layer resource manager to maintain application QoS requirements in multi-rate wireless networks. It consists of two components - Resource reservation and Medium Access Control (MAC) parameters selection. The resource reservation algorithm determines the current and future amount of channel resources required by a multimedia application and performs the function of admission control. This prevents any new traffic or physical transmission rate changes from degrading the QoS of the admitted traffic. The design of the MAC parameters selection algorithm is based on the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) scheme. The algorithm enables the provision of QoS to individual multimedia applications with the prioritised service of EDCA. Analytical and simulation studies were performed to demonstrate the efficiency and effectiveness of the algorithms. The results highlighted the ability of the algorithms to mitigate the QoS provision problem in multi-rate wireless networks introduced by channel variations.

APA, Harvard, Vancouver, ISO, and other styles

16

Yuen, Siu Yu. "Routing and time-slot assignment algorithms and connection management in photonic circuit switched networks /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20YUEN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Dimitrov, Rossen Petkov. "Overlapping of communication and computation and early binding fundamental mechanisms for improving parallel performance on clusters of workstations /." Diss., Mississippi State : Mississippi State University, 2001. http://library.msstate.edu/etd/show.asp?etd=etd-04092001-231941.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Lakshmanan, Sriram. "Securing wireless networks against eavesdropping using smart antennas." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/26698.

Full text

Abstract:

Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.
Committee Chair: Raghupathy, Sivakumar; Committee Member: Farmarz Fekri; Committee Member: Mary Ann, Ingram. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

19

Miller, Mark Henry Bruce. "The optimum communications architecture for deep level gold mining." Diss., Pretoria : [s.n.], 2000. http://upetd.up.ac.za/thesis/available/etd-01122007-124105/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Sawant, Uttara. "Grid-based Coordinated Routing in Wireless Sensor Networks." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5437/.

Full text

Abstract:

Wireless sensor networks are battery-powered ad-hoc networks in which sensor nodes that are scattered over a region connect to each other and form multi-hop networks. These nodes are equipped with sensors such as temperature sensors, pressure sensors, and light sensors and can be queried to get the corresponding values for analysis. However, since they are battery operated, care has to be taken so that these nodes use energy efficiently. One of the areas in sensor networks where an energy analysis can be done is routing. This work explores grid-based coordinated routing in wireless sensor networks and compares the energy available in the network over time for different grid sizes.

APA, Harvard, Vancouver, ISO, and other styles

21

Paliwal, Gaurav. "Convergence : the next big step /." Online version of thesis, 2006. https://ritdml.rit.edu/dspace/handle/1850/1316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

APA, Harvard, Vancouver, ISO, and other styles

23

Liu, Kung-Chao. "Information system development and the use of electronic meeting systems." Diss., The University of Arizona, 1991. http://hdl.handle.net/10150/185439.

Full text

Abstract:

Information system requirements determination is a key area in management information systems research that includes the problems of requirements specification, requirements elicitation, and user involvement. The combination of these three problems is a research area which we call the group approach to information system requirements determination. The main contribution of this research is a model to be used for the problem of fitting existing computer aids to this research area and a set of methods for solving the usability and configuration problems when using such computer aids. The usability problem is that of determining whether a set of computer aids can be used effectively in accomplishing the task of requirements determination. The configuration problem is that of selecting a minimum collection of funtionalities necessary for economically supporting all aspects of requirements determination. Electronic meeting systems are the general category of computer aids that we are interested in applying to the task. In particular, the GroupSystems electronic meeting system developed at The University of Arizona is used as a case in this research. Characteristics of the requirements determination task and profiles of GroupSystems tools are combined into our model for fitting computer aids to a given task. We then derive the answers regarding the usability and configuration of GroupSystems in the group approach to information system requirements determination. We also compare the derived configurations to the GroupSystems tools used in an authentic case. The main points of this research include: (1) proposal of the concept of fitting computer aids to, instead of developing new computer aids for, a task area; (2) proposal of a model for fitting computer aids via a classification of information types; (3) analysis of the natures of the fitting model and the usability and configuration problems; (4) proposal of approximation methods for solving the configuration problem; (5) analysis of the task area--the group approach to information system requirements determination; (6) analysis of the use of GroupSystems in the task area by applying the proposed fitting model and approximation methods; and (7) demonstration of the usefulness of the fitting model and approximation methods by analyzing an authentic case of using GroupSystems tools.

APA, Harvard, Vancouver, ISO, and other styles

24

Farmer, Jason Z. "Multi-objective routing optimization for multiple level priority and preemption in multi-tiered networks." Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-121806-235007/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bozek, Matthew Peter. "Express lanes modification to the data vortex photonic all-optical path interconnection network." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24680.

Full text

Abstract:

Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.
Committee Chair: Wills, D. Scott; Committee Member: Keezer, David; Committee Member: Yalamanchili, Sudhakar

APA, Harvard, Vancouver, ISO, and other styles

26

Zhang, Xin. "Network Formation and Routing for Multi-hop Wireless Ad-Hoc Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11470.

Full text

Abstract:

An energy-aware on-demand Bluetooth scatternet formation and routing protocol taking into account network architecture and traffic pattern is proposed. The scatternet formation protocol is able to cope with multiple sources initiating traffic simultaneously as well as prolong network lifetime. A modified Inquiry scheme using extended ID packet is introduced for fast device discovery and power efficient propagation of route request messages with low delay. A mechanism employing POLL packets in Page processes is proposed to transfer scatternet formation and route reply information without extra overhead. In addition, the energy aware forwarding nodes selection scheme is based on local information and results in more uniform network resource utilization and improved network lifetime. Simulation results show that this protocol can provide scatternet formation with reasonable delay and with good load balance which results in prolonged network lifetime for Bluetooth-based wireless sensor networks. In this research, a metric-based scatternet formation algorithm for the Bluetooth-based sensor motes is presented. It optimizes the Bluetooth network formation from the hop distance and link quality perspectives. In addition, a smart repair mechanism is proposed to deal with link/node failure and recover the network connectivity promptly with low overhead. The experiments with the Intel Mote platform demonstrate the effectiveness of the optimizations. This research also investigates the scalability of ad hoc routing protocols in very large-scale wireless ad hoc networks. A comprehensive simulation study is conducted of the performance of an on-demand routing protocol on a very large-scale, with as many as 50,000 nodes in the network. The scalability analysis is addressed based on various network sizes, node density, traffic load, and mobility. The reasons for packet loss are analyzed and categorized at each network layer. Based on the observations, we observe the effect of the parameter selection and try to exhaust the scalability boundary of the on-demand routing protocol for wireless ad hoc networks.

APA, Harvard, Vancouver, ISO, and other styles

27

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 text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

28

Hawkins, William Cory. "Evaluation of the data vortex photonic all-optical path interconnection network for next-generation supercomputers." Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-12182006-155304/.

Full text

Abstract:

Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2007.
Dr. Henry L. Owen III, Committee Member ; Dr. David Keezer, Committee Member ; Dr. D. Scott Wills, Committee Chair.

APA, Harvard, Vancouver, ISO, and other styles

29

Lin, Hua. "Performance analysis of multistage interconnection networks with general traffic." Ohio : Ohio University, 2002. http://www.ohiolink.edu/etd/view.cgi?ohiou1174680433.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

APA, Harvard, Vancouver, ISO, and other styles

31

Nguyen, Cong Duc. "Creation and distribution of real-time content a case study in provisioning immersive voice communications to networked games /." Access electronically, 2006. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20070110.164837/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Abidogun, Olusola Adeniyi. "Data mining, fraud detection and mobile telecommunications: call pattern analysis with unsupervised neural networks." Thesis, University of the Western Cape, 2005. http://etd.uwc.ac.za/index.php?module=etd&amp.

Full text

Abstract:

Huge amounts of data are being collected as a result of the increased use of mobile telecommunications. Insight into information and knowledge derived from these databases can give operators a competitive edge in terms of customer care and retention,
marketing and fraud detection. One of the strategies for fraud detection checks for signs of questionable changes in user behavior. Although the intentions of the mobile phone users cannot be observed, their intentions are reflected in the call data which define usage patterns. Over a period of time, an individual phone generates a large pattern of use. While call data are recorded for subscribers for billing purposes, we are making no prior assumptions about the data indicative of fraudulent call patterns, i.e. the calls made for billing purpose are unlabeled. Further analysis is thus, required to be able to isolate fraudulent usage. An unsupervised learning algorithm can analyse and cluster call patterns for each subscriber in order to facilitate the fraud detection process.

This research investigates the unsupervised learning potentials of two neural networks for the profiling of calls made by users over a period of time in a mobile telecommunication network. Our study provides a comparative analysis and application of Self-Organizing Maps (SOM) and Long Short-Term Memory (LSTM) recurrent neural networks algorithms to user call data records in order to conduct a descriptive data mining on users call patterns.

Our investigation shows the learning ability of both techniques to discriminate user call patterns
the LSTM recurrent neural network algorithm providing a better discrimination than the SOM algorithm in terms of long time series modelling. LSTM discriminates different types of temporal sequences and groups them according to a variety of features. The ordered features can later be interpreted and labeled according to specific requirements of the mobile service provider. Thus, suspicious call behaviours are isolated within the mobile telecommunication network and can be used to to identify fraudulent call patterns. We give results using masked call data
from a real mobile telecommunication network.

APA, Harvard, Vancouver, ISO, and other styles

33

Mazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chavan, Rohit. "JAVA synchronized collaborative multimedia toolkit: A collaborative communication tool." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2549.

Full text

Abstract:

In this project a collaboration multimedia toolkit, JSCMT (Java Synchronized Collaborative Multimedia Toolkit) was developed which is intended to connect a group of people located in different geographical locations who are working on the same project.

APA, Harvard, Vancouver, ISO, and other styles

35

Thiessen, Christian. "Resilient routing and spectrum assignment in Elastic Optical Networks under Dynamic Traffic." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-155684.

Full text

Abstract:

Transparent Elastic Optical Networks (EON) are seen as a promising solution for future optical transport networks to keep up with internet traffic growth, as they allow provisioning connections with different bandwidth requirements in an efficient way. To achieve high spectrum efficiency in these networks, making good Routing, Modulation and Spectrum Assignment (RMLSA) decisions is essential. Since fiber cuts are common, resiliency against single-link failures is another important topic. This can be provided efficiently through shared-path protection (SPP), which in turn complicates the RMLSA problem. Existing routing, modulation and spectrum assignment algorithms for SPP focus on the two-step approach, where primary paths are selected independently of their backup path options. However, selecting a different primary path can allow for a better backup path with higher shareability of backup resources if primary and backup path pairs are considered together. Previous studies on SPP in EONs mostly consider the static traffic scenario. Under a dynamic traffic scenario, where unpredictable connection re-quests arrive and terminate over time, fragmentation of spectral resources has a significant impact on the network performance. In this thesis, a new algorithm is proposed for SPP in EONs against single-link failures where primary and backup path pairs are selected jointly, thereby minimizing fragmentation and maximizing shareability which leads to better network performance in terms of blocking probability. Unlike existing algorithms, the primary and backup path and spectrum are decided simultaneously from a set of candidate path pairs and the spectrum assignment is done using a hybrid cost metric. The metric is a weighted combination of existing metrics that integrates fragmentation and shareability into a multi-objective function. Using network traffic simulations in two reference networks, the effect of the different cost functions on the algorithm’s behavior is explored and an optimal set of weights is determined. With this parameterization, traffic simulations in a scaled-down sample US network topology with load values of 190-240 Erlang, corresponding to blocking probabilities of 0.1% to 1%, show an average improvement over the reference algorithm of 79% in blocking probability, 6.9% in shareability and 5.9% in spectrum fragmentation. It is also shown that most of this improvement is caused by joint primary-backup path assignments. The hybrid cost function reduces blocking by a further 10%.
Transparenta Elastiska Optiska Nätverk (EON) ses som en lovande lösning för framtida optiska transportnät för att hänga med Internettrafikens tillväxt, eftersom de möjliggör att tillhandahålla förbindelser med olika krav på bandbredd på ett effektivt sätt. För att uppnå hög spektrumeffektivitet i dessa nätverk är det viktigt att fatta bra beslut vad avser routing, modulering och spektrumtilldelning (Routing, Modulation Level and Spectrum Assignment, RMLSA). Eftersom fiberavbrott är vanliga, så är tåligheten mot enstaka länkfel et annat viktigt ämne. Detta kan ske effektivt genom att skydda gemensamma reservvägar (Shared Path Protection, SPP), vilket dock försvårar RMLSA-problemet. Befintliga routing, modulering och spektrumtilldelningsalgoritmer för SPP fokuserar på strategier i två steg, där först de primära vägarna väljs oberoende av deras backupalternativ. Att välja en annan primär väg, kan dock möjliggöra en bättre reservväg med bättre delning av backupresurser om i stället par av primära och sekundära vägar bedöms tillsammans. Tidigare studier på SPP i EONs anser främst statiska trafikscenarier. I ett dynamiskt trafikscenario, där oförutsägbara anslutningsbegäranden inkommer och avslutas över tiden, så kommer fragmenteringen av spektrala resurser ha en betydande inverkan på nätverkets prestanda. I denna avhandling föreslås en ny algoritm för SPP i EONs för hantering av enskilda länkfel, där par av primära och sekundära vägar väljs gemensamt, vilket minimerar fragmentering och maximerar delning vilket leder till bättre nätverksprestanda i form av minskat blockering. Till skillnad från befintliga algoritmer beslutas den primära och sekundära vägen och spektrum samtidigt från en uppsättning av par av kandidatvägar och spektrumtilldelningen görs med en hybrid-kostnadsfunktion. Funktionen är en viktad kombination av befintliga mått som integrerar fragmentering och delning till en multi-objektiv målfunktion. Med användning av nätverkstrafiksimuleringar i två referensnätverk studeras effekten av olika kostnadsfunktioner på algoritmens beteende och en optimal uppsättning av vikter bestäms. Med dessa parametrar, trafiksimuleringar i en reducerad US-nätverkstopologi med belastningsvärden på 190-240 Erlang, motsvarande blockeringssannolikheter på 0,1 - 1%, visar en genomsnittlig förbättring under referensalgoritmen på 79% i blockeringens sannolikhet, 6.9% i delning och 5,9% i fragmentering. Det visas också att det mesta av denna förbättring beror på det samtidiga tilldelning av primära och reservlänkar. Hybridkostnadsfunktionen minskar blockeringen med ytterligare 10%.

APA, Harvard, Vancouver, ISO, and other styles

36

Rais, Rao Naveed Bin. "COMMUNICATION MECHANISMS FOR MESSAGE DELIVERY IN HETEROGENEOUS NETWORKS PRONE TO EPISODIC CONNECTIVITY." Phd thesis, Université de Nice Sophia-Antipolis, 2011. http://tel.archives-ouvertes.fr/tel-00590626.

Full text

Abstract:

Il est très probable que l'Internet du futur interconnectera des réseaux encore plus hétérogènes qu'ils ne le sont aujourd'hui. Aussi, les nouvelles applications incluant la surveillance de l'environnement, l'intervention d'urgence et la communication véhiculaire nécessitent une plus grande tolérance aux délais ainsi qu'aux pertes de connectivité. L'interconnexion des réseaux hétérogènes robustes aux coupures de connectivité pose de nombreux défis scientifiques. Dans cette thèse nous proposons trois contributions principales dans ce domaine. Premièrement, nous présentons une classification des protocoles de routage DTN qui se base sur les stratégies de routage. Nous proposons des heuristiques pour choisir le meilleur module de routage à utiliser. Deuxièmement, nous proposons un nouveau protocole, appelé MeDeHa, pour disséminer des messages dans les réseaux hétérogènes à connectivité intermittente. MeDeHa permet d'interconnecter des réseaux infrastructures avec des réseaux ad-hoc, en utilisant plusieurs interfaces réseaux et il permet d'utiliser des protocoles de routage existants comme OLSR pour les réseaux MANETs. Nous évaluons MeDeHa par des simulations utilisant des traces de mobilités synthétiques et réelles, mais aussi en effectuant des expérimentations hybrides fonctionnant en partie sur simulateur et en partie sur des machines réelles. Troisièmement, nous proposons un mécanisme de nommage appelé HeNNA pour des réseaux hétérogènes à connectivité épisodique. Ce mécanisme permet de transmettre des messages aux noeuds indépendamment de leurs adresses IP et donc de leur localité. HeNNA est compatible avec le routage actuel de l'Internet. Enfin, nous avons intégré HeNNA dans le protocole MeDeHa afin d'illustrer le fonctionnement de l'ensemble de la pile de communication.

APA, Harvard, Vancouver, ISO, and other styles

37

Sellathurai, Mathini. "Turbo-blast : a novel technique for multi-transmit and multi-receive wireless communications /." *McMaster only, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Carneiro, Viana Aline. "Putting data delivery into context: Design and evaluation of adaptive networking support for successful communication in wireless self-organizing networks." Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2011. http://tel.archives-ouvertes.fr/tel-00653813.

Full text

Abstract:

Ce document est dédié à mes travaux de recherche développés au cours des six dernières années sur la conception et l'évaluation de systèmes de réseaux sans fil et est le résultat d'un certain nombre de collaborations. En particulier, mon objectif principal a été le soutien à la livraison fiable de données dans les réseaux sans fil auto-organisés. La question centrale, qui a guidée mes activités de recherche, est la suivante: "quels sont les services réseaux sous-jacents à la bonne conception de stratégies de communication sans fil dans les systèmes de réseaux auto-organisés (fixe ou mobile)?". Les réseaux auto-organisés (WSONs) ont des caractéristiques intrinsèques et, par conséquent, nécessitent des solutions particulières qui les distinguent des réseaux traditionnels basés sur des graphes. Les différents types de WSONs nécessitent des services adaptatifs ciblés pour faire face à leur nature (i.e., la mobilité, la limitation des ressources, le manque de fiabilité des communications sans fil,. . .) et pour trouver une adéquation entre leur fonctionnement et l'environnement. Influencée par de telles observations, mes activités de recherche ont été guidées par l'objectif principal de fournir au niveau du réseau un soutien à la livraison fiable de données dans les réseaux sans fil auto-organisés. Les axes de recherche, que j'ai développés avec mes collègues dans ce contexte, sont classés comme étant des services adaptifs "au niveau noeud" et "au niveau réseau" et se distinguent par le niveau auquel l'adaptation est considérée. Mes contributions, liées à la première catégorie de service, reposent sur les services de localisation et de découverte de voisinage. En raison de la limitation de page, ce manuscrit est, cependant, consacré à la recherche que j'ai menée autour des services adaptatifs au niveau du réseau. Par conséquent, il est structuré en trois chapitres principaux correspondants à trois classes de services réseaux : des services de gestion de la topologie, des services de gestion des données et des services de routage et d'acheminement. Ma première contribution concerne des services de gestion de la topologie, qui sont réalisés grâce à l'adaptation des noeuds - en imposant une hiérarchie dans le réseau via la clusterisation ou en supprimant des noeuds du graphe du réseau en les éteignant - et par la mobilité contrôlée - qui affecte à la fois la présence de noeuds et de liens, ainsi que la qualité des liens dans le graphe du réseau. Se basant sur l'adaptation de noeuds, le protocole SAND, les systèmes VINCOS et NetGeoS qui portent respectivement sur la conservation d'énergie et sur l'auto-structuration des réseaux de capteurs sans fil (WSN) ont été proposés. Ensuite, se basant sur la mobilité contrôlée, des propositions, liées à la conception de trajectoire de Hilbert et du protocole Cover, ont été présentées. Elles se concentrent sur le déploiement de solutions pour la couverture de zone avec des noeuds mobiles et ont été conçues pour surveiller périodiquement une zone géographique ou pour couvrir des noeuds de capteurs mobiles (cibles). Considérant les services de gestion de données, mes contributions se rapportent à la collecte des données - qui implique des solutions de distribution de données avec des objectifs liés a l'organisation - et la diffusion des données - où les flux de données sont dirigés vers le réseau. Pour cela, les protocoles DEEP et Supple ont été conçus pour les réseaux de capteurs sans fil, tandis que FairMix et VIP delegation se concentrent sur la diffusion d'information dans les réseaux sans fil sociaux. En particulier, afin d'améliorer la diffusion des données, FairMix et VIP delegation, exploitent les similarités des intérêts sociaux des personnes ou des groupes dans les réseaux fixes ou l'aspect social de leurs interactions sans fil dans les réseaux mobiles. Finalement, mes travaux sur les services adaptatifs d'acheminement attaquent la problèmatique de la connectivité opportuniste dans les réseaux sans fil tolérants aux délais. Dans ce contexte, les protocoles Seeker et GrAnt ont été conçus et utilisent respectivement l'histoire du contact entre les noeuds (les schémas de contact et de communication) et les propriétés des réseaux sociaux de noeuds afin de prédire les futures rencontres et de mieux ajuster les décisions de transfert. Au regard des nouvelles possibilités de communication et du changement dynamique observé au cours des dernières années dans les réseaux sans fil, mes activités de recherche se sont progressivement orientés des réseaux auto-organisés connectés vers les réseaux connectés par intermittence et opportunistes. De cette façon, mes perspectives de recherche future sont: (1) tirer profit des schémas de mobilité incontrôlée des dispositifs mobiles pervasifs pour améliorer les efforts de perception collaborative; (2) regarder plus en profondeur les techniques de génération de graphes sociaux à partir des traces décrivant les contacts entre les noeuds; (3) étudier quels sont les facteurs ayant un impact (positif ou négatif) sur le succès de la diffusion de l'information dans les réseaux sociaux mobiles, et (4) étudier la possibilité d'adapter le codage réseau à la diffusion d'information dans les réseaux sociaux mobiles.

APA, Harvard, Vancouver, ISO, and other styles

39

Hachfi, Fakhreddine Mohamed. "Future of asynchronous transfer mode networking." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2639.

Full text

Abstract:

The growth of Asynchronous Transfer Mode (ATM) was considered to be the ideal carrier of the high bandwidth applications like video on demand and multimedia e-learning. ATM emerged commercially in the beginning of the 1990's. It was designed to provide a different quality of service at a speed up 100 Gbps for both real time and non real time application. The turn of the 90's saw a variety of technologies being developed. This project analyzes these technologies, compares them to the Asynchronous Transfer Mode and assesses the future of ATM.

APA, Harvard, Vancouver, ISO, and other styles

40

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 text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

41

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

APA, Harvard, Vancouver, ISO, and other styles

42

Pereira, Flavio de Melo. "Modelagem, policiamento e escalonamento em redes Ethernet PON." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260703.

Full text

Abstract:

Orientadores: Dalton Soares Arantes, Nelson Luis Saldanha da Fonseca
Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-07T07:59:05Z (GMT). No. of bitstreams: 1 Pereira_FlaviodeMelo_D.pdf: 3025086 bytes, checksum: 2baf4e2cf83a53c366092610c84e1bdc (MD5) Previous issue date: 2006
Resumo: Neste trabalho, apresentamos uma nova proposta de modelagem, policiamento e escalonamento de tráfego em redes Ethernet com elementos ápticos passivos. Esta proposta visa ao suporte a garantias de desempenho individuais para os fluxos. Propomos um processo envelope denominado Processo de Chegada com Limitante Fracionário para a representação de tráfego multimidia com características fractais. Com base neste modelo, propomos o uso do algoritmo do balde furado para o policiamento do tráfego. Para o escalonamento de tráfego, propomos uma nova política em que a rede reserva uma parcela minima de banda para cada fluxo, sendo que os fluxos com demanda reprimida recebem uma parcela justa dos recursos ociosos. Para esta política, denominada Compartilhamento Proporcional com Reserva de Carga, estabelecemos as condições de estabilidade da rede e apresentamos expressões limitantes para a justiça e para o atraso dos fluxos
Abstract: We propose new framework for traffic modelling, policing and scheduling in Ethernet Passive Optical Networks. This framework aims at providing performance guarantees to individual flows in access networks. We propose a new envelope process called Fractional Bounded Arrival Process for selfsimilar 'multimedia traffic representation. The policing of such a kind of traffic by using the leaky bucket algorithm is also proposed. We present a novel discipline for scheduling the upstream flows in EPON networks. In such a discipline, which is calle4 Proportional Sharing with Load Reservation, each flow is guaranteed a minimum share of bandwidth and the unused bandwidth is fairly distributed among them in proportion to their own demands and priorities. We analyze the performance of the proposed discipline and provide fairness and delay bounds on a per-flow basis
Doutorado
Telecomunicações e Telemática
Doutor em Engenharia Elétrica

APA, Harvard, Vancouver, ISO, and other styles

43

Spencer, Logan Lemuella C. "Changing from the silo model to the horizontal layers model in public policy regulations : the implications and potential for the telecommunications industry /." Thesis, Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-11282005-192311/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Hlungulu, Bulumko. "Building a semantic web-based e-health component for a multipurpose communication centre." Thesis, University of Fort Hare, 2010. http://hdl.handle.net/10353/374.

Full text

Abstract:

Rural communities have limited access to health information which is made available on the internet. This is due to poor infrastructure (i.e., lack of clinics or Internet access) and that gives them problems in accessing information within the domain of health. The availability of Information and Communication Technologies (ICTs) in a rural community can provide the community with a number of beneficial solutions to their problems as they maximize the potential of knowledge sharing and delivery. This research seeks to make use of ICTs deployed in the community of Dwesa, in order to contribute to improving the health standards of the community. It seeks to accomplish this by carrying out an investigation and literature review with the aim of understanding health knowledge sharing dynamics in the context of marginalized communities. The knowledge acquired will then be used in the development and implementation of a semantic web-based e-Health portal as part of the Siyakhula Living Lab (SLL) project. This portal will share and deliver western medical knowledge, traditional knowledge and indigenous knowledge. This research seeks to make use of a combination of Free and/or Open Sources Software in developing the portal to make it affordable to the community.

APA, Harvard, Vancouver, ISO, and other styles

45

De, Vega Rodrigo Miguel. "Modeling future all-optical networks without buffering capabilities." Doctoral thesis, Universite Libre de Bruxelles, 2008. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210455.

Full text

Abstract:

In this thesis we provide a model for a bufferless optical burst switching (OBS) and an optical packet switching (OPS) network. The thesis is divided in three parts.

In the first part we introduce the basic functionality and structure of OBS and OPS networks. We identify the blocking probability as the main performance parameter of interest.

In the second part we study the statistical properties of the traffic that will likely run through these networks. We use for this purpose a set of traffic traces obtained from the Universidad Politécnica de Catalunya. Our conclusion is that traffic entering the optical domain in future OBS/OPS networks will be long-range dependent (LRD).

In the third part we present the model for bufferless OBS/OPS networks. This model takes into account the results from the second part of the thesis concerning the LRD nature of traffic. It also takes into account specific issues concerning the functionality of a typical bufferless packet-switching network. The resulting model presents scalability problems, so we propose an approximative method to compute the blocking probability from it. We empirically evaluate the accuracy of this method, as well as its scalability.
Doctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles

46

Shankar, Arun. "Optimal jammer placement to interdict wireless network services." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://handle.dtic.mil/100.2/ADA483583.

Full text

Abstract:

Thesis (M.S. in Operations Research and M.S. in Applied Mathematics)--Naval Postgraduate School, June 2008.
Thesis Advisor(s): Alderson, David ; Zhou, Hong. "June 2008." Description based on title screen as viewed on August 22, 2008. Includes bibliographical references (p. 39-40). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

47

Uppoor, Sandesh. "Understanding and Exploiting Mobility in Wireless Networks." Phd thesis, INSA de Lyon, 2013. http://tel.archives-ouvertes.fr/tel-00912521.

Full text

Abstract:

Le degré de pénétration du marché des appareils intelligents tels que les smartphones et les tablettes avec les technologies de communication embarquées comme le WiFi, 3G et LTE a explosé en moins d'une décennie. En complément de cette tendance technologique, les appli- cations des réseaux sociaux ont virtuellement connecté une grande partie de la population, en génèrant une demande de trafic de données croissant vers et depuis l'infrastructure de com- munication. Les communications pervasive ont aussi acquis une importance dans l'industrie automobile. L'émergence d' une gamme impressionnante d' appareils intelligents dans les véhicules permettant services tels que assistance au conducteur, infotainment, suivi à dis- tance du vehicule, et connectivité àux réseaux sociaux même en déplacement. La demande exponentielle de connectivité a encore défié les fournisseurs de services de télécommunications pour répondre aux attentes des utilisateurs du réseau à grande vitesse. L'objectif de cette thèse est de modéliser et comprendre la mobilité dynamique des utilisateurs à grande vitesse et leurs effets sur les architectures de réseau sans fil. Compte tenu de l' importance du développement de notre étude sur une représentation réal- iste de la mobilité des véhicules, nous étudions tout d'abord les approches les plus populaires pour la génération de trafic routier synthétique et discutons les caractéristiques des ensem- bles de données accessibles au public qui decrivent des mobilités véhiculaires. En utilisant l'information des déplacements de la population dans une région métropolitaine, les données du réseau routier détaillées et des modèles réalistes de conduite microscopiques, nous pro- posons un jeux de données de mobilité véhiculaire original qui redéfinit l'état de l'art et qui replie la circulation routière de facon realiste dans le temps et dans l'espace. Nous étudions ensuite l'impact des dynamiques de mobilité du point de vue de la couverture cellulaire en présence d'un déploiement réel des stations de base. En outre, en examinant les effets de la mobilité des véhicules sur les réseaux autonomes, nous voyons des possibilités pour les futurs paradigmes de réseaux hétérogènes. Motivés par l'évolution dynamique dans le temps de la mobilité des véhicules observée dans notre jeux de données, nous proposons également une approche en ligne pour prédire les flux de trafic macroscopiques. Nous analysons les paramètres affectant la prédiction de la mobilité en milieu urbain. Nous dévoilons quand et où la gestion des ressources réseau est plus crucial pour accueillir le trafic généré par les utilisateurs à bord. Ces études dévoilent des multiples opportunités de gestion intelligente des transports, soit pour construire de nouvelles routes, soit pour l'installation de bornes de recharge électriques, ou pour la conception de systèmes de feux de circulation intelligents, contribuant ainsi à la planification urbaine.

APA, Harvard, Vancouver, ISO, and other styles

48

Samarasekera, Andawattage Chaminda Janaka. "The Performance of Dual-Hop Decode-and-Forward Underlay Cognitive Relay Networks with Interference Power Constraints over Weibull Fading Channels." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3201.

Full text

Abstract:

With the rapid development and the increasing use of wireless devices, spectrum scarcity has become a problem. The higher frequencies have bad propagation characteristics and the lower frequencies have low data rates, therefore the radio spectrum that is available for efficient wireless transmission is a limited resource. One of the proposed solutions for this problem is cognitive relay networks (CRNs), where cognitive radio is combined with a cooperative spectrum sharing system to increase the spectrum utilization. In this thesis, the outage probability performances of underlay CRNs with interference power constraints from the primary network over Weibull fading channels have been investigated for three different scenarios. The maximum transmit power of the secondary network is governed by the maximum interference power that the primary network's receiver can tolerate. The first scenario is a cognitive dual-hop decode-and-forward (DF) relay network over independent non-identically distributed (i.n.i.d.) Weibull fading channels. In the second scenario, the CRN consists of a DF relay plus the direct link transmission with a selection combining receiver at the destination over i.n.i.d. Weibull fading channels. The third CRN considered has multiple DF relays where the best relay selection scheme is employed over independent identically distributed (i.i.d.) Weibull fading channels. The analytical results have been derived using the statistical characteristics of end-to-end signal-to-noise ratios, and have been verified by Monte-Carlo simulations.

APA, Harvard, Vancouver, ISO, and other styles

49

Mutooni, Philip Kyalo. "Telecommunications @ crossroads : the transition from a voice-centric to a data-centric communication network." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43453.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
Includes bibliographical references (leaves 62-64).
by Philip Kyalo Mutooni.
M.S.

APA, Harvard, Vancouver, ISO, and other styles

50

Barouni, Ala Eddine. "Drawing algorithms for survivable telecommunication networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/mq20965.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Communication Telecommunication Computer networks'

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