We consider a class of queueing systems that consist of server pools in parallel and multiple customer classes. Customer service times are assumed to be exponentially distributed. We study the asymptotic behavior of these queueing systems in a heavy traffic regime that is known as the Halfin and Whitt many-server asymptotic regime. Our main contribution is a general framework for establishing state space collapse results in the Halfin and Whitt many-server asymptotic regime for parallel server systems having multiple customer classes. In our work, state space collapse refers to a decrease in the dimension of the processes tracking the number of customers in each class waiting for service and the number of customers in each class being served by various server pools. We define and introduce a state space collapse function, which governs the exact details of the state space collapse. Our methodology is similar in spirit to that in Bramson (1998); however, Bramson studies an asymptotic regime in which the number of servers is fixed and Bramson does not require a state space collapse function. We illustrate the applications of our results in three different parallel server systems. The first system is a distributed parallel server system under the minimum-expected-delay faster-server-first (MED-FSF) or minimumexpected- delay load-balancing (MED-LB) policies. We prove that the MED-FSF policy minimizes the stationary distribution of total number of customers in the system. However, under the MED-FSF policy all the servers in our distributed system except those with the lowest service rate experience 100% utilization but under the MED-LB policy, on the other hand, the utilizations of all the server pools are equal. The second system we consider is known as the N-model. We show that when the service times only depend on the server pool providing service a static priority rule is asymptotically optimal. Finally, we study two results conjectured in the literature for V-systems. We show for all of these systems that the conditions on the hydrodynamic limits can easily be checked using the standard tools that have been developed in the literature to analyze fluid models.

A Web-server farm is a specialized facility designed specifically for housing Web servers catering to one or more Internet facing Web sites. In this dissertation, stochastic dynamic programming technique is used to obtain the optimal admission control policy with different classes of customers, and stochastic uid- ow models are used to compute the performance measures in the network. The two types of network traffic considered in this research are streaming (guaranteed bandwidth per connection) and elastic (shares available bandwidth equally among connections). We first obtain the optimal admission control policy using stochastic dynamic programming, in which, based on the number of requests of each type being served, a decision is made whether to allow or deny service to an incoming request. In this subproblem, we consider a xed bandwidth capacity server, which allocates the requested bandwidth to the streaming requests and divides all of the remaining bandwidth equally among all of the elastic requests. The performance metric of interest in this case will be the blocking probability of streaming traffic, which will be computed in order to be able to provide Quality of Service (QoS) guarantees. Next, we obtain bounds on the expected waiting time in the system for elastic requests that enter the system. This will be done at the server level in such a way that the total available bandwidth for the requests is constant. Trace data will be converted to an ON-OFF source and fluid- flow models will be used for this analysis. The results are compared with both the mean waiting time obtained by simulating real data, and the expected waiting time obtained using traditional queueing models. Finally, we consider the network of servers and routers within the Web farm where data from servers flows and merges before getting transmitted to the requesting users via the Internet. We compute the waiting time of the elastic requests at intermediate and edge nodes by obtaining the distribution of the out ow of the upstream node. This out ow distribution is obtained by using a methodology based on minimizing the deviations from the constituent in flows. This analysis also helps us to compute waiting times at different bandwidth capacities, and hence obtain a suitable bandwidth to promise or satisfy the QoS guarantees. This research helps in obtaining performance measures for different traffic classes at a Web-server farm so as to be able to promise or provide QoS guarantees; while at the same time helping in utilizing the resources of the server farms efficiently, thereby reducing the operational costs and increasing energy savings.

We study two classes of stochastic systems, the limited processor sharing system and the multi-server system. They share the common feature that multiple jobs/customers are being processed simultaneously, which makes the study of them intrinsically difficult. In the limited processor sharing system, a limited number of jobs can equally share a single server, and the excess ones wait in a first-in-first-out buffer. The model is mainly motivated by computer related applications, such as database servers and packet transmission over the Internet. This model is studied in the first part of the thesis. The multi-server queue is mainly motivated by call centers, where each customer is handled by an agent. The number of customers being served at any time is limited by number of agents employed. Customers who can not be served upon arrival wait in a first-in-first-out buffer. This model is studied in the second part of the thesis.

