Yes / The web environment has been developing remarkably, and much work has been done towards improving web based notification systems, where servers act smartly by notifying and feeding clients with subscribed data. In this paper we have reviewed some of the problems with current solutions to real-time updates of multi user web applications; we introduce a new concept “adaptive polling” based on one AJAX technique “Polling” to reduce the high volume of redundant server connections with reasonable latency, we demonstrated a prototype implementation of the new concept which is then evaluated against the existing one; the positive results clearly indicated more efficiency in terms of client-server bandwidth.

In this thesis, one of the most important issues in the field of networks communication is tackled and addressed. This issue is represented by QoS, where the increasing demand on highquality applications together with the fast increase in the rates of Internet users have led to massive traffic being transmitted on the Internet. This thesis proposes new ideas to manage the flow of this huge traffic in a manner that contributes in improving the communication QoS. This can be achieved by replacing the conventional application-insensitive routing schemes by others which take into account the type of applications when making the routing decision. As a first contribution, the effect on the potential development in the quality of experience on the loading of Basra optical network has been investigated. Furthermore, the traffic due to each application was dealt with in different ways according to their delay and loss sensitivities. Load rate distributions over the various links due to the different applications were deployed to investigate the places of possible congestions in the network and the dominant applications that cause such congestions. In addition, OpenFlow and Optica Burst Switching (OBS) techniques were used to provide a wider range of network controllability and management. A centralised routing protocol that takes into account the available bandwidth, delay, and security as three important QoS parameters, when forwarding traffics of different types, was proposed and implemented using OMNeT++ networks simulator. As a novel idea, security has been incorporated in our QoS requirements by incorporating Oyster Optics Technology (OOT) to secure some of the optical links aiming to supply the network with some secure paths for those applications that have high privacy requirements. A particular type of traffic is to be routed according to the importance of these three QoS parameters for such a traffic type. The link utilisation, end to end delays and securities due to the different applications were recorded to prove the feasibility of our proposed system. In order to decrease the amount of traffic overhead, the same QoS constraints were implemented on a distributed Ant colony based routing. The traditional Ant routing protocol was improved by adopting the idea of Red-Green-Blue (RGB) pheromones routing to incorporate these QoS constraints. Improvements of 11% load balancing, and 9% security for private data was achieved compared to the conventional Ant routing techniques. In addition, this Ant based routing was utilised to propose an improved solution for the routing and wavelength assignment problem in the WDM optical computer networks.

Tiriamojo darbo objektas: Šilutės rajone esantys Žemaičių Naumiesčio, Ramučių, Šylių ir Degučių hidromazgai. Tiriamojo darbo tikslas: įvertinti pasirinktų panašių statybos metų Šilutės rajono hidromazgų gelžbetoninių šachtinių pralaidų įtekėjimo dalies konstrukcijų būklę bei palyginus su ankstesnių būklės tyrimų duomenimis įvertinti būklės kitimą. Tiriamojo darbo uždaviniai: 1. Atlikti literatūros apžvalgą apie hidromazgų būklės vertinimą bei pažaidų ir trūkumų atsiradimo priežastis; 2. nustatyti šachtinių pralaidų įtekėjimo, pratekėjimo bei ištekėjimo dalių konstrukcijų pažaidas bei jų atsiradimo priežastis; 3. įvertinti minėtų konstrukcijų būklę ir palyginti tyrimo duomenis su ankstesnių (2007 metų) tyrimų duomenimis; 4. nustatyti pokyčius atsiradusius naudojimo metu, bei pasiūlyti sprendimus aptiktų trūkumų šalinimui. Tiriamojo darbo metodika: literatūros apžvalgos skyrius rašomas referatyviai, analizuojant kitų mokslininkų atliktų tyrimų medžiagą apie hidromazgus. Tiriamojo darbo metodika: apžiūrimi ir įvertinami hidromazgai, atliekami natūriniai tyrimai, sutvarkomi gauti rezultatai (duomenys lentelėse), atliekama palyginamoji analizė, daromos išvados. Tiriamojo darbo rezultatai: ○ Literatūros analizėje buvo apžvelgtos bendros žinios apie žemių užtvankas ir vandens pralaidas, konstrukcijų ribiniai būvius, aplinkos poveikio klases, betono stiprio nustatymo metodus bei deformacijas ○ Tiriamojo darbo metodikos bei rezultatų dalyje apžvelgta natūrinių, laboratorinių... [toliau žr. visą tekstą] / Object of the research: Solid dams with reinforced concrete shaft bandwidth. Aim of the research: Aim of the research is to evaluate chosen similar year reinforced concrete shaft bandwidths and compare the results with older existing data. Objectives of the research: 1. Analysis of literature in mentioned works about infringements, it`s repair methods, and constructions. 2. Examine the infringements of reinforced concrete shaft`s with analysis of their appearance causes. 3. Evaluate mentioned parts of construction and compare the results with older existing data that exists. 4. Determine changes in conditions and offer best solutions for removing detected infringements. Research methods: Analysis of the literature are written referatively, making an analysis of other scientists research material of solid dams. Research of the dams are made using visual, natural statistical and laboratory methods. Calculated and obtained results are sorted and aranged.

