This Master’s Thesis concerns the technical problems and solutions in the Telia Mobile’s Golden Gate Architecture. The Golden Gate project will bridge service control from the IPnetwork to the circuit switched network. Connecting the different users of PSTN, GSM, W-LAN, and GPRS networks together will require solutions to many problems. Most of the problems have already been defined by Telia. Our task is to evaluate two parts of the Golden Gate architecture, namely the Interconnect- and Service Provider roles. The Interconnector provider connects networks of different technical standards and enables other network operators to reach Service Providers on the Internet or other IP-based networks. The role concerns mainly mapping between SS7 signaling and the Session Initiation Protocol (SIP), charging and billing. Via the Interconnector the Service Provider can connect different services to any network. We will describe the SIP-protocol in detail and then we will look into the mapping between SS7 and SIP. We will also propose a charging model. It is important to have a solution that supports roaming between the different networks, we will evaluate such a solution. Most of the protocols (INAP, ENUM, MAP and ISUP) that are involved in the Golden Gate architecture are not completely defined. There are many Internet Drafts that discuss the possible functionality of the protocols and the interworking between them. Many different Internet-workgroups are working with these issues. No one seems to have the right answers for the interconnection between the protocols involved. Since the IP-telephony will probably replace today’s telephony systems, it is important to ensure a suitable Quality of Service (QoS), security that guarantees privacy, and a fair billing function. These are the three major problems in the IP-telephony world. IP-Telephony or Voice over IP (VoIP) has been on the market for a long time, there are many 'free IP-call sites' that use VoIP, but the quality of the calls are not yet good enough to replace traditional telephony. Our task here is to make sure that the necessary quality of service is provided, and a reliable charging model is used.

Due to its ubiquitous availability, Short Message Service (SMS), first introduced in the 1980s, became not only the most popular way of communication, but also stimulated the development of SMS-based value added services. This application-to-person traffic is delivered to end users through SMS aggregators who provide the link between service providers and mobile carriers. In order to perform optimal traffic routing, the aggregators need to estimate the quality of each potential international route to the specified destination. The evaluation criteria include end-to-end delivery time, as well as correct verification of delivered data. This thesis suggests a method of quality of service (QoS) assessment for international SMS service which combines two types of tests, end-to-end delay measurements and various verification tests. A prototype of the testing system for international SMS service was developed to generate SMS traffic, collect and analyze results, and evaluate the experienced QoS of the SMS route used in accordance with the proposed approach. As a part of end-to- end delay measurement tests, SMS traffic was sent to Singtel network in Singapore along two routes. The verification tests were executed via different routes to two mobile networks: Singtel and Tele2 (Sweden). The results of the performed measurements determined the route with the highest QoS, i.e. the one with bigger bottleneck bandwidth and lower data loss rate. The prototype of the SMS testing system can be used by SMS aggregators to verify delivery of a SMS message, check the integrity of the message, figure out interconnection type of the route supplier with the destination carrier and to identify the presence of load balancers in the path. The prototype also makes it possible to compare end-to-end delay times of several routes and compute bottleneck values for each of the tested routes.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第18623号 / 情博第547号 / 新制||情||97(附属図書館) / 31523 / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 守倉 正博, 教授 高橋 達郎, 教授 梅野 健 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

We study techniques to enforce and provision differentiated service levels in Computational Grid systems. The Grid offers simplified provisioning of peak-capacity for applications with computational requirements beyond local machines and clusters, by sharing resources across organizational boundaries. Current systems have focussed on access control, i.e., managing who is allowed to run applications on remote sites. Very little work has been done on providing differentiated service levels for those applications that are admitted. This leads to a number of problems when scheduling jobs in a fair and efficient way. For example, users with a large number of long-running jobs could starve out others, both intentionally and non-intentionally. We investigate the requirements of High Performance Computing (HPC) applications that run in academic Grid systems, and propose two models of service-level management. Our first model is based on global real-time quota enforcement, where projects are granted resource quota, such as CPU hours, across the Grid by a centralized allocation authority. We implement the SweGrid Accounting System to enforce quota allocated by the Swedish National Allocations Committee in the SweGrid production Grid, which connects six Swedish HPC centers. A flexible authorization policy framework allows provisioning and enforcement of two different service levels across the SweGrid clusters; high-priority and low-priority jobs. As a solution to more fine-grained control over service levels we propose and implement a Grid Market system, using a market-based resource allocator called Tycoon. The conclusion of our research is that although the Grid accounting solution offers better service level enforcement support than state-of-the-art production Grid systems, it turned out to be complex to set the resource price and other policies manually, while ensuring fairness and efficiency of the system. Our Grid Market on the other hand sets the price according to the dynamic demand, and it is further incentive compatible, in that the overall system state remains healthy even in the presence of strategic users. / QC 20101116

