• Title, Summary, Keyword: Hub Connection

Search Result 53, Processing Time 0.035 seconds

Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.59-64
    • /
    • 2016
  • This paper suggests heuristic algorithm with O(mn) polynomial time complexity using Excel for partially survivable networks optimization problem of cellular telecommunication systems with m cells and n hubs. This problem only can be get the solution using linear programming or LINGO software package. The proposed algorithm connects the cell to hubs in ring network with minimum cost as the connection diversity of each cell. If the traffic of ring network (T) is T>2K for ring capacity (K), we adjust the maximum cost hub to MTSO that has a ascending order of (D/DC)/${\Delta}^+$ cell with each cell traffic demand (D) and ${\Delta}^+$=(MTSO cost-maximum cost hub) than we get the $T{\leq}2K$. Finally, we adjust MTSO to the removed maximum cost hub for the cell with 2K-$T{\geq}$(D/DC) and $_{max}{\Delta}^-$. While we using like this simple method, the proposed algorithm can be get the same optimal solution for experimental data as linear programing and LINGO software package.

An Analysis for Transferring Connectivity at Incheon international Airport (허브공항의 환승연계성 분석연구(인천국제공항을 대상으로))

  • Park, Yong-Hwa;Kim, Seong-Yeong;Kim, Jung-Yeop
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.6
    • /
    • pp.75-85
    • /
    • 2006
  • Recently. large number of countires have been focused on the construction of container seaport and hub airport to enrole as the center of logistics. In particular, the East Asian nations have been enhanced their airports' facilities in order to accommodate for demand of global market environment. In Korea, Incheon International Airport (ICN) was opened in 2001 to take leading role as the Northeast Asian main hub airport. The purpose of this research is to analyze the transferring connectivity at ICN. To analyze its connectivity, this research has been applies two methodologies ; wane structure and minimum or maximun connection time analysis It has analyzed the temporal configuration as the frequency and quality of indirect connections offered by an airline by adopting a wave-system structure in the airline flight schedule. As an empirical analysis, it also calculated the minimum and maximum connection time adopting Korean Air's flight information.

A Study on Succeeding Together-Busan North & New Port (부산 북항-신항 연계발전 방안)

  • Song, Gye-Eui
    • Journal of Korea Port Economic Association
    • /
    • v.27 no.2
    • /
    • pp.313-331
    • /
    • 2011
  • Due to have been more keen in East-North Asia Hub Port competition, to be accelerated Busan New Port development, and to result to supply excess position, Busan port has been confronted by many problems. Also, as facilities of North Port is old, it is impossible to secure 16m depth of water at North Port, and North Port redevelopment is being, container traffic of North Port is accelerated to shift at New Port. Therefore, it. is time to seek for connection growth plan of succeeding together-Busan North & New Port as soon as possible. Connection growth plan of succeeding together-Busan North & New Port is focused, as follows. First, it is required to set up model for connection growth plan of succeeding together-Busan North & New Port. It is valid to specialize for ULCC, to promote to global port at New Port, and it is effective to focus on feeder service and general cargo handling, and to include most space to North Port redevelopment. Second, through port function reorganization, it is required to create a synergy by port function clustering. Third, through effective connection traffic network expansion for moving T/S cargo effectively, it is required to develop Busan Port for T/S cargo-focused port. Fourth, it is required to develop port hinterland logistics zone for creating container traffic through connection development of New Port-BJFEZ. Finally, it is required to build SCM system for creating container traffic among shipper, carrier, freight forwarder and related institution.

The Way of IoT Management Hub Connection for Convenient IoT Service (편리한 사물인터넷 서비스를 위한 IoT 관리 허브 연결 방법)

  • Kim, Sang-hyun;Kim, Young-don;Lee, Chang-seok;Lee, Dong-ho;Park, Hyun-ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2656-2664
    • /
    • 2015
  • IoT management hub has to request the WLAN AP list of the accessible areas in a place that is installed, or choose a specific WLAN AP you want to connect in order to be connected to the Internet. the specific method also is required to input the password when the security key was set. As that way, IoT management hub needs both the display device and the input device to see the list of WLAN AP and to input the security key. If the IoT management hub is consist of them, It is difficult to achieve the objective of the miniaturization and cost reduction. In this paper, we propose a method to connect to a WLAN AP network using a smart-phone without the display device and the input device.

Algorithm for the ATM Switching Node Location Problem (ATM 교환기의 위치 선정 문제에 관한 연구)

  • 김덕성;이경식;박성수;박경철
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.3
    • /
    • pp.93-107
    • /
    • 1999
  • We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

  • PDF