<p> Multiple-subcarrier modulated (MSM) indoor wireless optical systems provide highspeed bandwidth-efficient communication as well as multi-access capability at low cost. A major drawback of such systems is the high average optical power requirement. To address this problem, trellis codes are designed for data transmission realizing an average optical power reduction as high as 0.95 dB. A simultaneous peak optical power reduction up to 0.44 dB is also possible by employing this technique.</p> <p> Moreover, the unregulated bandwidth available in wireless optical channels is exploited to reduce the average optical power in MSM wireless optical systems. Data transmission is confined in a bandwidth located near DC, while reserved carrier signals are designed outside the data bandwidth to reduce the average optical power. Distorted out-of-band signals at higher frequency are removed at the receiver by low-pass filtering and not used for detection. To design the out-of-band carrier amplitudes, both a standard optimization algorithm over the set of real numbers and an exhaustive search over discrete constellation are proposed. It is shown that significant average optical power reduction as high as 2.56 dB is achieved.</p> <p> It is assumed that a symbol-by-symbol bias is used in MSM wireless optical systems since it offers significant optical power reduction. The received DC bias level provides a degree of diversity and is used at the receiver to improve detection. It is also used to design trellis codes with better distance properties. In this manner, an additional average optical power reduction up to 0.50 dB is achieved with a simultaneous peak power reduction of 0.46 dB for MSM wireless optical systems.</p> / Thesis / Master of Applied Science (MASc)

