• Title/Summary/Keyword: 트래픽분석

Search Result 1,975, Processing Time 0.025 seconds

Fast Handover Mechanism for Multi-Interface MIPv6 Environments and Performance Evaluation (다중 인터페이스 MIPv6 환경에서의 Fast Handover 방안 및 성능 분석)

  • Park, Man-Kyu;Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.34-43
    • /
    • 2007
  • Recently, in addition to the sharp increase of mobile nodes, various kinds of wireless technologies are available for mobile nodes. If IPv6 technology is applied to the network, multi-homing terminals which have several public IP addresses on one interface will be common. Accordingly, there are many research activities on mobility management for multi-interface, multi-homming nodes. In this paper we propose an extended fast handover mechanism for multi-interface MIPv6 environments that uses multi-interface FBU (MFBU) message instead of the existing FBU message. The MFBU message has the "tunnel destination" mobility option that points a specific tunnel destination other than NAR, and "T" flag that indicates the existence of tunnel destination option. The proposed mechanism can improve the TCP performance by mitigating packet reordering during FMIPv6 handover that can cause unnecessary congestion control due to 3 duplicate ACKs. In this paper, we implemented a multi-Interface MIPv6 simulator by extending a single-interface MIPv6 simulator in NS-2, and showed that the performance of TCP traffic is improved by using the proposed multi-interface fast MIPv6.

Heterogeneous Interface Decision Engine and Architecture for Constructing Low Power Home Networks (저전력의 홈 네트워크 구축을 위한 이기종 인터페이스 결정 엔진 및 아키텍처)

  • Bae, Puleum;Jo, Yeong-Myeong;Moon, Eui-Kyum;Ko, Young-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.2
    • /
    • pp.313-324
    • /
    • 2015
  • In this paper, in order to support the construction of a smart home environment of low power consumption, we propose a heterogeneous interface determination engine and architecture. Technology of "smart home" is in the spotlight according to the development of IT technology nowadays. Smart homes are configured with multiple sub-networks, and each sub-network is formed by the smart devices using various communication interfaces. Thus, in the smart home environment, interlocking technology between heterogeneous interfaces is essentially required for supporting communication between different networks. Further, each communication interface is a difference in power consumption, and home smart devices are often operated in 24 hours, especially smart phones and other wireless devices are sensitive to power consumption. Therefore, in order to build a energy efficient home network, It is important to select the appropriate interface to handle traffic depending on the situation. In this paper, we propose "The Heterogeneous Interface Decision Engine and Architecture for constructing of Low Power Home Network," and analyze the performance of the proposed method and verify the validity through experiments on the test bed.

Performance Analysis of an Adaptive Sector System for Terrestrial Station in Ad-hoc Communication System Between Vessels (선박 간 ad-hoc 통신 시스템에서 육상국용 적응 섹터 시스템의 성능 분석)

  • Lee, Hyung-beom;Kim, Seung-geun;Kim, Jun-ho;Kim, Min-sang;Ko, Hak-lim;Im, Tae-ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.263-268
    • /
    • 2016
  • A rapid increase of data amount, used in ship-to-ship transmission of safety and logistics information, ships in the inland sea have trouble transmitting real-time information transmission due to an increase in traffic load caused by data transmitted by land station and offshore ships. In this study, therefore, communication is carried out by adaptively controlling the detailed beam width based on the distribution of offshore ships in land station durable in marine environment. Then after the adaptive sector system enabling real-time communication support between ships concentrated in an inland sea and land station is applied, the performance verification is conducted based on the respective Call Blocking Rates of an omnidirectional antenna, fisted sector system, and adaptive sector system. The performance verification result shows that adaptive sector system has better performance than the fixed sector system as the density of ship, q value, increases, and that the smaller the beam width is, the better performance of adaptive sector system will be.

Efficient Transmission Structure and Key Management Mechanism Using Key Provisioning on Medical Sensor Networks (의료 센서 네트워크에서의 효율적인 전송 구조 및 Key Provisioning을 사용한 키 관리 기법 연구)

  • Seo, Jae-Won;Kim, Mi-Hui;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.3
    • /
    • pp.285-298
    • /
    • 2009
  • According to the development of ubiquitous technologies, sensor networks is used in various area. In particular, medical field is one of the significant application areas using sensor networks, and recently it has come to be more important according to standardization of the body sensor networks technology. There are special characteristics of their own for medical sensor networks, which are different from the one of sensor networks for general application or environment. In this paper, we propose a hierarchical medical sensor networks structure considering own properties of medical applications, and also introduce transmission mechanism based on hierarchical structure. Our mechanism uses the priority and threshold value for medical sensor nodes considering patient's needs and health condition. Through this way Cluster head can transmit emergency data to the Base station rapidly. We also present the new key establishment mechanism based on key management mechanism which is proposed by L. Eschenauer and V. Gligor for our proposed structure and transmission mechanism. We use key provisioning for emergency nodes that have high priority based on patients' health condition. This mechanism guarantees the emergency nodes to establish the key and transmit the urgent message to the new cluster head more rapidly through preparing key establishment with key provisioning. We analyze the efficiency of our mechanism through comparing the amount of traffic and energy consumption with analysis and simulation with QualNet simulator. We also implemented our key management mechanism on TmoteSKY sensor board using TinyOS 2.0 and through this experiments we proved that the new mechanism could be actually utilized in network design.

A Cell Loss Constraint Method of Bandwidth Renegotiation for Prioritized MPEG Video Data Transmission in ATM Networks (ATM망에서 우선 순위가 주어진 MPEG 비디오 데이터 전송시 대역폭 재협상을 통한 셀 손실 방지 기법)

  • Yun, Byoung-An;Kim, Eun-Hwan;Jun, Moon-Seog
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1770-1780
    • /
    • 1997
  • Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

  • PDF

