• Title/Summary/Keyword: forwarding time

Search Result 173, Processing Time 0.025 seconds

SDN-Based Packet-Forwarding and Delay Minimization Algorithm for Efficient Utilization of Network Resources and Delay Minimization (네트워크 자원의 효율적인 사용과 지연을 최소화하기 위한 SDN 기반 서비스별 패킷 전송 및 지연 최소화 알고리즘)

  • Son, Jaehyeok;Hong, ChoongSeon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.11
    • /
    • pp.727-732
    • /
    • 2015
  • These days, many researchers are working on Future Internet and a new networking paradigm called Software Defined Networking draws a great attention. In this paper, we redefine Software Defined Networking as Service Defined Networking which means that packets are categorized according to types of services. By using Service Defined Networking, we are not only dealing with the way to utilize the network resources efficiently but we also propose an algorithm to minimize the waiting time for packets to be delivered. This proposed algorithm can solve the delay problem, one of the most significant problems caused by network congestion. Also, since we are adopting Service Defined Networking, network resource utilization can be improved compared to the existing network.

A Hierarchical Data Dissemination Protocol in Large-Scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 계층적 데이터 전달 프로토콜)

  • Chu, Seong-Eun;Kang, Dae-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1505-1510
    • /
    • 2008
  • In large-scale wireless sensor networks, the deployed nodes cannot be replaced or recharged after first deployment. Also, dead nodes maγ lead to the partition of whole networks. While performing data dissemination under a battery power constraint, energy efficiency is a key design factor of routing protocol. As a solution for the efficient data dissemination, in this paper, we propose a protocol namely Hierarchical Data Dissemination (HDD) which provides scalable and efficient data delivery to multiple sources and mobile sinks. HDD uses the facts that sink nodes are central gathering Points and source-centric data forwarding paths are constructed and it is maintained with two-tier communications. The performance of HDD is compared with TTDD about the energy consumption, data delivery time and data success ration. The extensive simulation results show that HDD Routing Protocol outperforms TIDD by more than $1.5{\sim}3times$ on energy consumption.

A Study on the Development of Curation Services of Specialized Library (특화도서관의 큐레이션 서비스 개발에 관한 연구)

  • Kwak, Woojung;Noh, Younghee
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.30 no.1
    • /
    • pp.53-75
    • /
    • 2019
  • This study has examined the policy status of the specialized libraries and analyzed the status of curation services of libraries and similar institutions and portals, and proposed policy directions for the curation services provision of the specialized libraries. As for the results of this study, first, curation information is collected and selected through the participation of various curators, and the curation information is regularly updated on the websites and online gateways toward maximizing the perception of the book collections in place and the use of collections. Second, the scope of the specialized libraries' curation services are diversified, such as research support services, one-on-one customized curation services, and book curation. Third, digital curation services are constructed in connection with specialized themes. Fourth, beacon is installed inside, and based on the information received from the information forwarding media, individualized user services are provided via such data as the scope of movement of the users and the time entailed for dwelling in a space.

Implementation of Smart Automatic Warehouse to Improve Space Utilization

  • Hwa-La Hur;Yeon-Ho Kuk;Myeong-Chul Park
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.10
    • /
    • pp.171-178
    • /
    • 2023
  • In this paper, we propose a smart automated warehouse to maximize space utilization. Previous elevator-type automatic warehouses were designed with a maximum payload of 100kg on trays, which has the problem of extremely limiting the number of pallets that can be loaded within the space. In this paper, we design a smart warehouse that can maximize space utilization with a maximum vertical stiffness of 300kg. As a result of the performance evaluation of the implemented warehouse, the maximum payload was 500.6kg, which satisfied the original design and requirements, the lifting speed was 0.5m/s, the operating noise of the device was 67.1dB, the receiving and forwarding time of the pallet was 36.92sec, the deflection amount was 4mm, and excellent performance was confirmed in all evaluation items. In addition, the PLC control method, which designs the control UI and control panel separately, was integrated into the PC system to improve interoperability and maintainability with various process management systems. In the future, we plan to develop it into a fully automatic smart warehouse by linking IoT sensor-based logistics robots.

