• Title/Summary/Keyword: 트래픽 부하

Search Result 598, Processing Time 0.064 seconds

A Study on QoS Routing Performance Enhancement by using LSQR Scheduling in WiMAX Mesh Networks (와이맥스 메쉬 네트워크에서 LSQR 스케줄링을 이용한 QoS 라우팅 성능 향상에 관한 연구)

  • Tak, Wooyoung;Lee, Gowoon;Joh, Hangki;Ryoo, Intae
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.429-437
    • /
    • 2013
  • Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

Hierarchical QoS Architecture for Virtual Dancing Environment (분산 가상현실을 위한 계층적 QoS 지원 기법)

  • 김진용;원유집;김범은;박종일;박용진
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.11
    • /
    • pp.675-690
    • /
    • 2003
  • In this paper, we present the virtual dancing studio for distributed virtual environment. In this system, geographically distributed user shares the virtual dancing hall and interacts with each other. The participating object can be a graphical avatar or a live video stream. It allows the coexistence of graphic objects and real images in the shared virtual space. One of the main technical challenges in developing the distributed virtual environment is to handle excessive network traffic. In an effort to effectively reduce the network traffic, we propose a scheme to adjust the QoS of each object with respect to the distance from the observer in the virtual space. The server maintains the QoS vector for each client's shared space and controls the packet traffic to individual clients based on its QoS vectors. We develop a proto-type virtual dancing environment. Java based development enables the client to be platform independent. The result of experiment shows that the adoption of hierarchical QoS management significantly reduces the overall network traffic.

A Study on Real-time Message Analysis for AIS VDL Load Management (AIS 통신부하 관리를 위한 실시간 메시지 분석에 관한 연구)

  • Lee, Sang-Jae;Jeong, Jung-Sik;Kim, Min-Yeop;Park, Gyei-Kark
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.256-261
    • /
    • 2013
  • The AIS(Automatic Identification System) has been widely used for ship safety at sea over the last 10 years. The AIS traffic load at VDL(VHF Data Link) has been continuously increased. As the traffic load at VDL increases, the quality of AIS service may be deteriorated. In the previous research, the AIS traffic has been analyzed in the major ports of Korea, and its problem due to traffic overload has been suggested. However, no solutions has been given so far. In this paper, the method of autimatically controlling the VDL traffic at AIS base station is represented.

Asynchronous and Adaptive Massage Passing Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 비동기 적응형 메시지 전달 기법)

  • Jeong, Jong-Kyun;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.196-201
    • /
    • 2013
  • In this paper, we propose an asynchronous and adaptive message passing scheme based on S-MAC for handling with the problem on energy efficiency in wireless sensor networks. The proposed scheme consists of a policy that differentiate transmission errors caused by packet collision or radio interference from congestion errors caused by buffer overflow and a method that adaptively controls the size of a fragment according to the variance of traffic loads. Especially, it presents a method that highly reduce the energy consumption by keeping the size of fragment not being excessively smaller than the one that may result in rapid increment of the total transfer time. Finally, with the simulation results we show that network throughput and delay are improved by using the proposed message passing scheme.

Design of GlusterFS Based Big Data Distributed Processing System in Smart Factory (스마트 팩토리 환경에서의 GlusterFS 기반 빅데이터 분산 처리 시스템 설계)

  • Lee, Hyeop-Geon;Kim, Young-Woon;Kim, Ki-Young;Choi, Jong-Seok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.1
    • /
    • pp.70-75
    • /
    • 2018
  • Smart Factory is an intelligent factory that can enhance productivity, quality, customer satisfaction, etc. by applying information and communications technology to the entire production process including design & development, manufacture, and distribution & logistics. The precise amount of data generated in a smart factory varies depending on the factory's size and state of facilities. Regardless, it would be difficult to apply traditional production management systems to a smart factory environment, as it generates vast amounts of data. For this reason, the need for a distributed big-data processing system has risen, which can process a large amount of data. Therefore, this article has designed a Gluster File System (GlusterFS)-based distributed big-data processing system that can be used in a smart factory environment. Compared to existing distributed processing systems, the proposed distributed big-data processing system reduces the system load and the risk of data loss through the distribution and management of network traffic.

