Semantic model-driven development of web service architectures.

Building service-based architectures has become a major area of interest since the advent of Web services. Modelling these architectures is a central activity. Model-driven development is a recent approach to developing software systems based on the idea of making models the central artefacts for design representation, analysis, and code generation. We propose an ontology-based engineering methodology for semantic model-driven composition and transformation of Web service architectures. Ontology technology as a logic-based knowledge representation and reasoning framework can provide answers to the needs of sharable and reusable semantic models and descriptions needed for service engineering. Based on modelling, composition and code generation techniques for service architectures, our approach provides a methodological framework for ontology-based semantic service architecture

Automating property-based testing of evolving web services

Web services are the most widely used service technology that drives the Service-Oriented Computing~(SOC) paradigm. As a result, effective testing of web services is getting increasingly important. In this paper, we present a framework and toolset for testing web services and for evolving test code in sync with the evolution of web services. Our approach to testing web services is based on the Erlang programming language and QuviQ QuickCheck, a property-based testing tool written in Erlang, and our support for test code evolution is added to Wrangler, the Erlang refactoring tool. The key components of our system include the automatic generation of initial test code, the inference of web service interface changes between versions, the provision of a number of domain specific refactorings and the automatic generation of refactoring scripts for evolving the test code. Our framework provides users with a powerful and expressive web service testing framework, while minimising users' effort in creating, maintaining and evolving the test model. The framework presented in this paper can be used by both web service providers and consumers, and can be used to test web services written in whatever language; the approach advocated here could also be adopted in other property-based testing frameworks and refactoring tools

Network Coding Over SATCOM: Lessons Learned

Satellite networks provide unique challenges that can restrict users' quality of service. For example, high packet erasure rates and large latencies can cause significant disruptions to applications such as video streaming or voice-over-IP. Network coding is one promising technique that has been shown to help improve performance, especially in these environments. However, implementing any form of network code can be challenging. This paper will use an example of a generation-based network code and a sliding-window network code to help highlight the benefits and drawbacks of using one over the other. In-order packet delivery delay, as well as network efficiency, will be used as metrics to help differentiate between the two approaches. Furthermore, lessoned learned during the course of our research will be provided in an attempt to help the reader understand when and where network coding provides its benefits.Comment: Accepted to WiSATS 201

Low-complexity medium access control protocols for QoS support in third-generation radio access networks

One approach to maximizing the efficiency of medium access control (MAC) on the uplink in a future wideband code-division multiple-access (WCDMA)-based third-generation radio access network, and hence maximize spectral efficiency, is to employ a low-complexity distributed scheduling control approach. The maximization of spectral efficiency in third-generation radio access networks is complicated by the need to provide bandwidth-on-demand to diverse services characterized by diverse quality of service (QoS) requirements in an interference limited environment. However, the ability to exploit the full potential of resource allocation algorithms in third-generation radio access networks has been limited by the absence of a metric that captures the two-dimensional radio resource requirement, in terms of power and bandwidth, in the third-generation radio access network environment, where different users may have different signal-to-interference ratio requirements. This paper presents a novel resource metric as a solution to this fundamental problem. Also, a novel deadline-driven backoff procedure has been presented as the backoff scheme of the proposed distributed scheduling MAC protocols to enable the efficient support of services with QoS imposed delay constraints without the need for centralized scheduling. The main conclusion is that low-complexity distributed scheduling control strategies using overload avoidance/overload detection can be designed using the proposed resource metric to give near optimal performance and thus maintain a high spectral efficiency in third-generation radio access networks and that importantly overload detection is superior to overload avoidance

WCDMA in Malaysia