<p>Rapporten presenterar skapandet av en produktkonfigurator och flera förslag på hur den kan förbättras. Uppdraget gavs av System Andersson till två studenter på Jönköpings Tekniska Högskola som genomförde detta som sitt examensarbete.</p><p>Rapporten diskuterar möjliga lösningar på en produktkonfigurator och visar ett resultat som utgår från dessa lösningar. Produktkonfiguratorn i rapporten består av två delar.</p><p>Dels konfigurationsdelen som hjälper användaren att skapa nya produkter utifrån valda artiklar. Artiklarna sorteras automatiskt av produktkonfiguratorn så att endast kompatibla artiklar kan sättas ihop. Detta sker med ett ”drag and drop” gränssnitt.</p><p>Dessutom innehåller produktkonfiguratorn en kompatibilitetsdel, vars uppgift är att underlätta vid definierandet av kompatibilitet mellan artiklar. Detta kan göras löpande under tiden en produkt konfigureras om så önskas. Användaren kan välja på två eller flera artiklar som ska vara kompatibla med varandra, eller hela kategorier.</p><p>Sist i rapporten diskuteras de val som gjorts under arbetets gång och möjliga förbättringar som kan göras på produktkonfiguratorn.</p>

In Deutschland stehen vor allem die Universitätsbibliotheken zu Beginn des 21. Jahrhunderts vor der großen Herausforderung, die sich rasch vollziehenden Veränderungen und die sich bietenden technischen Möglichkeiten zu erkennen und als Chance zu begreifen, sich vom Image angestaubter Archivieranstalten zu lösen und sich nach und nach zu ”universitären Informations- und Servicezentren” zu entwickeln. Auch für die Sächsische Landesbibliothek - Staats- und Universitätsbibliothek (SLUB - im Folgenden nur noch SLUB genannt) trifft diese Standortbestimmung zu. Hier machte man sich etwa ab dem Jahr 1999 verstärkt darüber Gedanken, wie man in Zukunft Hochschulschriften digital verwalten und archivieren könnte.

Geschäftsanwendungen wie Supply Chain Management (SCM) oder Customer Relationship Management (CRM) werden repliziert, um eine hohe Skalierbarkeit und schnellen lokalen Zugriff zu erreichen. Die Geschäftsobjekte als Datencontainer der Anwendungen müssen infolge von Änderungen synchronisiert werden. Diese Arbeit leistet einen Beitrag zur Effizienzsteigerung des Synchronisationsprozesses durch die Reduzierung der Anzahl der Synchronisationsnachrichten sowie der zu übertragenden Datenmenge - auch unter Berücksichtigung des entstehenden Mehraufwands durch zusätzliche Verarbeitungsprozesse. / Business applications such as supply chain management (SCM) or customer relationship management (CRM) are replicated in order to reach high scalability and fast local access. The business objects representing the data containers have to be synchronized to stay consistent across the application servers. This thesis provides a contribution to reach more efficiency during the synchronization process by reducing the amount of synchronization messages and the amount of data to be transmitted. The additional effort due to further processing steps is taken into account via a proper cost model.

<p><p>Context represents any information regarding the situation of entities, being these a person, place or object that is considered relevant to the interaction between a user and an application.</p><p><p>The results obtained permits an user to save context information attached to a picture in a database, as well as retrieve pictures from that database and show it in a web interface with its context information associated. The web interface also allows the user to perform searches by using different criteria, so only the pictures that matches with that criteria will be shown.</p></p></p> / Final Degree Project - Thesis

In this dissertation, we design and analyze five authentication protocols that answer to the a firmative the following fi ve questions associated with the authentication functions in computer networks. 1. The transport protocol HTTP is intended to be lightweight. In particular, the execution of applications on top of HTTP is intended to be relatively inexpensive and to take full advantage of the middle boxes in the Internet. To achieve this goal, HTTP does not provide any security guarantees, including any authentication of a server by its clients. This situation raises the following question. Is it possible to design a version of HTTP that is still lightweight and yet provides some security guarantees including the authentication of servers by their clients? 2. The authentication protocol in HTTPS, called TLS, allows a client to authenti- cate the server with which it is communicating. Unfortunately, this protocol is known to be vulnerable to human mistakes and Phishing attacks and Pharm- ing attacks. Is it possible to design a version of TLS that can successfully defend against human mistakes and Phishing attacks and Pharming attacks? 3. In both HTTP and HTTPS, a server can authenticate a client, with which it is communicating, using a standard password protocol. However, standard password protocols are vulnerable to the mistake of a client that uses the same password with multiple servers and to Phishing and Pharming attacks. Is it possible to design a password protocol that is resilient to client mistakes (of using the same password with multiple servers) and to Phishing and Pharming attacks? 4. Each sensor in a sensor network needs to store n - 1 symmetric keys for secure communication if the sensor network has n sensor nodes. The storage is constrained in the sensor network and the earlier approaches succeeded to reduce the number of keys, but failed to achieve secure communications in the face of eavesdropping, impersonation, and collusion. Is it possible to design a secure keying protocol for sensor networks, which is e fficient in terms of computation and storage? 5. Most authentication protocols, where one user authenticates a second user, are based on the assumption that the second user has an "identity", i.e. has a name that is (1) fi xed for a relatively long time, (2) unique, and (3) ap- proved by a central authority. Unfortunately, the adoption of user identities in a network does create some security holes in that network, most notably anonymity loss, identity theft, and misplaced trust. This situation raises the following question. Is it possible to design an authentication protocol where the protocol users have no identities? / text