Στη διατριβή εξετάζουμε προβλήματα που σχετίζονται με τη μετάδοση δεδομένων με υψηλές απαιτήσεις σε εύρος ζώνης και προτείνουμε λύσεις, αλγόριθμους, τεχνικές βελτίωσης της απόδοσης, και εφαρμογές που τις υλοποιούν. Για την περίπτωση του προβλήματος της μετάδοσης βίντεο κατ' απαίτηση (Video on Demand - VoD), εξετάζουμε το πρόβλημα της αποδοχής ή της απόρριψης αιτήσεων για μετάδοση ταινιών χωρίς να υπάρχει γνώση των μελλοντικών αιτήσεων. Παρουσιάζουμε έναν, άμεσης απόκρισης (online), πιθανοτικό αλγόριθμο χρονοπρογραμματισμού ταινιών που εκμεταλλεύεται την γνώση για την κατανομή των προτιμήσεων των αιτήσεων για ταινίες, και αποδεικνύουμε πως έχει ανταγωνιστικό λόγο (competitive ratio) που φράσσεται άνω από σταθερά. Επίσης, δείχνουμε πως η μέθοδος μας μπορεί να επεκταθεί σε ένα προσαρμοζόμενο αλγόριθμο που δεν γνωρίζει την κατανομή των προτιμήσεων. Επίσης, προτείνουμε έναν τρόπο να εφαρμόσουμε μια υπηρεσία βίντεο κατ' απαίτηση για ένα, βασισμένο στο πρωτόκολλο IP, δίκτυο, με περιορισμένο εύρος ζώνης. Στη συνέχεια, εξετάζουμε ένα σχήμα ελέγχου και διαχείρισης του εύρους ζώνης και παρουσιάζουμε ορισμένες μεθόδους προκειμένου να αυξήσουμε την αποδοτικότητα του συστήματος και την εκμετάλλευση του διαθέσιμου εύρους ζώνης (bandwidth). Εξετάζουμε διάφορες τεχνικές και παρουσιάζουμε πειραματικά αποτελέσματα για την βελτίωση της απόδοσης. Επίσης, σχεδιάζουμε και υλοποιούμε μια υπηρεσία διαχείρισης εύρους ζώνης (Managed Bandwidth Service -- MBS). Τέλος παρουσιάζουμε μια ενοποιημένη προσέγγιση για την μετάδοση υπερμεσικών/πολυμεσικών αντικειμένων, τα οποία παρουσιάζονται με βάση προκαθορισμένα σενάρια παρουσίασης (με χωροχρονικές αλληλοεξαρτήσεις μεταξύ των διάφορων μέσων). Τα υπερμεσικά αντικείμενα δομούνται σύμφωνα με μία γλώσσα σηματοδότησης, μέσω της οποίας διατηρούνται πληροφορίες για τις χωρικές και χρονικές συσχετίσεις. Επίσης, υλοποιούμε ένα τέτοιο σύστημα μετάδοσης, που εφαρμόζουμε για εκπαίδευση από απόσταση. / In this thesis we investigate problems related to the transmission of data with high demands in terms of bandwidth, and we propose solutions, algorithms, techniques to increase performance, and applications that use them. For the case of the online video on demand problem, we investigate the problem of having to accept or reject a request for a movie without knowing the future requests. We present an online movie-scheduling scheme that exploits the knowledge of the distribution of the preference of requests for movies, and is shown to have a competitive ratio bounded above by a constant. We extend our approach by presenting an adaptive randomized scheduler which is not aware of the movie popularities. In the sequel we propose a way to implement a video on demand service over a limited bandwidth/best effort Internet based network. Ιn the sequel, we consider a bandwidth control scheme, and we present some methods to increase the efficiency of the system and the utilisation of the available bandwidth. We consider different techniques and we present experimental results for the increased performance. We, also, design and implement a Managed Bandwidth Service (MBS) . Finally, we present a unified approach for delivering hypermedia/multimedia objects, that are to be presented according to predefined scenarios (with spatial and temporal relationships between the various media). The hypermedia documents are structured using a hypermedia markup language that keeps information of the spatiotemporal relationships among document's media components. We, also, implement such a multimedia transmission system, and apply it to distance learning.

The continuous advancement in wireless communications technology demands new approaches to improving the capacity of existing radio links. The high data throughput required can be achieved by the complete utilization of space, time and polarization diversities inherent in any propagation environment. Among the different propagation scenarios, the indoor channels represent a particularly challenging problem given the number and complexity of interactions between the transmitted signal and the environment. This dissertation explores the interrelation between propagation physics and space-time-polarization diversity based on a novel high resolution channel sounding and reconstruction technique. First, a method to reconstruct the indoor complex channel response based on a limited set of samples and the elimination of the interference using deconvolution techniques is presented. Then, the results for the joint angle-of-arrival, delay characterization and depolarization of electromagnetic waves are presented. Finally, a novel approach to using depolarized multipath signals to boost the receiver signal-to-noise performance is presented. The current study shows that full utilization of the diversities of channel novel wireless systems can be proposed with significant improvement in capacity.