Wideband Code Division Multiple Access (WCDMA) A 3G highspeed digital data service provided by cellular carriers that use the time division multiplexing (TDMA) or GSM technology worldwide, including AT&T (formerly Cingular) and T-Mobile in the U.S. WCDMA works on WCDMA cell phones as well as laptops and portable devices with WCDMA modems [1]. Users have typically experienced downstream data rates up to 400 Kbps [1]. WCDMA has been used in the Japanese Freedom of Mobile Multimedia Access (FOMA) system and in the Universal Mobile Telecommunications System (UMTS); a third generation follow-on to the 2G GSM networks deployed worldwide [1]. Although TDMA and GSM carriers both use TDMA modulation, WCDMA stems from CDMA. Part of the 3GPP initiative, the International Telecommunication Union (ITU) refers to WCDMA as the Direct Sequence (DS) interface within the IMT-2000 global 3G standards [1]

Quasi-Dynamic Frame Coordination For Ultra- Reliability and Low-Latency in 5G TDD Systems

The fifth generation (5G) mobile technology features the ultra-reliable and low-latency communications (URLLC) as a major service class. URLLC applications demand a tight radio latency with extreme link reliability. In 5G dynamic time division duplexing (TDD) systems, URLLC requirements become further challenging to achieve due to the severe and fast-varying cross link interference (CLI) and the switching time of the radio frame configurations (RFCs). In this work, we propose a quasi-dynamic inter-cell frame coordination algorithm using hybrid frame design and a cyclic-offset-based RFC code-book. The proposed solution adaptively updates the RFCs in time such that both the average CLI and the user-centric radio latency are minimized. Compared to state-of-the-art dynamic TDD studies, the proposed scheme shows a significant improvement in the URLLC outage latency, i.e., 92% reduction gain, while boosting the cell-edge capacity by 189% and with a greatly reduced coordination overhead space, limited to B-bit

Comparison of web service architecture based on architecture quality properties

Web service research has been focused on the issues of automatic binding, performance, scalability, and security, however, little research has been done in evaluation of web service architectures, namely Broker based. Examples of these are Matchmaker Broker, Layered Matchmaker, Facilitator, Layered facilitator, and Peer to peer (P2P) based, such as P2P Discovery, Match Maker and P2P, Split Code and P2P execution, Mobile Code with P2P etc. Another consideration is its impact on the adoption in distributed Internet environment. In this paper we introduce a methodology for measuring and evaluating web service architecture style, and we present our development of a set of architectural quality properties, and use these quality properties to carry out comparison and contract of current web services architectures. We provide a detailed analysis and critique of these, and these could be served as a guidelines for the next generation of web services development, which could adopted into the distributed environment

An Analysis of Code Mixing in Lazuardy Printing TikTok Account

The goal of this research was to determine the types of code-mixing employed in Lazuardy's Tiktok account, as well as the variables that influence code mixing. This research was a descriptive qualitative analysis that aimed to characterize the many types of code-mixing and the elements that influence them. The information was gathered through English and Indonesian code mixing texts on Lazuardy's Tiktok account @lazuardy.printing, as well as an interview with the CEO of PT Lazuardy Global Service, in order to identify the reasons and categorize the different forms of code mixing. As a result of the study, the researcher discovered a total of 139 Indonesian English code mixing in Lazuardy's Tiktok, with 84 data representing 60% of word insertions, 41 data representing 30% of phrase insertions, 11 data representing 8% of hybrid insertions, and 3 data representing 2% of clause insertions. According to the report, code mixing is utilized for two reasons. The first reason is that the younger generation is classified as the segmented market of the company. Another goal is to present Lazuardy's products, which will be largely written in English

Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM

We propose a multi-class mechanism for Optical Code Division Multiplexing (OCDM), Wavelength Division Multiplexing (WDM) Optical Packet Switch (OPS) architecture capable of supporting Quality of Service (QoS) transmission. OCDM/WDM has been proposed as a competitive hybrid switching technology to support the next generation optical Internet. This paper addresses performance issues in the slotted OPS networks and proposed four differentiation schemes to support Quality of Service. In addition, we present a comparison between the proposed schemes as well as, a simulation scheduler design which can be suitable for the core switch node in OPS networks. Using software simulations the performance of our algorithm in terms of losing probability, the packet delay, and scalability is evaluated