• Title/Summary/Keyword: in-network join

Search Result 156, Processing Time 0.024 seconds

Clustered Segment Index Scheme for P2P VOD Service on Virtual Mesh Overlay Network (가상 메시 오버레이 네트워크상에서의 P2P VOD 서비스를 위한 클러스터 세그먼트 인덱스 기법)

  • Lim, Pheng-Un;Choi, Hwang-Kyu
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.6
    • /
    • pp.1052-1059
    • /
    • 2016
  • Video-on-Demand(VoD) is one of the most popular media streaming which attracted many researchers' attention. VMesh is one of the most cited works in the field of the VoD system. VMesh is proposed to solve the problem of random seeking functionality. However, a large number of the DHT(Distributed Hash Table) searches in VMesh is sill the main problem which needs to be solved. In order to reduce the number of the DHT searches, the clustered segment index(CSI) scheme is proposed. In this scheme, the video segments are divided into clusters. The segment information of the video segments, which are clustered into the same cluster, are stored in the same clustered segment index that can be searched by using the hash key. Each peer also can request the required segments by using this clustered segment index. The experiment results show that the number of the DHT searches in the proposed scheme is less than that of VMesh even in case of peers leave and join the network or peers perform the fast forward/backward operations.

Protocol supporting Variable-length Message using Pre-reservation Slots in WDM Local Network (WDM Local Network에서 선예약슬롯을 이용한 가변길이 메시지 지원 프로토콜)

  • Hwang, In-hwan;Shuin, Eui-jung;Jin, Kyo-hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.119-124
    • /
    • 2001
  • A new WDM-based protocol for scheduling a variable-length message is proposed in this paper. Two control slots, Pre-reservation slot and Reservation Slot, are used to coordinate transmission and diminish the collisions of packet to minimize the access delay. When there is an idle reservation slot, a control packet is transmitted on that slot and message is transferred. And the node continues to transmit its control packet through the corresponding slot every cycle, until the message is completely transmitted. If an idle reservation slot is not available, the node schedules the transmission time of message in earliest available time using Pre-reservation slots. The proposed scheduling protocol has several advantages; any new node can join the network anytime without network re-initialization. Moreover, with the pre-reservation slots, we can avoid the packet collisions and destination conflicts, and we can improve the access delay time for message transmissions.

  • PDF

Design of a Trackable Buoy System using Join Request Messages (가입요청 메시지를 사용하는 추적 가능한 부표 시스템의 설계)

  • Cho, SungHo
    • Journal of Satellite, Information and Communications
    • /
    • v.11 no.2
    • /
    • pp.8-13
    • /
    • 2016
  • A buoy is a float attached by chain to the seabed to mark channels in a harbor or underwater hazards and can be classified into two major types as autonomous buoys and fixed buoys. When there is high demand such as marking channels in a harbor, monitoring ecology of ocean and environmental monitoring of coastal areas, smart buoys are developed. The smart buoys have wireless network systems such as GPS, CDMA and ZigBee. Using the GPS techniques, location and environments of buoy can be monitored and traced. However, the GPS in fixed buoy systems has a high power consumption and cost. Using many buoys on low power ZigBee basis allows dramatic reduction of the overall power consumption. In this study, it is aimed at the design of the trackable protocol for a buoy system which has low data rate and low power consumption. The proposed protocol has advantages that it can detect abnormal movement and gather trackable information without any system changes. In the introduced protocol, additional 2 bits and join request messages are used for trackable buoy system. The behaviors of improved protocol is modeled into petri-net and proved a reachability.

A Study of Process Parameters Optimization Using Genetic Algorithm for Nd:YAG Laser Welding of AA5182 Aluminum Alloy Sheet (AA5182 알루미늄 판재의 Nd:YAG 레이저 용접에서 유전 알고리즘을 이용한 공정변수 최적화에 대한 연구)

  • Park, Young-Whan;Rhee, Se-Hun;Park, Hyun-Sung
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.1322-1327
    • /
    • 2007
  • Many automotive companies have tried to apply the aluminum alloy sheet to car body because reducing the car weight can improve the fuel efficiency of vehicle. In order to do that, sheet materials require of weldablity, formability, productivity and so on. Aluminum alloy was not easy to join these metals due to its material properties. Thus, the laser is good heat source for aluminum alloy welding because of its high heat intensity. However, the welding quality was not good by porosity, underfill, and magnesium loss in welded metal for AA5182 aluminum alloy. In this study, Nd:YAG laser welding of AA 5182 with filler wire AA 5356 was carried out to overcome this problem. The weldability of AA5182 laser welding with AA5356 filler wire was investigated in terms of tensile strength and Erichsen ratio. For full penetration, mechanical properties were improved by filler wire. In order to optimize the process parameters, model to estimate tensile strength by artificial neural network was developed and fitness function was defined in consideration of weldability and productivity. Genetic algorithm was used to search the optimal point of laser power, welding speed, and wire feed rate.

  • PDF