Distributed Construction of the Recrystallization Topology and Efficient Searching in the Unstructured Peer-to-Peer Network (재결정 위상의 분산적 구성과 비구조적 피어투피어 망에서의 효율적 검색)

  • Park, Jae-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.251-267
    • /
    • 2008
  • In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

A Method for Reducing Path Recovery Overhead of Clustering-based, Cognitive Radio Ad Hoc Routing Protocol (클러스터링 기반 인지 무선 애드혹 라우팅 프로토콜의 경로 복구 오버헤드 감소 기법)

  • Jang, Jin-kyung;Lim, Ji-hun;Kim, Do-Hyung;Ko, Young-Bae;Kim, Joung-Sik;Seo, Myung-hwan
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.280-288
    • /
    • 2019
  • In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

Energy-Efficient Data-Aware Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 데이터 인지 라우팅 프로토콜)

  • Lee, Sung-Hyup;Kum, Dong-Won;Lee, Kang-Won;Cho, You-Ze
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.122-130
    • /
    • 2008
  • In many applications of wireless sensor networks, sensed data can be classified either normal or urgent data according to its time criticalness. Normal data such as periodic monitoring is loss and delay tolerant, but urgent data such as fire alarm is time critical and should be transferred to a sink with reliable. In this paper, by exploiting these data characteristics, we propose a novel energy-efficient data-aware routing protocol for wireless sensor networks, which provides a high reliability for urgent data and energy efficiency for normal data. In the proposed scheme, in order to enhance network survivability and reliability for urgent data, each sensor node forwards only urgent data when its residual battery level is below than a threshold. Also, the proposed scheme uses different data delivery mechanisms depending on the data type. The normal data is delivered to the sink using a single-path-based data forwarding mechanism to improve the energy-efficiency. Meanwhile, the urgent data is transmitted to the sink using a directional flooding mechanism to guarantee high reliability. Simulation results demonstrate that the proposed scheme could significantly improve the network lifetime, along with high reliability for urgent data delivery.

Link-layer Assisted Seamless Media Streaming over Mobile IP-enabled Wireless LAN (Mobile IP 지원 무선 랜 상에서 링크 계층의 지원을 통한 연속적인 미디어 스트리밍)

  • Lee, Chul-Ho;Lee, Dong-Wook;Kim, Jong-Won
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.9
    • /
    • pp.626-636
    • /
    • 2009
  • In Mobile IP-enabled wireless LAN (WLAN), packet flows are corrupted due to the handoff of a mobile node (MN) at the link and network layers, which results in burst packet losses and can cause temporary buffer underflow in a streaming client at the MN. This transient behavior hurts time-sensitive streaming media applications severely. Among many suggestions to address this handoff problem, few studies are concerned with empirical issues regarding the practical validation of handoff options on the time-sensitive streaming media applications. In this paper, targeting seamless streaming over Mobile IP-enabled WLAN, we introduce a seamless media streaming framework that estimates accurate pre-buffering level to compensate the handoff latency. In addition, we propose a link-layer (L2) assisted seamless media streaming system as a preliminary version of this framework. The proposed system is designed to reduce the handoff latency and to overcome the playback disruption from an implementation viewpoint. A packet buffering and forwarding mechanism with L2 trigger is implemented to reduce the handoff latency and to eliminate burst packet losses generated during the handoff. A pre-buffering adjustment is also performed to compensate the handoff latency. The experimental results show that the proposed approach eliminates packet losses during the handoff and thus verify the feasibility of seamless media streaming over Mobile IP-enabled WLAN.