Analyzing the Airfreight Transshipment Connectivity at Incheon Airport (인천국제공항의 환적화물에 대한 연계성 분석 연구)

  • Kim, Joong-Yup;Park, Yong-Hwa
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.117-127
    • /
    • 2008
  • After the deregulation of the aviation market in the United States in 1978, airlines took advantage of the possibilities of the liberalized market and reorganized their networks. Then, the hub-and-spoke networks became widely used in the aviation market. The framework of hub-and-spoke network made it feasible to amplify flight networks. Thus, a number of airlines were able to fly to more destinations than ever before through the networks. Amplification of networks can be implementing through the transfer of passengers, transshipment of cargo, or both most researches have been concentrated on the passenger aspect at airports worldwide. Air cargo, however, has become one of the most significant areas at hub airports to keep their leading position in terms of the provision of services and handling volumes. This paper investigates the connectivity of airfreight networks as the temporal concentrations in current network at Incheon International Airport. In order to evaluate airline flight schedule effects to stimulate hubbing at an airport, the indirect connectivity can be considered to be the number of direct frequencies, the minimum connecting times and the quality of the connection determine indirect connectivity. Therefore the connectivity of freight transshipment depends on both the quality of the connection at the hub airport and the quality of the indirect flight compared to the direct flight. In addressing these issues, this paper analyzes the connectivity of flight schedules using a temporal wave-system structure and estimates the degree of connectivity and quality of connectivity applying the NETSCAN model.

The mobile and modular GFRP-membrane-structure with the new innovative connection system (새로운 GFRP접합 시스템을 이용한 멤브레인 파빌리옹)

  • Knippers, Jan;Park, Don-U;Hub, Alexander;Hwang, Kyung-Ju
    • Journal of The Korean Association for Spatial Structures
    • /
    • v.5 no.2
    • /
    • pp.7-15
    • /
    • 2005
  • Currently, the structural material, namely glass fiber reinforced polymer (GFRP) is focused on innovative structure due to lightness, excellent workability and noncorrosive characteristics, etc. However, the lack of GFRP connection technology produces only an imitation of steel and wood structures. This uses univentive design principles as well as unsuitable material applications, causes tons of surplus of materials to be wasted, and results in uneconomical structures, because the characteristics between steel and GFRP are completely different. Thus, this research develops the new, innovative GFRP connection system with considerations of the characteristics of GFRP and adopts it to a mobile und modular membrane pavilion.

  • PDF

Design and Implementation of u-Learning Hub Site based on Learning Activity Oriented Components (학습활동 중심의 컴포넌트 기반 u-러닝 허브 사이트 설계 및 구현)

  • Park, Chan;Seong, Dong-Ook;Jang, Young-Hee;Lee, Hye-Jin;Yoo, Jae-Soo;Yoo, Kwan-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.446-454
    • /
    • 2009
  • In this paper, we propose u-learning hub site systems which are designed and implemented based on learning activities oriented components. The proposed systems are composed of component which can process the functionalities for coming into action of learning activities through various devices. Specially, each component is broken into class units by which learning activities of users can be performed on various devices. When users try to connect u-learning system in hub site, the system explores devices of users and connection program and then selects components that are fit to the activities and combines them in realtime. Through the methodology of u-learning hub site, the system proposed in this paper provides u-learning environment so that users can use the learning activity services taking no influence on time, place, devices and programs under the consistent system. That is different to traditional e-learning system which cannot support various devices of users directly.

A Graph Layout Algorithm for Scale-free Network (척도 없는 네트워크를 위한 그래프 레이아웃 알고리즘)

  • Cho, Yong-Man;Kang, Tae-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.5_6
    • /
    • pp.202-213
    • /
    • 2007
  • A network is an important model widely used in natural and social science as well as engineering. To analyze these networks easily it is necessary that we should layout the features of networks visually. These Graph-Layout researches have been performed recently according to the development of the computer technology. Among them, the Scale-free Network that stands out in these days is widely used in analyzing and understanding the complicated situations in various fields. The Scale-free Network is featured in two points. The first, the number of link(Degree) shows the Power-function distribution. The second, the network has the hub that has multiple links. Consequently, it is important for us to represent the hub visually in Scale-free Network but the existing Graph-layout algorithms only represent clusters for the present. Therefor in this thesis we suggest Graph-layout algorithm that effectively presents the Scale-free network. The Hubity(hub+ity) repulsive force between hubs in suggested algorithm in this thesis is in inverse proportion to the distance, and if the degree of hubs increases in a times the Hubity repulsive force between hubs is ${\alpha}^{\gamma}$ times (${\gamma}$??is a connection line index). Also, if the algorithm has the counter that controls the force in proportion to the total node number and the total link number, The Hubity repulsive force is independent of the scale of a network. The proposed algorithm is compared with Graph-layout algorithm through an experiment. The experimental process is as follows: First of all, make out the hub that exists in the network or not. Check out the connection line index to recognize the existence of hub, and then if the value of connection line index is between 2 and 3, then conclude the Scale-free network that has a hub. And then use the suggested algorithm. In result, We validated that the proposed Graph-layout algorithm showed the Scale-free network more effectively than the existing cluster-centered algorithms[Noack, etc.].