• Proceedings of the CALSEC Conference
• /
• 2005.03a
• /
• pp.261-266
• /
• 2005

Web services provide an effective means to carry out coordinated transactions between multiple, independent business parties. While there are several specific protocols currently being discussed to address the coordination of web services-enabled business transactions, we consider the tentative hold protocol (THP) that allows the placement of tentative holds on business resources prior to actual transactions in order to provide increased flexibility in coordination. In this paper, we present a formal coordination framework for applying THP in conjunction with 2PC to the problem in which service providers independently manage resources and clients seek to acquire the resources from multiple providers as a single atomic transaction. The proposed framework facilitates the performance optimization of THP through effective parameterization with the notion of overhold size and hold duration. The simulation results show that the proposed adaptive approach yields a significant improvement over other non-adaptive policies.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.51-62
• /
• 2012

The exponential growth in wireless services has resulted in an overly crowded spectrum. The current state of spectrum allocation indicates that most usable frequencies have already been occupied. This makes one pessimistic about the feasibility of integrating emerging wireless services such as large-scale sensor networks into the existing communication infrastructure. Cognitive radio is an emerging dynamic spectrum access technology that can be used for flexibly and efficiently achieving open spectrum sharing. Cognitive radio is an intelligent wireless communication system that is aware of its radio environment and that is capable of adapting its operation to statistical variations of the radio frequency. In ad hoc cognitive radio networks, a common control channel (CCC) is usually used for supporting transmission coordination and spectrum-related information exchange. Determining a CCC in distributed networks is a challenging research issue because the spectrum availability at each ad hoc node is quite different and dynamic due to the interference between and coexistence of primary users. In this paper, we propose a novel CCC selection protocol that is implemented in a distributed way according to the appearance patterns of primary systems and connectivity among nodes. The proposed protocol minimizes the possibility of CCC disruption by primary user activities and maximizes node connectivity when the control channel is set up. It also facilitates adaptive recovery of the control channel when the primary user is detected on that channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1208-1220
• /
• 1996

In this paper, the performance of a Carrier Sense Multiple Access/Collision avoidance (CSMA/CA) protocol using stop-and-Wait automatic Repeat reQuest, which is adapted as a draft standard in IEEE 802.11, is analyzed using a mathematical method based on a renewal theory, and simulation checks are performed, which confirm the goodness of our anlysis. In order to anlayze of CSMA/CA, we model that network is composed of finite populationand channel is slotted. And, we consider the CSMA/CA protocol as a hybrid protocol of 1-persistent CSMA and p-persistent CSMA protocol. As resuls of analysis, we have found that the throughput is degraded and packet delay is increased as the number of stations, Acknowledgement (ACK) length and Distributed coordination function Inter Frame Space (DIFS) length are increased.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.277-285
• /
• 2011

Real-time multimedia streaming over the Internet is rapidly increasing with the popularity of user-created contents, Web 2.0 trends, and P2P (peer-to-peer) delivery support. While many homes today are broadband-enabled, the quality of experience (QoE) of a user is still limited due to frequent interruption of media playout. The vulnerability of TCP (transmission control protocol), the popular transport-layer protocol for streaming in practice, to the packet losses, retransmissions, and timeouts makes it hard to deliver a timely and persistent flow of packets for online multimedia contents. This paper presents TCP-real-time online multimedia environment (ROME), a novel transport-layer framework that allows the establishment and coordination of multiple many-to-one TCP connections. Between one client with multiple home addresses and multiple co-located or distributed servers, TCP-ROME increases the total throughput by aggregating the resources of multiple TCP connections. It also overcomes the bandwidth fluctuations of network bottlenecks by dynamically coordinating the streams of contents from multiple servers and by adapting the streaming rate of all connections to match the bandwidth requirement of the target video.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.928-936
• /
• 2004

This paper proposes simple and effective Contention Window (CW) adjusting algorithm to solve the fairness problem of the IEEE 802.11 under the Distributed Coordination Function (DCF). This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes. Simulation results show that fairness problem can be very severe in the original MAC protocol of the wireless network. In case of implement our algorithm, fair sharing was enlarged prominently and the fairness sharing was improved about maximum 30%.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.191-199
• /
• 2006

