• 한국IT서비스학회지
• /
• 제8권1호
• /
• pp.193-202
• /
• 2009

Cloud computing emerges as a new computing paradigm which targets reliable and customizable services. The term builds on decades of research in virtual machine, distributed and parallel computing, utility computing, and more recently networking, web service, and software as a service. In this paper, we provide a seamless connection migration of web services. This is useful for cloud computing environment in which many client terminals have mobility. With the wireless internet facility, those mobile users can move place to place during internet communication. Therefore, we provide solutions to the two major problems in current virtualization based migration: communication failure problems and connection re-establishment. Communication channel flushing by zero window notification helps to resolve the communication failure problems and TCP port inheritance prevents connection re-establishment errors during socket reconstruction. Thus, our web service migration facility is now able to preserve open network connections, and even for server sockets. This is a highly transparent approach, in that we did not Introduce additional messages for channel flushing and did not make any modification to the TCP protocol stack. Experimental results show that the overhead due to connection migration of web services is almost negligible when compared with time to take the conventional web service migration.

• 한국통신학회논문지
• /
• 제21권9호
• /
• pp.2373-2384
• /
• 1996

Connection caching technique is widely used to reduce the overhead incurred by frequency connection establishment in distributed computing environment using connection oriented protocol. We present an efficient connection caching scheme where we divide the system into several host groups and connection between the hosts in the same group is kept prior to others. In other words it makes the connection kept longer by sharing the connection use information between hosts in the same group. Every host group consists of hosts which have heavy intercommunication. And we present performance evaluation of the effect of host grouping upon connection caching and performance comparison of various grouping in several aspects includingmeanservice request interarrival time, mean service time, group size, grouping and type of group. Simulation results show that host grouping is effective in evrey performance criterion and proper grouping of hosts enhances the performance. We also present analysis results for Markov process model of our scheme which are consistent with the simulation results.

• 전자공학회논문지S
• /
• 제34S권12호
• /
• pp.1-9
• /
• 1997

The signaling protocol for B-ISDN should support variety of services including point-to-pont single-connection call, point-to-point multi-connection call and point-to-multipoint connection call. an efficient signaling protocol for point-to-point multi-connection call based on ITU-T Recommendation Q.298X is presented in this paper. Sequential establishment of madatory and optional connections and common routing scheme for synchronization, along with separation of information elements for establishement of multi-connection call are included in the proposed signaling protocol. Limited network resources can be used more efficiently by proposed sequential establishement of mandartory and optional connection for point-to-point multi-connection call which can provide multimedia services. And common routing can be provided effectively by proposed common routing scheme for connectios requiring synchronization like as video-phone and video-conference.

• 한국환경복원기술학회지
• /
• 제17권2호
• /
• pp.125-136
• /
• 2014

Urban Green Area has ecologically deteriorated along with quantitative loss, being developed as a dot itself rather than connected to forests and green networks around the park. The present study aims to propose a connected plan on Urban Ecological Network establishment through 'assessment of the connectivity of the entire urban parks' in accordance with distance of forest and river and 'assessment of trends in connection fragmentation of urban parks' in accordance with the past change of forest and river. According to the result of this study, criteria based on previous research was "directly linked type is less than 300m, conceptually linked type is between 300m to 1km, the isolated type is greater than 1km". And the result of 'assessment of the connectivity of the entire urban parks' is analyzed as the rate of park and green network, 41.7% in Suwon, 80.0% in Seongnam, 88.9% in Namyangju on the basis of office and field investigation. Also, according to the result of 'assessment of trends in connection fragmentation of urban parks', consideration for connection to the original forest is insufficient.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권10호
• /
• pp.491-498
• /
• 2005