Τα τελευταία χρόνια η ανάπτυξη των Ανοιχτών Συστημάτων Υπερκειμένου (ΑΣΥ) είναι ευρεία με την προσθήκη νέων πεδίων και αρχιτεκτονικών που βοηθούν στην καλύτερη οργάνωση της πληροφορίας με στόχο την εξομοίωση και επαύξηση της σκέψης του ανθρώπου στο συγκεκριμένο τομέα. Ωστόσο, η χρησιμοποίηση των ΑΣΥ από το ευρύ κοινό είναι πολύ μικρή διότι η κατηγορία των συστημάτων αυτών δεν έχει καταφέρει μέχρι στιγμής να γίνει γνωστή για τα πλεονεκτήματα που προσφέρει όσον αφορά τη διαχείριση, τη δόμηση και τη σύνδεση της πληροφορίας. Επίσης, η κοινωνία των ΑΣΥ δεν έχει ακόμα παγιώσει κοινές μεθοδολογίες και υποδομές που θα βοηθούσαν κάθε developer να εισάγει εύκολα στην εφαρμογή του λειτουργίες υπερκειμένου. Στην παρούσα Μεταπτυχιακή εργασία γίνεται μια προσπάθεια για την ανάπτυξη μιας υποδομής που βοηθά τον developer στην εύκολη ενσωμάτωση υπηρεσιών υπερκειμένου στην εφαρμογή του. Έτσι, μελετήθηκε, σχεδιάστηκε και υλοποιήθηκε ο τρόπος με τον οποίο μπορεί να γίνει ανακάλυψη υπηρεσιών (service discovery) στα σύγχρονα Ανοικτά Συστήματα Υπερκειμένου βασισμένα σε Ψηφίδες (ΑΣΥ-ΒΨ). Στα πλαίσια της αρχιτεκτονικής της ανακάλυψης υπηρεσιών των ΑΣΥ-ΒΨ μελετήθηκαν οι αρχιτεκτονικές πελάτη/εξυπηρετητή και peer-to-peer. Το άμεσο αποτέλεσμα της συγκεκριμένης προσπάθειας είναι η παροχή στον developer εργαλείου (μηχανισμού) που τον βοηθάει στην αναζήτηση και επισκόπηση υπηρεσιών υπερκειμένου και στην εύκολη επιλογή κατάλληλης υπηρεσίας (με βάση τα χαρακτηριστικά της). Το μελλοντικό αποτέλεσμα της συγκεκριμένης προσπάθειας θα είναι η επίτευξη της γνωστοποίησης των υπηρεσιών που προσφέρουν τα ΑΣΥ-ΒΨ σε όλο και μεγαλύτερο σύνολο από developers με αποτέλεσμα όλο και περισσότερες εφαρμογές να χρησιμοποιούν τις υπηρεσίες των ΑΣΥ-ΒΨ. / In the last few years, Component-Based Open Hypermedia Systems (CB-OHS) have been widely developed with the addition of new hypermedia domains and architectural models for better data organization with main aim to equate and increase the human thinking in this particular field. However, OHS aren’t widely used because they haven’t managed, until this time, to become popular for the advantages that they offer on management, structuring and data linking. Additionally, the OHS community hasn’t yet effectively targeted in the establishment of common methodologies and frameworks that could help any developer to insert hypermedia functionality into his applications. In this Master’s thesis an effort is being made to develop an infrastructure which will help any developer to integrate easily, in his application, hypermedia services. Taking into consideration the above issues, the application of Service Discovery functionality to Component-Based Open Hypermedia Systems was investigated, analyzed and developed, in the context of this project. Trying to specify the architecture that should better fit in this case, two different types of architecture were examined; the client/server and the peer-to-peer architecture. The direct objective of this study is to provide developers with a tool that will help them to search easily and effectively, review and finally choose the proper structure service for them based on each service’s characteristics. A long-term objective of the current research is to make CB-OHS services widely known to developer communities in order to broaden the utilization of the above mentioned services by more and more applications.

Atliekant duomenų bazės projektavimo darbus visuomet yra svarbu žinoti ar pasirinkta sistema veiks taip kaip tikimasi. Šio darbo tikslas sukurti SQL serverių testavimo įrankį, kuris padės renkantis vienokią ar kitokią sistemą. Darbe išanalizuoti panašūs projektai, įvertinti tų projektų privalumai bei trūkumai. / Making a data base project always important to know - do the system will work properly. The main point of this job is to create the test system of SQL servers (or DBMS – Data Bases Management System) which will help to chose that or either machine configuration. In this work were analyzed the similar projects, appraised the necessity and imperfections of this projects.