Effective management of business processes is a crucial issue to every enterprise in e-business environment. What's needed is a new framework of applications that can automatically manage distributed and heterogeneous business processes that span multiple functions of a company. In this paper, we propose technical design of a new enactment model that can coordinate such business process that involves multiple functional units or even multiple companies. In our approach, a process model is decomposed into several structural units, called 'process block', according to their procedural characteristics. Each of them is controlled by autonomous enactment units that can communicate with each other using a mutually agreed coordination protocol. The protocol takes the use of 'associative communication' concept, which allows the autonomy for each unit and secure the correctness of process execution.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.2
• /
• pp.220-224
• /
• 2015

The DCF (Dcistributed Coordination Function) and PCF (Point Coordination Function) are the basic MAC (Medium Access Control) protocols of IEEE 802.11 wireless LANs. According to the DCF, each node performs the exponential backoff algorithm before the transmission of its data frame. Each node doubles the backoff waiting time before the transmission of its data frame whenever it detects the transmission collision with other nodes. Therefore, as the number of the active nodes having the data frames to transmit increases, the overall MAC performance of the DCF decreases. On the other hand, according to the PCF, each node is granted the transmission opportunity by which the PCF transmission is possible without the collision with other nodes. Therefore, as the number of the active nodes increases, the MAC performance of the PCF increases, In this paper, considering the tradeoff of MAC performance between the DCF and PCF, a hybrid MAC protocol is proposed to enhance the performance of IEEE 802.11 wireless LANs.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.171-177
• /
• 2007

Although the Distributed Coordination Function is the fundamental access protocol of IEEE 802.11, it cannot meet the Quality of Service (QoS) requirements in general. So, the Point Coordinate Function is provided to support QoS related services. However, it has inherent problems. Access point (AP) has no knowledge of the queue status and instantaneous channel condition of stations in the system. In this paper we propose an efficient and versatile polling scheduler that shows excellent throughput and fairness performance. Comparison with well known polling schemes is provided through computer simulation under various channel situations including error prone environments.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.38-47
• /
• 2003

Distributed problem solving is the cooperative solution of problem by a decentralized and loosely couped collection of knowledge-sources (KS's), located in a number of distinct processor nodes. The contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver. Task distribution is affected by a negotiation process, a discussion carried on between nodes with tasks to be executed and nodes that may be able to execute tasks In this paper, we present the coordination method among distributed intrusion detection system and firewall by the contract net protocol. The method enhances the intrusion detection performance and provides the communication methods. To mode IDS and firewall, security models hue been hierarchically constructed based on the DEVS (Discrete Event system Specification) formalism. Each ID agent cooperates through the contract net protocol for detecting intrusions. The IDS which detects the intrusion informs to firewall, so the harmful network traffic is blocked. If an agent detects infusions, the agent transfers attacker's information to a firewall. Using this mechanism attacker's packets detected by In can be prevented from damaging the network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.89-95
• /
• 2011

The distributed coordination function (DCF) and point coordination function (PCF) protocols are the basic MAC protocols for legacy IEEE 802.11, IEEE 802.11a, IEEE 802.11b, IEEE 802.11e, IEEE 802.11g and IEEE 802.11n wireless LANs. When the DCF protocol is used for the various versions of IEEE 802.11 wireless LANs, the MAC performance seriously degrades due to the collisions among the stations (STAs) as more and more STAs attempt to transmit their data frames. On the other hand, the PCF MAC performance becomes poor when many STAs exist in IEEE 802.11 wireless LANs, however, only small number of STAs actually attempt to transmit their data frames. In this paper, we propose the algorithm for improving the MAC performance by selectively using the DCF and PCF protocols according to the state of IEEE 802.11 wireless LANs. Numerical examples are presented to show the MAC performance improvement by the selective use of the DCF and PCF protocols according to the network state.