Since the coronavirus pandemic in 2019, millions of people started to use online streaming and entertainment services during the lockdown. Streaming solutions such as OTT and IPTV has grown and boosted the live streaming and non-linear streaming revenue, by using new technologies and innovation such as Artificial Intelligence (AI) to improve the video quality, performance, and security of video streaming services. However, QoS and QoE guarantee and traffic management is still a challenge to many multimedia services and systems provided over the Internet. In this paper the analysis of a proposed user-friendly design will be discussed, describing how it can improve the management and troubleshooting experience. And in what way an AI knowledge-based agent can be used to improve and support the operators daily tasks and challenges. With an usability test, the results showed that the combination of an user-centered interface and AI-technology can improve the productivity in video troubleshooting and prevention of common issues. The user-centered design focuses on the user’s goal and needs, using interactive products to help the user achieve their goal. And the AI would assist the operators to identifying network congestion, stream quality, and much more.

This thesis describes an architecture for policy-based quality of service (QoS) for fixed broadband wireless systems. An implementation of the proposed architecture for the Local Multipoint Distribution Service (LMDS) wireless network in Blacksburg, Virginia is described in detail. The focus of the research work was to enable simpler management of the LMDS system and to design and enable network QoS. The thesis examines various means to provide QoS in the network. It highlights issues related to enabling QoS in the VT-LMDS network, like prioritized access, resource management, service differentiation, and lack of predictability in network performance. Quality of service assumes a definition based on the context and application of interest. This research focuses on enabling service differentiation and intelligent resource management based on network conditions and link utilization. A software application that serves as a model of the described architecture was developed using the C++ programming language. The tool uses the Simple Network Management Protocol (SNMP) for the network management operations. The design, implementation issues and the advantages and shortcomings of the tool are outlined and a short primer on the use of the tool is provided. Finally, possibilities for future work in this area especially towards enabling the tool to work with other vendor-specific LMDS systems and non-LMDS fixed broadband wireless systems are examined and the issues in implementing one such system are described. / Master of Science

Quality of Service (QoS) routing considered as one of the major components of the QoS framework in communication networks. The concept of QoS routing has emerged from the fact that routers direct traffic from source to destination, depending on data types, network constraints and requirements to achieve network performance efficiency. It has been introduced to administer, monitor and improve the performance of computer networks. Many QoS routing algorithms are used to maximize network performance by balancing traffic distributed over multiple paths. Its major components include bandwidth, delay, jitter, cost, and loss probability in order to measure the end users¿ requirements, optimize network resource usage and balance traffic load. The majority of existing QoS algorithms require the maintenance of the global network state information and use it to make routing decisions. The global QoS network state needs to be exchanged periodically among routers since the efficiency of a routing algorithm depends on the accuracy of link-state information. However, most of QoS routing algorithms suffer from scalability problems, because of the high communication overhead and the high computation effort associated with marinating and distributing the global state information to each node in the network.The goal of this thesis is to contribute to enhancing the scalability of QoS routing algorithms. Motivated by this, the thesis is focused on localized QoS routing that is proposed to achieve QoS guarantees and overcome the problems of using global network state information such as high communication overhead caused by frequent state information updates, inaccuracy of link-state information for large QoS state update intervals and the route oscillating due to the view of state information. Using such an approach, the source node makes its own routing decisions based on the information that is local to each node in the path. Localized QoS routing does not need the global network state to be exchanged among network nodes because it infers the network state and avoids all the problems associated with it, like high communication and processing overheads and oscillating behaviour. In localized QoS routing each source node is required to first determine a set of candidate paths to each possible destination. In this thesis we have developed localized QoS routing algorithms that select a path based on its quality to satisfy the connection requirements. In the first part of the thesis a localized routing algorithm has been developed that relies on the average residual bandwidth that each path can support to make routing decisions. In the second part of the thesis, we have developed a localized delay-based QoS routing (DBR) algorithm which relies on a delay constraint that each path satisfies to make routing decisions. We also modify credit-based routing (CBR) so that this uses delay instead of bandwidth. Finally, we have developed a localized QoS routing algorithm for routing in two levels of a hierarchal network and this relies on residual bandwidth to make routing decisions in a hierarchical network like the internet. We have compared the performance of the proposed localized routing algorithms with other localized and global QoS routing algorithms under different ranges of workloads, system parameters and network topologies. Simulation results have indicated that the proposed algorithms indeed outperform algorithms that use the basics of schemes that currently operate on the internet, even for a small update interval of link state. The proposed algorithms have also reduced the routing overhead significantly and utilize network resources efficiently.

The Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable in certain situations needing high bandwidth provisioning, low loss and streaming of multimedia applications. New emerging multimedia applications are requiring new levels of quality of services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS routing can significantly improve the network performance due to its awareness of the network QoS state. Most QoS routing algorithms require maintenance of the global network¿s state information to make routing decisions. Global state information needs to be periodically exchanged among routers since the efficiency of a routing algorithm depends on link-state information accuracy. However, most QoS routing algorithms suffer from scalability due to the high communication overhead and the high computation effort associated with maintaining accurate link state information and distributing global state information to each node in the network. The ultimate goal of this thesis is to contribute towards enhancing the scalability of QoS routing algorithms. Towards this goal, the thesis is focused on Localised QoS routing algorithms proposed to overcome the problems of using global network state information. Using such an approach, the source node makes routing decisions based on the local state information for each node in the path. Localised QoS routing algorithms avoid the problems associated in the global network state, like high communication and processing overheads. In Localised QoS routing algorithms each source node maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the maintenance of a global network state by using locally collected flow statistics and flow blocking probabilities. / Libya's higher education

The InfiniBand Architecture (IBA) network has been proposed as a new industrial standard with high-bandwidth and low-latency suitable for constructing high-performance interconnected cluster computing systems. This architecture replaces the traditional bus-based interconnection with a switch-based network for the server Input-Output (I/O) and inter-processor communications. The efficient Quality-of-Service (QoS) mechanism is fundamental to ensure the import at QoS metrics, such as maximum throughput and minimum latency, leaving aside other aspects like guarantee to reduce the delay, blocking probability, and mean queue length, etc. Performance modelling and analysis has been and continues to be of great theoretical and practical importance in the design and development of communication networks. This thesis aims to investigate efficient and cost-effective QoS mechanisms for performance analysis and improvement of InfiniBand networks in cluster-based computing systems. Firstly, a rate-based source-response link-by-link admission and congestion control function with improved Explicit Congestion Notification (ECN) packet marking scheme is developed. This function adopts the rate control to reduce congestion of multiple-class traffic. Secondly, a credit-based flow control scheme is presented to reduce the mean queue length, throughput and response time of the system. In order to evaluate the performance of this scheme, a new queueing network model is developed. Theoretical analysis and simulation experiments show that these two schemes are quite effective and suitable for InfiniBand networks. Finally, to obtain a thorough and deep understanding of the performance attributes of InfiniBand Architecture network, two efficient threshold function flow control mechanisms are proposed to enhance the QoS of InfiniBand networks; one is Entry Threshold that sets the threshold for each entry in the arbitration table, and other is Arrival Job Threshold that sets the threshold based on the number of jobs in each Virtual Lane. Furthermore, the principle of Maximum Entropy is adopted to analyse these two new mechanisms with the Generalized Exponential (GE)-Type distribution for modelling the inter-arrival times and service times of the input traffic. Extensive simulation experiments are conducted to validate the accuracy of the analytical models.

The resources (memory, power and bandwidth) are limited in wireless and mobile networks. Previous research has shown that the quality of service (QoS) of the mobile client can be improved through efficient resources management. This thesis contains two areas of research that are strongly interrelated. In the first area of research, we extended the MoSync Algorithm, a network application layer media synchronization algorithm, to allow play-out of multimedia packets by the base station upon the mobile client in a First-In-First-Out (FIFO), Highest-Priority-First (PQ), Weighted Fair-Queuing (WFQ) and Round-Robin (RR) order. In the second area of research, we make modifications to the DSR and TORA routing algorithms to make them energy aware routing protocols. Our research shows that the QoS of the mobile client can be drastically improved through effective resource allocation.