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

Search Result 598, Processing Time 0.021 seconds

An Adaptive Chord for Minimizing Network Traffic in a Mobile P2P Environment (비정기적 데이터 수집 모드에 기반한 효율적인 홈 네트워크 서비스 제어 시스템의 설계)

  • Woo, Hyun-Je;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.773-782
    • /
    • 2009
  • A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

An Improved Reactive Chord for Minimizing Network Traffic and Request Latency (트래픽 및 요청 지연을 최소화한 향상된 리액티브 Chord)

  • Yoon, Yong-Hyo;Kwak, Hu-Keun;Kim, Cheong-Ghil;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.73-82
    • /
    • 2009
  • The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous method. We perform experiments using Chord simulator (I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

Reader Level Filtering for Query Processing in an RFID Middleware (RFID 미들웨어에서 질의 처리를 위한 리더 단계 여과)

  • Kabir, Muhammad Ashad;Ryu, Woo-Seok;Hong, Bong-Hee
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.113-122
    • /
    • 2008
  • In RFID system, Middleware collects and filters streaming data gathered continuously from readers to process applications requests. The enormous amount of data makes middleware in highly overloaded. Hence, we propose reader level filtering in order to reduce overall middleware load. In this paper, we consider reader filtering capability and define query plan to minimize number of queries for processing into middleware and reader level. We design and implement middleware system based on proposed query plan. We perform several experiments on implemented system. Our experiments show that the proposed query plan considerably improves the performance of middleware by diminishing processing time and network traffic between reader and middleware.

Distributed processing for the Load Minimization of an SIP Proxy Server (SIP 프록시 서버의 부하 최소화를 위한 분산 처리)

  • Lee, Young-Min;Roh, Young-Sup;Cho, Yong-Karp;Oh, Sam-Kweon;Hwang, Hee-Yeung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.4
    • /
    • pp.929-935
    • /
    • 2008
  • As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

An Interference Coordination Technique Utilizing Sub-Arrays and Its Performance in Cellular Systems (부 어레이 빔포밍을 활용하는 간섭 제어 기법 및 셀룰러 시스템에서의 성능 평가)

  • Kang, Hosik;Lee, Donghyun;Sung, Wonjin
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.6
    • /
    • pp.653-663
    • /
    • 2014
  • To cope with an increasing amount of data traffic, research efforts are being made to maximize the data rate by reducing the interference between the transmission nodes. This paper also focuses on interference control schemes utilizing antenna sub-array beam-forming. The first scheme relies on horizontal beam rotation which utilizes three types of narrow beam patterns. Different beam patterns are applied to transmit signals in rotating fashion to control the interference. The second scheme is based on user-specific sub-array beamforming, which uses the precoding matrix based on users' location and controls the amount of interference in the multi-user environment. The performance of the proposed schemes is evaluated using the computer simulation to demonstrate the performance enhancement.

A New framework for IP Traceback : Inference of Logical Topology by Measuring Packet Losses (IP 역추적을 위한 새로운 접근 : 패킷 손실 기반의 논리적 전송 경로 추정)

  • 이준엽;이승형;양훈기;고재영;강철오;정주영
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.3
    • /
    • pp.39-47
    • /
    • 2002
  • This paper deals with study of a new framework for the traceback of distributed DoS(Denial of Service) attacks in the Internet, in which many sources flood "spoofed" IP packets towards a single victim. In our scheme, the destination host traces those anonymous packets' losses, and infers the logical end-to-end paths back towards the sources. This method is based on the fact that there is a strong correlation between packet losses when those packets traverse along a same route, and the simulation results show high probabilities of detecting the topology under a certain condition. Compared with previous approaches, our scheme has a number of distinct features: It can be performed in realtime or non-realtime, without any supports of routers or ISPs. Our results may be applied to the inference of physical topology and to support previous approaches.pproaches.

IoT Edge Architecture Model to Prevent Blockchain-Based Security Threats (블록체인 기반의 보안 위협을 예방할 수 있는 IoT 엣지 아키텍처 모델)

  • Yoon-Su Jeong
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.2
    • /
    • pp.77-84
    • /
    • 2024
  • Over the past few years, IoT edges have begun to emerge based on new low-latency communication protocols such as 5G. However, IoT edges, despite their enormous advantages, pose new complementary threats, requiring new security solutions to address them. In this paper, we propose a cloud environment-based IoT edge architecture model that complements IoT systems. The proposed model acts on machine learning to prevent security threats in advance with network traffic data extracted from IoT edge devices. In addition, the proposed model ensures load and security in the access network (edge) by allocating some of the security data at the local node. The proposed model further reduces the load on the access network (edge) and secures the vulnerable part by allocating some functions of data processing and management to the local node among IoT edge environments. The proposed model virtualizes various IoT functions as a name service, and deploys hardware functions and sufficient computational resources to local nodes as needed.

An Efficient Load-Balancing Algorithm based on Bandwidth Reservation Scheme in Wireless Multimedia Networks (무선 멀티미디어 망에서 대역폭 예약을 이용한 효율적인 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.4
    • /
    • pp.441-449
    • /
    • 2002
  • For multimedia traffics to be supported successfully in wireless network environment, it is necessary to provide Qualify-of-Service(QoS) guarantees among mobile hosts(clients). In order to guarantee the QoS, we have to keep the call blocking probability below a target value during hand-off session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic of a new cell, since on service mobile clients should be able to continue their sessions. In this paper, we propose an efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. Proposed algorithm predicts the direction of clients in a cell and adjusts the amount of the channel to be reserved according to the load status of the cell. This method is used to reserve a part of bandwidths of a cell for hand-off calls to its adjacent cells and this reserved bandwidth can be used for hand-off call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with an adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure metrics such as the blocking probability of new calls and dropping probability of hand-off calls, and compare with those of existing schemes.

  • PDF

A Document Collection Method for More Accurate Search Engine (정확도 높은 검색 엔진을 위한 문서 수집 방법)

  • Ha, Eun-Yong;Gwon, Hui-Yong;Hwang, Ho-Yeong
    • The KIPS Transactions:PartA
    • /
    • v.10A no.5
    • /
    • pp.469-478
    • /
    • 2003
  • Internet information search engines using web robots visit servers conneted to the Internet periodically or non-periodically. They extract and classify data collected according to their own method and construct their database, which are the basis of web information search engines. There procedure are repeated very frequently on the Web. Many search engine sites operate this processing strategically to become popular interneet portal sites which provede users ways how to information on the web. Web search engine contacts to thousands of thousands web servers and maintains its existed databases and navigates to get data about newly connected web servers. But these jobs are decided and conducted by search engines. They run web robots to collect data from web servers without knowledge on the states of web servers. Each search engine issues lots of requests and receives responses from web servers. This is one cause to increase internet traffic on the web. If each web server notify web robots about summary on its public documents and then each web robot runs collecting operations using this summary to the corresponding documents on the web servers, the unnecessary internet traffic is eliminated and also the accuracy of data on search engines will become higher. And the processing overhead concerned with web related jobs on web servers and search engines will become lower. In this paper, a monitoring system on the web server is designed and implemented, which monitors states of documents on the web server and summarizes changes of modified documents and sends the summary information to web robots which want to get documents from the web server. And an efficient web robot on the web search engine is also designed and implemented, which uses the notified summary and gets corresponding documents from the web servers and extracts index and updates its databases.

Node Architecture and Cell Routing Strategies for ATM Applications in WDM Multihop Networks (WDM 다중홉 망에서 ATM 응용을 위한 노드 구조 및 셀 라우팅 기법)

  • Lee, Ho-Suk;Lee, Cheong-Hun;So, Won-Ho;Kwon Hyeok-Jung;Kim, Yeong-Cheon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.44-52
    • /
    • 1998
  • In this paper, we proposed a node architecture and cell routing strategies for ATM applications in WDM multihop networks. The proposed node architecture employs the optical delay loop for storing the cell which is failed in out-link contention. This optical delay loop allows the delay of one cell without the electro-optic conversion. Therefore, we can get the advantages of S&F(Store-and-Forward) routing in Deflection-based all-optical networks. To support the ATM applications efficiently. we considered the transmission priority of ATM cell so that high priority cell can be transmitted with lower loss and shorter delay than low priority one. Two kinds of routing strategies are designed for this architecture: Scheme-Ⅰand Scheme-Ⅱ. Scheme-Ⅰapplies S&F routing to high cell and Deflection routing to low cell, i.e., high cells are routed along the shortest path based on S&F routing, but low cells are deflected or lost. Schem-Ⅱ is similar to Scheme-Ⅰexcept that low cells can occupy the optical loop if it is available. This Scheme-Ⅱ increases the utilization of network resources without decreasing the throughput of high cell by reducing the low cell loss rate when traffic load is low. Simulation results show that our routing strategies have better performance than conventional ones under non-uniform traffic as well as uniform traffic.

  • PDF