ANC Caching Technique for Replacement of Execution Code on Active Network Environment (액티브 네트워크 환경에서 실행 코드 교체를 위한 ANC 캐싱 기법)

  • Jang Chang-bok;Lee Moo-Hun;Cho Sung-Hoon;Choi Eui-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9B
    • /
    • pp.610-618
    • /
    • 2005
  • As developed Internet and Computer Capability, Many Users take the many information through the network. So requirement of User that use to network was rapidly increased and become various. But it spend much time to accept user requirement on current network, so studied such as Active network for solved it. This Active node on Active network have the capability that stored and processed execution code aside from capability of forwarding packet on current network. So required execution code for executed packet arrived in active node, if execution code should not be in active node, have to take by request previous Action node and Code Server to it. But if this execution code take from previous active node and Code Server, bring to time delay by transport execution code and increased traffic of network and execution time. So, As used execution code stored in cache on active node, it need to increase execution time and decreased number of request. So, our paper suggest ANC caching technique that able to decrease number of execution code request and time of execution code by efficiently store execution code to active node. ANC caching technique may decrease the network traffic and execution time of code, to decrease request of execution code from previous active node.

Study on the changes of sulfamethnzine residues in serum and practical organs of rats orally administrated with sulfamethnzine sodium (Rat에 sulfamethazine sodium 경구투여 후 혈청 및 실질장기내 sulfamethazine의 잔류량 추이에 관한 연구)

  • 도재철;이영미;조민희;신상희;박희주;송희종;정종식
    • Korean Journal of Veterinary Service
    • /
    • v.23 no.4
    • /
    • pp.321-333
    • /
    • 2000
  • In order to know the depletive changes of sulfamethazine residues in senlm and practical organs of rats orally administered with sulfamethazine sodium(SMS), the concentration of sulfamethazine was measured in serum and tissue(kidney, liver, spleen, testis, and skeletal muscle) of rats with using high performance liquid chromatography(HPLC). SMS was orally administrated to sprague-dawley male rats(body weight, 200~300g) with using sonde at the rate of 20mg/100g body weight(recommended therapeutic dose) on once a day for 3 days. There were investigated the depletive changes of the sulfamethazine in serum, kidney, liver, spleen, testis and skeletal muscle of rat at the time 8 hours, 1st, 2nd, 3rd, 4th, 5th and 6th day after administration SMS, respectively. The results obtained were summarized as follows; 1. After oral administration of the SMS, the mean concentrations of sulfamethazine in serum according to the time lapsed were showed 215.53$\pm$42.99ppm at the 8 hours after withdrawal of medicated sulfamethazine. And gradually according to the time lapsed, the concentrations of sulfamethazine residues in serum were significantly (p<.05) decreased 25.87$\pm$5.18ppm at 1st day, 2.30$\pm$0.61ppm at 3rd day and 0.11$\pm$0.02ppm at 6th day respectively. 2. The mean concentrations of sulfamethazine in kidney, liver, spleen, muscle and testis according to the time lapsed after administration SMS were showed 83.82$\pm$12.16, 81.77$\pm$12.88, 36.96$\pm$5.35, 35.96$\pm$TEX>$\pm$1.39 and 27.89$\pm$1.92 ppm at the 8 hours, respectively. And gradually according to the time lapsed, the concentrations of sulfamethazine residues in the each of samples were significantly(p<.05) decreased such as 7.15$\pm$0.26, 5.62$\pm$0.72, 2.43$\pm$0.29, 1.99$\pm$0.14 and 3.11$\pm$0.48 ppm at 1st day, 0.52$\pm$0.04, 1.32$\pm$0.22, 0.13$\pm$0.03, 0.15$\pm$0.06 and 0.26$\pm$0.11ppm at 3rd day, and 0.03$\pm$0.01, 0.11$\pm$0.03, 0.02$\pm$0.01, 0.009$\pm$0.001 and 0.02$\pm$0.01 ppm at 6th day, respectively. 3. After oral administration of the SMS to rats, the residual concentrations of sulfamethazine in skeletal muscle were significantly (p<.05) decreased 35.96$\pm$1.39 to 0.009$\pm$$\pm$0.001 ppm between 8 hours and 6th day, respectively From the 4th day, the residual concentrations of sulfamethazine were showed 0.10$\pm$0.04 ppm below 0.1 ppm at the permitted limit concentration of muscle in Korea. In conclusion, this study could be suggested the relationship between administrated period, doses of sulfonamides and residual aspects of serum and practical organs, and the importance of observing ceasing period of antibiotic drugs before forwarding livestocks to slaughter.

  • PDF