• Title/Summary/Keyword: join cost

Search Result 133, Processing Time 0.025 seconds

An Effective Multicast Services Mechanism for Proxy Mobile IPv6 Networks (PMIPv6 환경에서 효율적인 멀티캐스트 서비스 메커니즘)

  • Choi, Sung-Uk
    • Journal of Digital Contents Society
    • /
    • v.12 no.1
    • /
    • pp.11-21
    • /
    • 2011
  • The PMIPv6 protocol that has been recently presented as an alternative for the MIPV6 has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose an effective scheduling for multicast services based on the PMIPv6 with hand-over mechanism. it provides an additional function that is able to change multicast join processes dynamically in accordance with MAG status. in order to evaluate the ability of the proposed scheme's We test the performance of hand-over and node join costs with similar techniques. The result of simulation shows improves about 13~35% of performance.

A Node Management Scheduling for Efficient Guarantee of QOS based on Overlay Multicast Environment (오버레이 멀티캐스트 환경에서 효율적인 QOS의 보장을 위한 노드관리 스케줄링)

  • Choi, Sung-Uk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1614-1620
    • /
    • 2009
  • The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

Multicast Routing and Cost Model with Source Mobility in Mobile IPv6 Networks (Mobile IPv6망에서 소스 이동성을 갖는 멀티캐스트 라우팅 및 비용모델)

  • Park Byoung-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.197-203
    • /
    • 2004
  • In mobile network, the maintenance o( host grouping or the multicast delivery tree for multicasting algorithm becomes a major issues. In this paper, we explore the issues of mobile Multicast scheme using Mobile-IPv6, and addresses case when a mobile host is a source as well as a recipient of a given multicast operation using MLD(Multicast Listener Discovery) scheme, and the proposed MLD-based multicasting protocol asks its HA(Home Agent) to stop forwarding multicast for group using tunneling. We examine and compare our model to existing approaches by proposed cost model, and observe an improved ferformacne.

  • PDF

RFID BASED INTRA SUPPLY CHAIN MANAGEMENT SYSTEM IN TEXTILE INDUSTRY

  • Mateen, Ahmed;Zhu, Qingsheng;Afsar, Salman;Bashir, Salman
    • International Journal of Advanced Culture Technology
    • /
    • v.7 no.3
    • /
    • pp.166-177
    • /
    • 2019
  • Radio Frequency Identification (RFID) skill is becoming a technology that might deliver a response to manual glitches. The use of tags, receiver and wireless surfs to join with each other would mean that RFID in combination with the EPC would speech these pain opinions and offer many welfares in different sectors such as production, distribution, trade, logistics, and security. Potential benefits include increased visibility rising supply chain, enlarged proficiency and cost savings through improved data harmonization, better responsiveness to actual prominence change. Trendy the case of the textile or industrial applications, recent systems used by the industry to control the supply chain in addition strength discernibility are being studied, besides improvements in the overall perceptibility of assets are anticipated through labels, readers, drivers, POEs, etc. this model will be developed with new situations and a lively construction industry. It will be focused on Cost, Hardware compatibility, security and maintenance issues.

A Study on the Cost Reduction Strategy of Aviation Ammunition (항공탄약 구매 비용 절감 방안에 관한 연구)

  • Kim, Yu-Hyun;Eom, Jung-Ho
    • Journal of National Security and Military Science
    • /
    • s.15
    • /
    • pp.57-86
    • /
    • 2018
  • The ROKAF has been training for a number of exercise for victory in the war, but the lack of aviation ammunition has become a big issue every year. However, due to the limitation of defense resources, there are many difficulties in securing and stockpiling ammunition for the war readiness. Therefore, there is a need to find a way to secure aviation ammunition for war readiness in a more economical way, so In this study, we analyze the precedent research case and the case of the reduction of the purchase cost of weapon system of other countries, and then I have suggested a plan that is appropriate for our situation. As a result of examining previous research cases for this study, there were data that KIDA studied in 2012, Precision-guided weapons acquisition cost reduction measures pursued by US Air Force And the use of procurement agencies that are being implemented by NATO member countries. Based on this study, the following four measures were proposed to reduce the purchase cost of aviation ammunition. First, the mutual aid support agreement was developed to sign the ammunition joint operation agreement. Second, join the NATO Support & Procurement Agency (NSPA) Third, it builds a purchasing community centered on the countries operating the same ammunition Fourth, participating in the US Air Force's new purchase plan for ammunition and purchase it jointly. The main contents of these four measures are as follows. 1. the mutual aid support agreement was developed to sign the ammunition joint operation agreement. Korea has signed agreements on mutual logistics support with 14 countries including the United States, Israel, Indonesia, Singapore, Australia, and Taiwan. The main purpose of these agreements is mutual support of munitions and materials, also supporting the training of the peace time and promoting exchange and cooperation. However, it is expected that there will be many difficulties in requesting or supporting mutual support in actual situation because the target or scope of mutual aid of ammunition is not clearly specified. Thus, a separate agreement on the mutual co-operation of more specific and expanded concepts of aviation ammunition is needed based on the current mutual aid support agreements 2. join the NATO Support & Procurement Agency (NSPA) In the case of NATO, there is a system in which member countries purchase munitions at a low cost using munitions purchase agencies. It is the NATO Purchasing Agency (NSPA) whose mission is to receive the purchasing requirements of the Member Nations and to purchase them quickly and efficiently and effectively to the Member Nations. NSPA's business includes the Ammunition Support Partnership (ASP), which provides ammunition purchase and disarming services. Although Korea is not a member of NATO, NSPA is gradually expanding the scope of joint procurement of munitions, and it is expected that Korea will be able to join as a member. 3. it builds a purchasing community centered on the countries operating the same ammunition By benchmarking the NSPA system, this study suggested ways to build a purchasing community with countries such as Southeast Asia, Australia, and the Middle East. First, it is necessary to review prospectively how to purchase ammunition by constructing ammunition purchasing community centered on countries using same kind of ammunition. 4. participating in the US Air Force's new purchase plan for ammunition When developing or purchasing weapons systems, joint participation by several countries can reduce acquisition costs. Therefore, if the US Air Force is planning to acquire aviation ammunition by applying it to the purchase of aviation ammunition, we will be able to significantly reduce the purchase cost by participating in this plan. Finally, there are some limitations to the method presented in this study, but starting from this study, I hope that the research on these methods will be actively pursued in the future.

  • PDF

Dynamic Management of Equi-Join Results for Multi-Keyword Searches (다중 키워드 검색에 적합한 동등조인 연산 결과의 동적 관리 기법)

  • Lim, Sung-Chae
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.229-236
    • /
    • 2010
  • With an increasing number of documents in the Internet or enterprises, it becomes crucial to efficiently support users' queries on those documents. In that situation, the full-text search technique is accepted in general, because it can answer uncontrolled ad-hoc queries by automatically indexing all the keywords found in the documents. The size of index files made for full-text searches grows with the increasing number of indexed documents, and thus the disk cost may be too large to process multi-keyword queries against those enlarged index files. To solve the problem, we propose both of the index file structure and its management scheme suitable to the processing of multi-keyword queries against a large volume of index files. For this, we adopt the structure of inverted-files, which are widely used in the multi-keyword searches, as a basic index structure and modify it to a hierarchical structure for join operations and ranking operations performed during the query processing. In order to save disk costs based on that index structure, we dynamically store in the main memory the results of join operations between two keywords, if they are highly expected to be entered in users' queries. We also do performance comparisons using a cost model of the disk to show the performance advantage of the proposed scheme.

Distributed Hierarchical Location Placement of Core Nodes in the OCBT Multicast Protocol (OCBT 멀티캐스트 프로토콜에서 core 노드의 분산 계층 위치 결정)

  • 황경호;조동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.90-95
    • /
    • 2000
  • In the Ordered Core Based Tree(OCBT) protocol, a core location is the most important feature to affect the performance. In this paper, the location placement of multiple level cores is studied. The proposed algorithm isthat each node in the network evaluates a sum of shortest path costs from all the other nodes and the entirenetwork is divided into a hierarchy region to have 3-logical level(Small, Medium, Large). The node to have thelowest cost in each S-Region is decided to be a core node. Then, the core nodes in the each S-Region evaluatea sum of shortest path costs from all the other core nodes in the same M-Region. The core node to have thelowest cost is decided to be the upper level core node. Similarly the highest level core node is decided in theL-Region. The proposed algoritthm is compared with conventional two methods to put the core nodes in thenetwork One is the random method to put the core nodes randomly. The other is the center method to locatethe core node at the nearest node from the center of each S-Region and then to locate the highest level corenode at the nearest core node from the center of the entire network. Extensive simulations are performed in theview of mean tree cost and join latency. Simulation results show that the proposed algorithm has betterperformance than random method or center method.

  • PDF

Mobile Multicast Method using the User Pattern (사용자 성향에 기반한 이동 멀티캐스트 기법)

  • Sung Sulyun;Jeon Jinyong;Seo Yuhwa;Shin Yongtae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1A
    • /
    • pp.46-54
    • /
    • 2005
  • This paper presents an effcient mobile multicast method using the user pattern. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

Optimal Number of Super-peers in Clustered P2P Networks (클러스터 P2P 네트워크에서의 최적 슈퍼피어 개수)

  • Kim Sung-Hee;Kim Ju-Gyun;Lee Sang-Kyu;Lee Jun-Soo
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.481-490
    • /
    • 2006
  • In a super-peer based P2P network, The network is clustered and each cluster is managed by a special peer, called a super-peer which has information of all peers in its cluster. This clustered P2P model is known to have efficient information search and less traffic load. In this paper, we first estimate the message traffic cost caused by peer's query, join and update actions within a cluster as well as between the clusters and with these values, we present the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.rks.

Maskless Screen Printing Process using Solder Bump Maker (SBM) for Low-cost, Fine-pitch Solder-on-Pad (SoP) Technology

  • Choi, Kwang-Seong;Lee, Haksun;Bae, Hyun-Cheol;Eom, Yong-Sung
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.20 no.4
    • /
    • pp.65-68
    • /
    • 2013
  • A novel bumping process using solder bump maker (SBM) is developed for fine-pitch flip chip bonding. It features maskless screen printing process. A selective solder bumping mechanism without the mask is based on the material design of SBM. Maskless screen printing process can implement easily a fine-pitch, low-cost, and lead-free solder-on-pad (SoP) technology. Its another advantage is ternary or quaternary lead-free SoP can be formed easily. The process includes two main steps: one is the thermally activated aggregation of solder powder on the metal pads on a substrate and the other is the reflow of the deposited powder on the pads. Only a small quantity of solder powder adjacent to the pads can join the first step, so a quite uniform SoP array on the substrate can be easily obtained regardless of the pad configurations. Through this process, an SoP array on an organic substrate with a pitch of 130 ${\mu}m$ is, successfully, formed.