Hashing Method with Dynamic Server Information for Load Balancing on a Scalable Cluster of Cache Servers (확장성 있는 캐시 서버 클러스터에서의 부하 분산을 위한 동적 서버 정보 기반의 해싱 기법)

  • Hwak, Hu-Keun;Chung, Kyu-Sik
    • The KIPS Transactions:PartA
    • /
    • v.14A no.5
    • /
    • pp.269-278
    • /
    • 2007
  • Caching in a cache sorrel cluster environment has an advantage that minimizes the request and response tine of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache sowers since each cache server should keep all the cache data. The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing md the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o

Vehicular Web Server Cluster Design for Next Generation Centralized Navigation Services (차세대 집중형 항행 서비스를 위한 이동체 웹 서버 클러스터 설계)

  • Kim, Ronny Yongho;Kim, Young Yong
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.5
    • /
    • pp.669-676
    • /
    • 2009
  • HTTP or audio/video streaming services are good candidates for future centralized navigation system and in order to provide stability for such services, service providers use a cluster of web servers. In this paper, we provide the criteria for web server cluster design of vehicular users with consideration of differentiated access per different user classes. Several feasible scenarios are examined and their performance analysis using queueing theory is presented to provide the foundation for web server cluster design using traffic load balancer. Through the thorough analysis, efficient criteria for traffic load balancer design is derived. In order to satisfy users' service requirements, priority services controlled by traffic load balancer are considered and analyzed. We also provide the evaluation of the accuracy of the analytical model through simulation.

  • PDF

Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System (광대역 이동 액세스 시스템에서의 실시간 및 비실시간 통합 서비스 지원을 위한 적응적 임계값 기반 패킷 스케줄링 기법)

  • Ku, Jin-Mo;Kim, Sung-Kyung;Kim, Tae-Wan;Kim, Jae-Hoon;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.261-270
    • /
    • 2007
  • The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

The Multi-path Power-aware Source Routing(MPSR) for the Maximum Network Lifetime in Ad-Hoc Networks (애드혹 네트워크에서 최대 네트워크 유지 시간을 위한 다중경로 에너지 고려 라우팅 기법)

  • Hwang, Ho-Young;Suh, Hyo-Joong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.21-29
    • /
    • 2010
  • In Ad-Hoc Networks, the limited energy is the key issue for longer network operation time. To solve this problem, various energy-aware routing techniques have been proposed including PSR (Power-aware Source Routing), HPSR (Hirachical Power-aware Source Routing), and etc. Those techniques generally select the most adequate route considering the energy consumption so that the energy efficiency can be improved. However, There are problems in those techniques that traffic can be concentrated in some specific area in a network. In this paper, a new energy aware routing technique called MPSR is proposed to achieve longer network lifetime and fewer rerouting attempts.

Dual Mode Packet Transmission Scheme using a Dynamic Switching Threshold in the IMT-2000 (IMT-2000에서 동적 스위칭 임계점을 이용하는 이중 모드 패킷 전송방식)

  • 김장욱;반태원;오창헌;조성준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.907-915
    • /
    • 2003
  • A very efficient packet transmission scheme is needed in the radio environment where radio resource is insufficient as compared with the environment of the wired communication. In general, dual mode packet transmission scheme is used broadly. Packets are transmitted through the dedicated or common chamois according to a switching criterion. The general criteria are the length and generation frequency of packet, that is, large and frequent packets are transmitted using a dedicated channel and small and infrequent packets are transmitted using a common channel. The performance of dual mode packet transmission scheme is closely related to the switching criteria. However, it is very difficult to find the optimal switching point because that is not fixed but variable according to the environment such as traffic load, length of generated packets, and the number of channels. In this paper, a new scheme for the dual mode packet transmission scheme using a dynamic switching threshold is proposed where the switching threshold is not fixed but variable according to the network environment. The performance of the proposed method is analyzed using a simulation. From the simulation results, it is shown that the performance of the proposed scheme is not very influenced by the network environment unlike the conventional dual mode packet transmission scheme.