• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.17-24
• /
• 2004

This paper proposes an efficient technique to protect e-mail server from DDoS attack using the CBQ (Class Based Queuing) algorithm The proposed method classifies incoming trafic to an e-mail server into three classes: 'more important mail traffic', 'less important traffic' and 'unknown traffic' and assigns bandwidths differently to the traffics. By differentiating the bandwidths of classes, normal mail traffic may flow even under DDoS attack in the proposed technique. The proposed technique is implemented on an embedded system which hires a switching processor with the WFHBD(Weighted Fair Hashed Bandwidth Distribution) engine that has been known as an efficient algorithm to distribute a given bandwidth to multiple sources, and it is verified that it can be an efficient way to protect e-mail server from DDoS attack.

• Journal of KIISE:Software and Applications
• /
• v.34 no.8
• /
• pp.689-696
• /
• 2007

It is important issue for software architects to estimate performance of software in the early phase of the development process due to the need to verify non-functional requirements and estimation of performance in various stages of architectural design. In order to analyze performance of software, there are many approaches to translate software architecture represented by Unified Modeling Language, into analytical models. However, in the development of agent-based systems, these approaches ignore or simplify the crucial details of the underlying performance of the agent platform. In this paper, we propose performance prediction methodology for agent based system using formal semantic descriptions, and then, we transform the descriptions into queuing network model which model reflects performance of hardware and software platform. We prove the accuracy of proposed methodology using prototype implementation. The accuracy is summarized at 80%.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.311-315
• /
• 2008

The switching fabric used to make high speed switching for packet transfer between input and output interface in recent internet environments. Without making any changes in order to remain ATM switching fabric, the existing structures should split/reassemble a packet to certain size, set aside cross-point buffer and will put loads on the system. In this paper, we proposed a new switch architecture, which has separated data memory plane and switching plane packet data will be stored on the separate memory structure and simultaneously only the part of the memory address pointers can pass the switching fabric. The small mini packets which have address pointer and basic information would be passed through the switching fabric. It is possible to achieve the remarkable switching performance than other switch fabrics with contending variable length packets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.357-365
• /
• 2009

To effectively exploit the underlying network bandwidth while maximizing user perceivable QoS, mandatory to make proper estimation on packet loss and queuing delay of the underling network. This issue is further emphasized in wireless network environment where network bandwidth is scarce resource. In this work, we focus our effort on developing performance model for wireless network. We collect packet trace from actually wireless network environment. We find that packet count process and bandwidth process in wireless environment exhibits long range property. We extract key performance parameters of the underlying network traffic. We develop an analytical model for buffer overflow probability and waiting time. We obtain the tail probability of the queueing system using Fractional Brown Motion (FBM). We represent average queuing delay from queue length model. Through our study based upon empirical data, it is found that our performance model well represent the physical characteristics of the IEEE 802.11b network traffic.

• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.301-311
• /
• 2021

The technological advancements of the last two decades directed the era of the Internet of Things (IoT). IoT enables billions of devices to connect through the internet and share their information and resources on a global level. These devices can be anything, from smartphones to embedded sensors. The main purpose of IoT is to make devices capable of achieving the desired goal with minimal to no human intervention. Although it hascome as a social and economic blessing, it still brought forward many security risks. This paper focuses on providing a survey of the most commonly used application layer protocols in the IoT domain, namely, Constrained Application Protocol (CoAP), Message Queuing Telemetry Transport (MQTT), Advanced Message Queuing Protocol (AMQP), and Extensible Messaging and Presence Protocol (XMPP). MQTT, AMQP, and XMPP use TCP for device-to-device communication, while CoAP utilizes UDP to achieve this purpose. MQTT and AMQP are based on a publish/subscribe model, CoAP uses the request/reply model for its structuring. In addition to this, the quality of service provision of MQTT, AMQP, and CoAP is not very high, especially when the deliverance of messages is concerned. The selection of protocols for each application is very a tedious task.This survey discusses the architectures, advantages, disadvantages, and applications of each of these protocols. The main contribution of this work is to describe each of the aforementioned application protocols in detail as well as providing their thorough comparative analysis. This survey will be helpful to the developers in selecting the protocol ideal for their system and/or application.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.1
• /
• pp.21-30
• /
• 2023

Excessive complaints and traffic jams occurred as customers who visited the Drive-thru waited in a long line. Company S recommends DT Pass to reduce the queues. Therefore, this study confirmed the improvement in performance of the queue increasing the number of stores operated by two servers insteaol of one using a queue model. And then confirmed performance improvement by dividing them into DT and DT Pass. After that, the L value derived through the queue model and the number of queues in each store were compared to calculate the number of queues to be additionally provided. Through this, the validity of selecting the minimum number of queues in the future is verified based on the results derived in this study.

• Asia pacific journal of information systems
• /
• v.7 no.3
• /
• pp.109-124
• /
• 1997

Pricing information services, where congestion can threaten the efficient operation of information systems, has been studied in economics and information systems literature, Recent explosion of the Internet ana proliferation of multimedia content over the Internet have rekindled the research interest in designing pricing schedules for differentiated information services, In order for the information system to effectively serve users having heterogeneous needs, pricing rules for discriminated services should be considered. At the same time, when individual users' interest does not align with that of the organization that individual users belong to, organization-wide pricing policy should be devised to improve the value of the services rendered by the system. This paper, using a priority queuing model, addresses the need for such on incentive-compatible pricing for different information services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.117-135
• /
• 2016

Performance enhancement is one of the most important issues in high performance distributed computing systems. In such computing systems, online users submit their jobs anytime and anywhere to a set of dynamic resources. Jobs arrival and processes execution times are stochastic. The performance of a distributed computing system can be improved by using an effective load balancing strategy to redistribute the user tasks among computing resources for efficient utilization. This paper presents a multi-class load balancing strategy that balances different classes of user tasks on multiple heterogeneous computing nodes to minimize the per-class mean response time. For a wide range of system parameters, the performance of the proposed multi-class load balancing strategy is compared with that of the random distribution load balancing, and uniform distribution load balancing strategies using simulation. The results show that, the proposed strategy outperforms the other two studied strategies in terms of average task response time, and average computing nodes utilization.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.381-390
• /
• 2002

We analyze the performance of a telecommunications management network (TMN) system using models of networks of queues, Jackson's theorem, and simulation. TMN systems for managing public asynchronous transfer mode (ATM) networks generally have a four-level hierarchical structure consisting of a network management system, a few element management systems (EMSs), and several pairs of agents and ATM switches. We construct a Jackson's queuing network and present formulae to calculate its performance measures: distributions of queue lengths and waiting times, mean message response time, and maximum throughput. We perform a numerical analysis and a simulation analysis and compare the results.