• Title/Summary/Keyword: Minimum connection time

Search Result 51, Processing Time 0.027 seconds

Mechanism for Connecting Input Edges Using Steiner Tree (스타이너 트리를 이용한 입력 선분의 연결)

  • Kim, Joon-Mo;Kim, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.213-220
    • /
    • 2010
  • In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.

Successive Max-min Connection-Ratio Preoblem:Routing with Fairness and Efficiency in Circuit Telecommunication Networks (연속적인 최대-최소 연결비율 문제: 회선망에서의 공정성 및 효율성을 보장하는 경로설정)

  • 박구현;우재현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.2
    • /
    • pp.13-29
    • /
    • 1997
  • This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

  • PDF

Performance Analysis Model of Security Server (보안서버 성능분석 모델)

  • 윤연상;박진섭;한선경;양상훈;유영갑
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.129-132
    • /
    • 2003
  • This paper proposes a performance analysis model of security sowers. Performance analysis of security server reflects both the session and data traffic load. The proposed model is the bases of estimating the maximum response time and minimum queue size of a security server comprising a session association processor whose throughput is 1000 connection/s.

  • PDF

New approach to dynamic load balancing in software-defined network-based data centers

  • Tugrul Cavdar;Seyma Aymaz
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.433-447
    • /
    • 2023
  • Critical issues such as connection congestion, long transmission delay, and packet loss become even worse during epidemic, disaster, and so on. In this study, a link load balancing method is proposed to address these issues on the data plane, a plane of the software-defined network (SDN) architecture. These problems are NP-complete, so a meta-heuristic approach, discrete particle swarm optimization, is used with a novel hybrid cost function. The superiority of the proposed method over existing methods in the literature is that it provides link and switch load balancing simultaneously. The goal is to choose a path that minimizes the connection load between the source and destination in multipath SDNs. Furthermore, the proposed work is dynamic, so selected paths are regularly updated. Simulation results prove that with the proposed method, streams reach the target with minimum time, no loss, low power consumption, and low memory usage.

Path Space Approach for Planning 2D Shortest Path Based on Elliptic Workspace Geometry Mapping

  • Namgung, Ihn
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.1
    • /
    • pp.92-105
    • /
    • 2004
  • A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

A Seamless Flow Mobility Management Architecture for Vehicular Communication Networks

  • Meneguette, Rodolfo Ipolito;Bittencourt, Luiz Fernando;Madeira, Edmundo Roberto Mauro
    • Journal of Communications and Networks
    • /
    • v.15 no.2
    • /
    • pp.207-216
    • /
    • 2013
  • Vehicular ad-hoc networks (VANETs) are self-organizing, self-healing networks which provide wireless communication among vehicular and roadside devices. Applications in such networks can take advantage of the use of simultaneous connections, thereby maximizing the throughput and lowering latency. In order to take advantage of all radio interfaces of the vehicle and to provide good quality of service for vehicular applications, we developed a seamless flow mobility management architecture based on vehicular network application classes with network-based mobility management. Our goal is to minimize the time of flow connection exchange in order to comply with the minimum requirements of vehicular application classes, as well as to maximize their throughput. Network simulator (NS-3) simulations were performed to analyse the behaviour of our architecture by comparing it with other three scenarios. As a result of this work, we observed that the proposed architecture presented a low handover time, with lower packet loss and lower delay.

Design of a CAM-Type Traffic Policing Controller with minimum additional delay (시간지연을 최소화한 CAM형 트래픽 폴리싱 장치 설계)

  • 정윤찬;홍영진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.604-612
    • /
    • 2000
  • In order to satisfy the desired QoS level associated with each existing connection, ATM networks require traffic policing during a connection. Users who respect the contract should receive the function of transparent traffic policing without any interruption. However, contract violations should be detected and mediated immediately. So we propose a CAM type policing controller to allow user cell streams to minimize additional delay. The proposed policing scheme controls policing actions including traffic shaping by suitably spacing cells on each virtual circuit. This policing action is based on parallel processing of multiple cell stream which arrive in ATM multiplexed virtual circuits. We have developed an analytical model of the proposed policing scheme to examine the amount of cell loss and delay, which depends on traffic load, the size of policing buffers and minimum spacing cell time.

  • PDF

Seismic loss-of-support conditions of frictional beam-to-column connections

  • Demartino, Cristoforo;Monti, Giorgio;Vanzi, Ivo
    • Structural Engineering and Mechanics
    • /
    • v.61 no.4
    • /
    • pp.527-538
    • /
    • 2017
  • The evaluation of the loss-of-support conditions of frictional beam-to-column connections using simplified numerical models describing the transverse response of a portal-like structure is presented in this paper considering the effects of the seismic-hazard disaggregation. Real earthquake time histories selected from European Strong-motion Database (ESD) are used to show the effects of the seismic-hazard disaggregation on the beam loss-of-support conditions. Seismic events are classified according to different values of magnitudes, epicentral distances and soil conditions (stiff or soft soil) highlighting the importance of considering the characteristics of the seismic input in the assessment of the loss-of-support conditions of frictional beam-to-column connections. A rigid and an elastic model of a frame of a precast industrial building (2-DoF portal-like model) are presented and adopted to find the minimum required friction coefficient to avoid sliding. Then, the mean value of the minimum required friction coefficient with an epicentral distance bin of 10 km is calculated and fitted with a linear function depending on the logarithm of the epicentral distance. A complete parametric analysis varying the horizontal and vertical period of vibration of the structure is performed. Results show that the loss-of-support condition is strongly influenced by magnitude, epicentral distance and soil conditions determining the frequency content of the earthquake time histories and the correlation between the maxima of the horizontal and vertical components. Moreover, as expected, dynamic characteristics of the structure have also a strong influence. Finally, the effect of the column nonlinear behavior (i.e. formation of plastic hinges at the base) is analyzed showing that the connection and the column are a series system where the maximum force is limited by the element having the minimum strength. Two different longitudinal reinforcement ratios are analyzed demonstrating that the column strength variation changes the system response.

A Video Conference System using Multimedia Data and Screen Sharing Methods (멀티미디어 데이터 및 화면 공유 기법을 활용한 화상 회의 시스템)

  • Ko Kwang-San;Jang Jung-Soo;Jung Hoe-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.5
    • /
    • pp.1012-1018
    • /
    • 2005
  • According as computer industry develops and the Internet is spread information interchange between remote users video conference system that can exchange multimedia data such as voice as well as simplicity text data or burn by real-time appeared and is used in various field. However, most systems developed present have controversial points of that need expensive multi-point connection equipment or network resource of High band width. Hereupon, in this paper, designed and embody video conference system that can be stable and supplies multimedia information and screen public ownership environment of high-quality as software using minimum network resource without using expensive connection equipment.