The continuous advancement in wireless communications technology demands new approaches to improving the capacity of existing radio links. The high data throughput required can be achieved by the complete utilization of space, time and polarization diversities inherent in any propagation environment. Among the different propagation scenarios, the indoor channels represent a particularly challenging problem given the number and complexity of interactions between the transmitted signal and the environment. This dissertation explores the interrelation between propagation physics and space-time-polarization diversity based on a novel high resolution channel sounding and reconstruction technique. First, a method to reconstruct the indoor complex channel response based on a limited set of samples and the elimination of the interference using deconvolution techniques is presented. Then, the results for the joint angle-of-arrival, delay characterization and depolarization of electromagnetic waves are presented. Finally, a novel approach to using depolarized multipath signals to boost the receiver signal-to-noise performance is presented. The current study shows that full utilization of the diversities of channel novel wireless systems can be proposed with significant improvement in capacity.

This thesis deals with the problem of code design in the setting of distributed storage systems consisting of multiple storage nodes, storing many different data les. A primary goal in such systems is the efficient repair of a failed node. Regenerating codes and codes with locality are two classes of coding schemes that have recently been proposed in literature to address this goal. While regenerating codes aim to minimize the amount of data-download needed to carry out node repair, codes with locality seek to minimize the number of nodes accessed during node repair. Our focus here is on linear codes with locality, which is a concept originally introduced by Gopalan et al. in the context of recovering from a single node failure. A code-symbol of a linear code C is said to have locality r, if it can be recovered via a linear combination of r other code-symbols of C. The code C is said to have (i) information-symbol locality r, if all of its message symbols have locality r, and (ii) all-symbol locality r, if all the code-symbols have locality r. We make the following three contributions to the area of codes with locality. Firstly, we extend the notion of locality, in two directions, so as to permit local recovery even in the presence of multiple node failures. In the first direction, we consider codes with \local error correction" in which a code-symbol is protected by a local-error-correcting code having local-minimum-distance 3, and thus allowing local recovery of the code-symbol even in the presence of 2 other code-symbol erasures. In the second direction, we study codes with all-symbol locality that can recover from two erasures via a sequence of two local, parity-check computations. When restricted to the case of all-symbol locality and two erasures, the second approach allows, in general, for design of codes having larger minimum distance than what is possible via the rst approach. Under both approaches, by studying the generalized Hamming weights of the dual codes, we derive tight upper bounds on their respective minimum distances. Optimal code constructions are identified under both approaches, for a class of code parameters. A few interesting corollaries result from this part of our work. Firstly, we obtain a new upper bound on the minimum distance of concatenated codes and secondly, we show how it is always possible to construct the best-possible code (having largest minimum distance) of a given dimension when the code's parity check matrix is partially specified. In a third corollary, we obtain a new upper bound for the minimum distance of codes with all-symbol locality in the single erasure case. Secondly, we introduce the notion of codes with local regeneration that seek to combine the advantages of both codes with locality as well as regenerating codes. These are vector-alphabet analogues of codes with local error correction in which the local codes themselves are regenerating codes. An upper bound on the minimum distance is derived when the constituent local codes have a certain uniform rank accumulation (URA) property. This property is possessed by both the minimum storage regenerating (MSR) and the minimum bandwidth regenerating (MBR) codes. We provide several optimal constructions of codes with local regeneration, where the local codes are either the MSR or the MBR codes. The discussion here is also extended to the case of general vector-linear codes with locality, in which the local codes do not necessarily have the URA property. Finally, we evaluate the efficacy of two specific coding solutions, both possessing an inherent double replication of data, in a practical distributed storage setting known as Hadoop. Hadoop is an open-source platform dealing with distributed storage of data in which the primary aim is to perform distributed computation on the stored data via a paradigm known as Map Reduce. Our evaluation shows that while these codes have efficient repair properties, their vector-alphabet-nature can negatively a affect Map Reduce performance, if they are implemented under the current Hadoop architecture. Specifically, we see that under the current architecture, the choice of number processor cores per node and Map-task scheduling algorithm play a major role in determining their performance. The performance evaluation is carried out via a combination of simulations and actual experiments in Hadoop clusters. As a remedy to the problem, we also pro-pose a modified architecture in which one allows erasure coding across blocks belonging to different les. Under the modified architecture, the new coding solutions will not suffer from any Map Reduce performance-loss as seen in the original architecture, while retaining all of their desired repair properties