The Embeddedness of Farmers Groups in Rural Areas : The Case of an Organic Farmers Group in Asan City (지역농업 추진주체의 형성 및 발전과정 -아산시 친환경농업 생산자 단체의 사례-)

  • Kim, Tae-Yeon
    • Korean Journal of Organic Agriculture
    • /
    • v.15 no.2
    • /
    • pp.131-150
    • /
    • 2007
  • This study explores the development process of an farmers' group in Asan City that now plays an important role in the development of organic farming of the region. While increase in income in general may be one of main purposes making farmers join or form a group, the farmers group in Asan, instead, has tried to form a cooperative of local organic farmers. In doing so, they experienced a lot of difficulties and leant by trial and error. As a result, the farmers' group has recently developed in terms of business and organisational growth. The growth is not merely due to the growth of organic food markets but also due to the strong internal ties and trust that made possible to expand into food processing as well as to do social and cultural activities fur the rural residents. It implies that trust and cooperative identity between farmers should be the most important thing to be locally embedded farmers groups in a specific region.

  • PDF

An Energy Efficient Algorithm Based on Clustering Formulation and Scheduling for Proportional Fairness in Wireless Sensor Networks

  • Cheng, Yongbo;You, Xing;Fu, Pengcheng;Wang, Zemei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.559-573
    • /
    • 2016
  • In this paper, we investigate the problem of achieving proportional fairness in hierarchical wireless sensor networks. Combining clustering formulation and scheduling, we maximize total bandwidth utility for proportional fairness while controlling the power consumption to a minimum value. This problem is decomposed into two sub-problems and solved in two stages, which are Clustering Formulation Stage and Scheduling Stage, respectively. The above algorithm, called CSPF_PC, runs in a network formulation sequence. In the Clustering Formulation Stage, we let the sensor nodes join to the cluster head nodes by adjusting transmit power in a greedy strategy; in the Scheduling Stage, the proportional fairness is achieved by scheduling the time-slot resource. Simulation results verify the superior performance of our algorithm over the compared algorithms on fairness index.

Synchronous Reservation Protocol for Variable-sized Messages in a WDM-based Local Network (WDM 망에서 가변 길이의 메시지 전송을 위한 동기 예약 프로토콜)

  • Lee, Jae-Hwoon;Rim, Min-Joong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.6
    • /
    • pp.1-10
    • /
    • 2001
  • In this paper, we propose a synchronous reservation protocol that is efficient for supporting variable sized messages in a wavelength division multiplexing (WDM) based local network using a passive star topology. A. control channel is used to coordinate transmission on data channels. Time is slotted with fixed-sized slots. The network can accommodate a variable number of nodes, and can operate independently of the change of the number of nodes. So, any 'new' node can join the network anytime without network re-initialization. Moreover, with the protocol, we can avoid data channel and destination conflicts. We analyze the performance by using EPA method according to the variation of the end to end propagation delay with respect to one slot time, and validate the results by simulation.

  • PDF

Bounds for Stationary Waiting Times in a Class of Queueing Networks using Stochastic Ordering (확률적 순서를 이용한 대기행렬 망에서 안정 대기시간의 범위)

  • Seo Dong-Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.4
    • /
    • pp.1-10
    • /
    • 2004
  • In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.

A Study on Innovation and Competitive Strategy in Network-Based Economy: Case Analysis on Network Effects, Incremental Innovation in Korean Mobile Telecommunication Industry (네트워크 경제 하에서 혁신과 경쟁 전략에 대한 기반 연구: 한국 이동통신 산업 사례를 중심으로)

  • An, Kwang-Jun;Shin, Dong-Hyung
    • Journal of Korea Technology Innovation Society
    • /
    • v.11 no.2
    • /
    • pp.145-170
    • /
    • 2008
  • The existence of network is indeed the single most important factor that brings about new business phenomena in the new digital economy, especially in the IT industry. Network effect refers to a phenomenon that the increase in size of the network leads to increased network value and user utility. It determines the competitive structure of an industry and the performances of industry competitors (Shapiro and Varian, 1999). The phenomenon of increasing returns and winner-take-all enjoyed by the early winner in the competition can be attributed to the existence of positive feedback which increases the value of network and induces more users into join the network (Arthur, 1996; Shapiro and Varian, 1999; Song and Lee, 2003). This research attempts to shed light on the topic of innovation and competitive strategy of network-based industries. We analyze the case of the Korean mobile communications industry, in which a shift in technological paradigm from 2G to 3G brought new changes to the competitive structure of the industry. The Korean mobile communications industry makes an ideal case for analysis since it is an industry whose value is inherently dependent upon its user network. It is characterized by the typical increasing returns, in which a monopolizing player is enjoying firstmover's network effects. Because of the existence of network in the mobile communications industry, latecomers' disruptive innovations could not outcompete the incumbent's sustaining innovations. The contribution of this research lies in laying a groundwork for future studies by introducing a numerical simulation model to analyze the complexity theory and network effect.

  • PDF

FI-Based Local Group Key Generation/Distribution for Mobile Multicast in a Hierarchical Mobile IPv6Network

  • Baek, Jin-Suk;Fisher, Paul S.;Kwak, Ming-Yung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.1
    • /
    • pp.5-21
    • /
    • 2008
  • In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.