Channel Assignment and Routing using Traffic Profiles in Wireless Mesh Networks (무선 메쉬 네트워크에서 트래픽 프로파일을 고려하는 채널 할당 및 라우팅)

  • Park, Sook-Young;Lee, Sang-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.374-385
    • /
    • 2010
  • Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

Web Prefetching Scheme for Efficient Internet Bandwidth Usage (효율적인 인터넷 대역폭 사용을 위한 웹 프리페칭 기법)

  • Kim, Suk-Hyang;Hong, Won-Gi
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.3
    • /
    • pp.301-314
    • /
    • 2000
  • As the number of World Wide Web (Web) users grows, Web traffic continues to increase at an exponential rate. Currently, Web traffic is one of the major components of Internet traffic. Also, high bandwodth usage due to Web traffic is observed during peak periods while leaving bandwidth usage idle during off-peak periods. One of the solutions to reduce Web traffic and speed up Web access is through the use of Web caching. Unfortunately, Web caching has limitations for reducing network bandwidth usage during peak periods. In this paper, we focus our attention on the use of a prefetching algorithm for reducing bandwidth during peak periods by using off-peak period bandwidth. We propose a statistical, batch, proxy-side prefetching scheme that improves cache hit rate while only requiring a small amount of storage. Web objects that were accessed many times in previous 24 hours but would be expired in the next 24 hours, are selected and prefetched in our scheme. We present simulation results based on Web proxy and show that this prefetching algorithm can reduce peak time bandwidth using off-peak bandwidth.

  • PDF

Design and Performance Analysis of Hybrid Receiver based on System Level Simulation in Backhaul System (백홀 시스템에서 시스템 레벨 시뮬레이션 기반 하이브리드 수신기 설계 및 성능 분석)

  • Moon, Sangmi;Chu, Myeonghun;Kim, Hanjong;Kim, Daejin;Hwang, Intae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.11
    • /
    • pp.3-11
    • /
    • 2015
  • An advanced receiver which can manage inter-cell interference is required to cope with the explosively increasing mobile data traffic. 3rd Generation Partnership Project (3GPP) has discussed network assisted interference cancellation and suppression (NAICS) to improve signal-to-noise-plus-interference ratio (SINR) and receiver performance by suppression or cancellation of interference signal from inter-cells. In this paper, we propose the advanced receiver based on soft decision to reduce the interference from neighbor cell in LTE-Advanced downlink system. The proposed receiver can suppress and cancel the interference by calculating the unbiased estimation value of interference signal using minimum mean square error (MMSE) or interference rejection combing (IRC) receiver. The interference signal is updated using soft information expressed by log-likelihood ratio (LLR). We perform the system level simulation based on 20MHz bandwidth of 3GPP LTE-Advanced downlink system. Simulation results show that the proposed receiver can improve SINR, throughput, and spectral efficiency of conventional system.

A System Recovery using Hyper-Ledger Fabric BlockChain (하이퍼레저 패브릭 블록체인을 활용한 시스템 복구 기법)

  • Bae, Su-Hwan;Cho, Sun-Ok;Shin, Yong-Tae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.2
    • /
    • pp.155-161
    • /
    • 2019
  • Currently, numerous companies and institutes provide services using the Internet, and establish and operate Information Systems to manage them efficiently and reliably. The Information System implies the possibility of losing the ability to provide normal services due to a disaster or disability. It is preparing for this by utilizing a disaster recovery system. However, existing disaster recovery systems cannot perform normal recovery if files for system recovery are corrupted. In this paper, we proposed a system that can verify the integrity of the system recovery file and proceed with recovery by utilizing hyper-ledger fabric blockchain. The PBFT consensus algorithm is used to generate the blocks and is performed by the leader node of the blockchain network. In the event of failure, verify the integrity of the recovery file by comparing the hash value of the recovery file with the hash value in the blockchain and proceed with recovery. For the evaluation of proposed techniques, a comparative analysis was conducted based on four items: existing system recovery techniques and data consistency, able to data retention, recovery file integrity, and using the proposed technique, the amount of traffic generated was analyzed to determine whether it was actually applicable.

Elevator Algorithm Design Using Time Table Data (시간표 데이터를 이용한 엘리베이터 알고리즘 설계)

  • Park, Jun-hyuk;Kyoung, Min-jun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.122-124
    • /
    • 2022
  • Handling Passenger Traffic is the main challenge for designing an elevator group-control algorithm. Advanced control systems such as Hyundai's Destination Selection System(DSS) lets passengers select the destination by pressing on a selecting screen, and the systems have shown great efficiency. However, the algorithm cannot be applied to the general elevator control system due to the expensive cost of the technology. Often many elevator systems use Nearest Car(NC) algorithms based on the SCAN algorithm, which results in time efficiency problems. In this paper, we designed an elevator group-control algorithm for specific buildings that have approximate timetable data for most of the passengers in the building. In that way, it is possible to predict the destination and the location of passenger calls. The algorithm consists of two parts; the waiting function and the assignment function. They evaluate elevators' actions with respect to the calls and the overall situation. 10 different timetables are created in reference to a real timetable following midday traffic and interfloor traffic. The specific coefficients in the function are set by going through the genetic algorithm process that represents the best algorithm. As result, the average waiting time has shortened by a noticeable amount and the efficiency was close to the known DSS result. Finally, we analyzed the algorithm by evaluating the meaning of each coefficient result from the genetic algorithm.

  • PDF