서비스 거부 공격이란 서비스를 제공하는데 있어 필요한 컴퓨팅 및 통신 자원을 고갈시키는 공격으로 원천적으로 해결하기가 매우 힘든 것으로 알려져 있다. TCP는 연결 설정 과정에 있어 서비스 거부 공격을 당할 수 있는 문제점을 가지고 있다. TCP는 연결 설정이 완료될 때까지 각 연결 설정 단계의 상태를 큐에 저장하고 있다가 연결 설정이 완료되면 연결된 소켓을 어플리케이션으로 전달한다. 공격자는 수많은 연결 요청을 보내고 이 요청에 대한 연결 과정을 완료하지 않음으로 해서 이 큐를 가득 차게 해 다른 정상적인 연결 요청을 받아들일 수 없도록 할 수 있다. 본 논문에서는 이러한 서비스 거부 공격을 차단하기 위한 확장 TCP를 제안하고 이를 리눅스 상에서 구현하였다. 제안한 확장 TCP는 연결 설정이 종료될 때까지는 연결 설정 과정에 대한 상태를 큐에 유지하지 않도록 함으로써 서비스 거부 공격을 막을 수 있도록 하였다. 제안된 확장 TCP를 위해 TCP의 3-way handshake 과정을 일부 수정하고 이를 리눅스 커널에 구현하였으며 그 성능을 실험해 본 결과 정상적인 서비스 환경에서는 수정전의 TCP의 연결 처리 속도에 비해 $0.05\%$정도의 지연이 있었지만 SYN Flood 공격이 이루어지고 있는 상황에서는 아무런 영향을 받지 않았다

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.511-523
• /
• 2007

In broadband convergence network(BcN), heterogeneous broadband wired & wireless subnetworks and various terminal equipments will be interconnected. In order to provide end-to-end realtime multimedia services on such heterogeneous networking environment, as a result, two major problems should be resolved: i) Multimedia session establishment & negotiation that adjusts the differences in the capability of multimedia data processing at the end terminal nodes, ii) quality of service(QoS)-guaranteed connection establishment or resource reservation with connection admission control(CAC) in each heterogeneous subnetworks along the path. The session layer signaling(e.g., SIP/SDP) should be extended for QoS negotiation, and must be tightly cooperating with network layer signaling or resource reservation with CAC function. In this paper we propose a session and connection management architecture for the QoS-guaranteed realtime multimedia service provisioning on BcN, with Q-SIP/SDP, resource reservation protocol with traffic engineering extension, and CAC functions. The detailed interaction scenario and related algorithms for QoS-guaranteed realtime multimedia session, resource reservation and connection establishment are explained and analyzed. From the experimental implementation of the proposed scheme on a small scale BcN testbed, we verified that the proposed architecture is applicable for the realtime multimedia service provisioning. We analyze the network performance and QoS parameters in detail.

• 한국환경생태학회:학술대회논문집
• /
• 한국환경생태학회 2003년도 정기총회 및 학술논문 발표회
• /
• pp.86-89
• /
• 2003

• Steel and Composite Structures
• /
• 제42권1호
• /
• pp.49-57
• /
• 2022

This paper presents a study on the behavior of a bolted T-stub to square tube connection using Thread-fixed One-side Bolts (TOBs) through tests and numerical simulations. It outlines a research work of four connections with focus on the failure modes and strengths of the connection under tensile load. It was observed that the thread anchor failure caused by shear failure of hole threads controlled the final failure of the connection in the tests. Meanwhile, the out-of-plane deformation of tube wall resulted in the contact separation between hole threads and bolt threads, which in turn reduced the shear strength of hole threads. Finite element models (FEMs) allowing for the configuration details of the TOBs fixed connection are then developed and compared with the test results. Subsequently, the failure mechanism of hole threads and stress distribution of each component are analyzed based on FEM results. It was concluded that the ultimate strength of connection was not only concerned with the shear strength of hole threads, but also was influenced by the plastic out-of-plane deformation of tube wall. These studies lay a foundation for the establishment of suitable design methods of this type of connection.

• 대한산업공학회지
• /
• 제40권1호
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• International journal of advanced smart convergence
• /
• 제12권4호
• /
• pp.55-62
• /
• 2023

Slotted-Aloha (S-Aloha) has been widely employed in random access networks owing to its simple implementation in a distributed manner. To enhance the throughput performance of the S-Aloha, connection-based slotted-Aloha (CS-Aloha) has been proposed in recent years. The fundamental principle of the CS-Aloha is to establish a connection with a short-sized request packet before transmitting data packets. Subsequently, the connected node transmits long-sized data packets in a batch of size M. This approach efficiently reduces collisions, resulting in improved throughput compared to the S-Aloha, particularly for a large M. In this paper, we address the short-term fairness of the CS-Aloha, as quantified by Jain's fairness index. Specifically, we evaluate how equitably the CS-Aloha allocatestime slots to all nodes in the network within a finite time interval. Through simulation studies, we identify the impact of system parameters on the short-term fairness of the CS-Aloha and propose an optimal transmission probability to support short-term fairness.