• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2463-2482
• /
• 2016

Cloud services are often provisioned to their customers using user-friendly web browsers with flexible and rich plug-in environments. Delay is one of the fundamental performance metrics of these web-based services. Commonly-used network measurement tools usually only measure network delay and it may be difficult to infer the web-delay performance using only network layer measurement approaches. In this paper, we propose to evaluate the application layer delay in a browser-based network measurement platform using engineered scripts. We conducted a delay measurement study using instrumented scripts in the proposed browser-based measurement platform. Our investigation included a comparison study of three browser-scripting delay measurement methods, including Java applet, JSP and Flash ActionScript. We developed a browser-based delay measurement testbed over the Internet so that different delay measurement tools could be evaluated in the same real network environment including typical Internet paths and the Baidu cloud. We also decomposed the components of the end-to-end delay process of the above measurements to reveal the difference and relationship between the network-layer delay and the application-layer delay. Our measurement results characterize the stochastic properties of the application-layer delay over real Internet paths, and how these properties vary from the underlying network layer delay. This browser-scripting measurement approach can be easily deployed on different cloud service platforms to inspect their application-layer delay performance between end clients and the cloud platforms. Our measurement results may provide insights into designing new cloud services with enhanced quality-of-experience perceived by cloud users.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.35-42
• /
• 2003

In this paper, we classified the wavelength reservation mechanisms of optical burst switching (OBS), and investigated the path length priority effect of the offset time/delayed reservation (OT/DR)-based scheme like the just-enough-time (JET) protocol. And, we showed that the fiber delay line (FDL)-based scheme can avoid the path length priority effect in multiple hop network environments. Also, we proposed a novel FDL/DR with hop-by-hop priority increasing (HPI) scheme which can improve the end-to-end throughput by increasing the priority of bursts hop-by-hop using the input FDLs at each node. The simulation results showed that the proposed FDL/DR with HPI scheme could avoid the path length priority effect and enhance the end-to-end throughput in multiple hop network environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.991-1000
• /
• 2004

This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.83-93
• /
• 2010

P2P streaming technology has advantages of scalability and availability comparing to the popular IP multicast. This paper proposes an approach to apply the P2P streaming technology to the delay-sensitive multimedia multicast applications. In order for the P2P streaming to be applied to the delay-sensitive applications, prior construction of delay-guaranteed overlay network is necessarily required. Moreover, the delay-guaranteed overlay network should be able to be kept even when the hand-overs occur owing to the departures of the intermediate P2P peers. This paper proposes a delay-guaranteed overlay network construction method by using the bandwidth and end-to-end delay based admission control and the backup peer based hand-over control mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.483-486
• /
• 1988

Link-by-link and end-to-end signaling affect the probability of inefficient trunk seizure, the usage of backward signal features, post dialing delay, total signal information processing load, each differently. Considering the circumtances of the domestic public switched telephone network, we conclude that end-to-end signaling is better suited to the domestic network.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1119-1127
• /
• 2007

This paper is concerned with a performance analysis using a wired/wireless hybrid network based on Common Industrial Protocol(CIP). For the performance analysis, the data transmission time, average end-to-end delay and throughput between DeviceNet and the wireless devices are investigated. The experimental results show the performance in terms of the polling/COS service time of CIP based hybrid network.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.229-235
• /
• 2007

This paper analyzes the performance of a Bluetooth piconet in error-prone environments. A statistical characterization of a waiting time, an end-to-end delay, and a goodput are derived analytically in terms of the arrival rates, the number of slaves, and the packet error rate (PER). For simplicity, half-symmetric piconet is assumed in this analysis. Both exhaustive and limited scheduling are considered. The analytic results are validated by simulations.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.42-49
• /
• 2017

Delay- and Disruption-Tolerant Network (DTN) has been considered as a key technology to overcome main challenges in interplanetary communications such as an intermittent connectivity and high bit error rates. The lack of end-to-end connectivity between source and destination results in long and variable delays and data loss, hence the Internet Protocols cannot operate properly in such environments because it requires an end-to-end connectivity. The DTN, which utilizes 'store-and-forward' message passing scheme between nodes, can overcome the lack of end-to-end connectivity in Interplanetary Network (IPN). In this paper, DTN is applied to 3-hop relay IPN, where messages are transmitted from Earth ground station to Lunar lander through Earth satellite and Lunar orbiter. ONE simulator is used to reflect the real environment of IPN and an efficient resource management method are analyzed to guarantee the message delivery by optimizing a message TTL (Time to Live), buffer size and message fragmentation.