In this thesis, three problems have been considered and new coding schemes have been devised for each of them. The first is related to distributed function computation, the second to coding for distributed storage and the final problem is based on locally correctable codes. A common theme of the first two problems considered is distributed computation. The first problem is motivated by the problem of distributed function computation considered by Korner and Marton, where the goal is to compute XOR of two binary sources at the receiver. It has been shown that linear encoders give better sum rates for some source distributions as compared to the usual Slepian-Wolf scheme. We generalize this distributed function computation setting to the case of more than two sources and the receiver is interested in computing multiple linear combinations of the sources. Consider `m' random variables each of which takes values from a finite field and are associated with a certain joint probability distribution. The receiver is interested in the lossless computation of `s' linear combinations of the m random variables. By considering the set of all linear combinations of m random variables as a vector space V , this problem can be interpreted as a subspace-computation problem. For this problem, we develop three increasingly refined approaches, all based on linear encoders. The first two approaches which are termed as common code approach and selected subspace approach, use a common matrix to encode all the sources. In the common code approach, the desired subspace W is computed at the receiver, whereas in the selected subspace approach, possibly a larger subspace U which contains the desired subspace is computed. The larger subspace U which gives the minimum sum rate itself is based on a decomposition of vector space V into a chain of subspaces. The chain of subspaces is determined by the joint probability distribution of m random variables and a notion of normalized measure of entropy. The third approach is a nested code approach, where all the encoding matrices are nested and the same subspace U which is identified in the selected subspace approach is computed. We characterize the sum rates under all the three approaches. The sum rate under nested code approach is no larger than both selected subspace approach and Slepian-Wolf approach. For a large class of joint distributions and subspaces W , the nested code scheme is shown to improve upon Slepian-Wolf scheme. Additionally, a class of source distributions and subspaces are identified, for which the nested code approach is sum-rate optimal. In the second problem, we consider a distributed storage network, where data is stored across nodes in a network which are failure-prone. The goal is to store data reliably and efficiently. For a required level of reliability, it is of interest to minimise storage overhead and also of interest to perform node repair efficiently. Conventionally replication and maximum distance separable (MDS) codes are employed in such systems. Though replication is very efficient in terms of node repair, the storage overhead is high. MDS codes have low storage overhead but even the repair of a single failed node requires contacting a large number of nodes and downloading all their data. We consider two coding solutions that have recently been proposed, which enable efficient node repair in case of single node failure. The first solution called regenerating codes seeks to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. We extend these results in two directions. In the first one, we introduce the notion of codes with locality where the local codes have minimum distance more than 2 and hence can recover a code symbol locally even in the presence of multiple erasures. These codes are termed as codes with local erasure correction. We say that a code has information locality if there exists a set of message symbols, each of which is covered by local codes. A code is said to have all-symbol locality if all the code symbols are covered by local codes. An upper bound on the minimum distance of codes with information locality is presented and codes that are optimal with respect to this bound are constructed. We make a connection between codes with local erasure correction and concatenated codes. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. There are two well known classes of regenerating codes known as minimum storage regenerating (MSR) codes and minimum bandwidth regenerating (MBR) codes. We derive two upper bounds on the minimum distance of vector-alphabet codes with locality, one for the case when the local codes are MSR codes and the second for the case when the local codes are MBR codes. We also provide several optimal constructions of both classes of codes which achieve their respective minimum distance bounds with equality. The third problem deals with locally correctable codes. A block code of length `n' is said to be locally correctable, if there exists a randomized algorithm such that any one of the coordinates of the codeword can be recovered by querying at most `r' coordinates, even in presence of some fraction of errors. We study the local correctability of linear codes whose duals contain 4-designs. We also derive a bound relating `r' and fraction of errors that can be tolerated, when each instance of the randomized algorithm is `t'-error correcting instead of simple parity computation.