• Title/Summary/Keyword: load paths

Search Result 171, Processing Time 0.024 seconds

An efficient Load Balanced Cost Calculation Scheme for QoS Routing (QoS 라우팅을 위한 부하균등 비용산정 방식)

  • Hong, Jong-Joon;Kim, Seung-Hoon;Lee, Kyoon-Ha
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.135-140
    • /
    • 2002
  • An efficient QoS routing scheme needs to find a path that satisfies a given QoS requirements while consuming as few resources as Possible. In this paper, we propose two schemes of calculating resources'costs one for on-demand and one for precomputation QoS routing schemes. These schemes are effective in respect to the global network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and Intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multip1e paths between all pairs of ingress and ogress border routers while considering balancing of the expected load. We, therefore, expect that the paths are bettor than any other paths in respect to reserving the network resources on Paths. The routine: scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. cote that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without and modification in small and large scale of networks.

Parallel Generation of NC Tool Paths for Subdivision Surfaces

  • Dai Junfu;Wang Huawei;Qin Kaihuai
    • International Journal of CAD/CAM
    • /
    • v.4 no.1
    • /
    • pp.47-53
    • /
    • 2004
  • The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.

Design and Analysis of a Permanent Magnet Biased Magnetic Levitation Actuator (영구자석 바이어스 자기부상 구동기 설계 및 해석)

  • Na, Uhn Joo
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.26 no.7
    • /
    • pp.875-880
    • /
    • 2016
  • A new hybrid permanent magnet biased magnetic levitation actuator (maglev) is developed. This new maglev actuator is composed of two C-core electromagnetic cores separated with two permanent magnets. Compared to the conventional hybrid maglev actuators, the new actuator has unique flux paths such that bias flux paths are separated with control flux paths. The control flux paths have minimum reluctances only developed by air gaps, so the currents to produce control fluxes can be minimized. The gravity load can be compensated with the permanent magnet bias fluxes developed at off-centered air gap positions while external disturbances are controlled with control fluxes by currents. The consumed power to operate this levitation system can be minimized. 1-D magnetic circuit model is developed for this model such that the flux densities and magnetic forces are extensively analyzed. 3-D finite element model is also developed to analyze the performances of the maglev actuator.

Load Balanced QoS Routing for Precomputation of QoS Routes (QoS 경로의 선계산을 적용한 부하분산 QoS 라우팅)

  • 홍종준
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.121-127
    • /
    • 2003
  • In this paper, we propose a load balancing QoS routing on a targe scale network. We use the scheme in which it calculates the cost of resources with a precomputation and then selects a path among multiple paths based on the calculated cost for each resources. We also use the QoS routing scheme for the transit and the intra-traffic on a large scale domain-based network. For a domain in networks, this routing scheme precomputes K multiple paths between all pairs made up with each ingress and egress border routers along with the consideration of a load balancing, and then picks up paths having the high probability on the Path selection. This routing scheme can be applied for the transit traffic and the intra traffic and combines the Inter-domain and intra-domain routings seamlessly and put a high priority on the transit traffic Thus, these schemes make Possible both the global use of network resources and the load balancing.

  • PDF

MPMTP-AR: Multipath Message Transport Protocol Based on Application-Level Relay

  • Liu, Shaowei;Lei, Weimin;Zhang, Wei;Song, Xiaoshi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1406-1424
    • /
    • 2017
  • Recent advancements in network infrastructures provide increased opportunities to support data delivery over multiple paths. Compared with multi-homing scenario, overlay network is regarded as an effective way to construct multiple paths between end devices without any change on the underlying network. Exploiting multipath characteristics has been explored for TCP with multi-homing device, but the corresponding exploration with overlay network has not been studied in detail yet. Motivated by improving quality of experience (QoE) for reliable data delivery, we propose a multipath message transport protocol based on application level relay (MPMTP-AR). MPMTP-AR proposes mechanisms and algorithms to support basic operations of multipath transmission. Dynamic feedback provides a foundation to distribute reasonable load to each path. Common source decrease (CSD) takes the load weight of the path with congestion into consideration to adjust congestion window. MPMTP-AR uses two-level sending buffer to ensure independence between paths and utilizes two-level receiving buffer to improve queuing performance. Finally, the MPMTP-AR is implemented on the Linux platform and evaluated by comprehensive experiments.

Practical Application of Strut-and-tie model (스트럿-타이 모델의 실용화)

  • Hong, Sung-Gul
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2008.11a
    • /
    • pp.979-984
    • /
    • 2008
  • This paper discusses how to use basic strut-and-tie models(STM) for practical application. Construction of STM starts with drawing of load paths with equilibrium conditions. Understanding of structural systems including form active systems, vector active systems, and section active systems help us select appropriate systems for possible STM. Simple circular fans can be employed for load paths from concentrated forces to distributed forces. Strength of struts depends on configuration of their nodal zones which meet tension ties and effective compressive strength. The effective compressive strength of struts are assumed to be mainly influenced by transverse strain.

  • PDF

An efficient interconnect allocation algorithm for clock period minimzatio (클럭주기 최소화를 위한 효율적인 연결구조 할당 알고리듬)

  • 김영노;이해동;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.6
    • /
    • pp.91-103
    • /
    • 1995
  • This paper presents the design of a performance-driven interconnect allocation algorithm. The algorithm is based on the idea that the clock period can be minimized by balancing the load for each of the communication paths following specific hardware modules. By performing load balancing for only the communication lines on ciritical paths, the proposed algorithm generates interconnection structures with minimum delays. This approach also shows run time efficiency. Experimental results confirm the effectiveness of the algorithm by constructing the interconnection structures such that the clock period can be minimized for several benchmark circuits available from the literature.

  • PDF

A New Packet-level Load-balancing Scheme for Fat-Trees (Fat-Tree에서의 새로운 패킷 단위 부하분산 방식)

  • Lim, Chansook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.53-58
    • /
    • 2013
  • A Fat-Tree topology has multiple paths between any pair of hosts. The delay for the multiple paths with an equal number of hops depends mainly on the queuing delay. However, most of the existing load-balancing schemes do not sufficiently exploit the characteristics of Fat-Tree. In most schemes load-balancing is performed at a flow level. Packet-level load-balancing schemes usually require the availability of special transport layer protocols to address packet reordering. In this paper, we propose a new packet-level load-balancing scheme which can enhance network utilization while minimizing packet reordering in Fat-Trees. Simulation results show that the proposed scheme provides as high TCP throughput as a randomized flow-level Valiant load balancing scheme for a best case.

A Hierarchical Multicast Routing Protocol based on Zone Routing Technique for Wireless multi-hop Network (무선 다중 홉 네트워크에서의 지역 기반의 계층적 멀티캐스트 라우팅 프로토콜)

  • Gui, Yi-Qi;Zhang, Jie;Yang, Dong-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.149-156
    • /
    • 2011
  • In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.

FVF-Based Low-Dropout Voltage Regulator with Fast Charging/Discharging Paths for Fast Line and Load Regulation

  • Hinojo, Jose Maria;Lujan-Martinez, Clara;Torralba, Antonio;Ramirez-Angulo, Jaime
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.373-382
    • /
    • 2017
  • A new internally compensated low drop-out voltage regulator based on the cascoded flipped voltage follower is presented in this paper. Adaptive biasing current and fast charging/discharging paths have been added to rapidly charge and discharge the parasitic capacitance of the pass transistor gate, thus improving the transient response. The proposed regulator was designed with standard 65-nm CMOS technology. Measurements show load and line regulations of $433.80{\mu}V/mA$ and 5.61 mV/V, respectively. Furthermore, the output voltage spikes are kept under 76 mV for 0.1 mA to 100 mA load variations and 0.9 V to 1.2 V line variations with rise and fall times of $1{\mu}s$. The total current consumption is $17.88{\mu}V/mA$ (for a 0.9 V supply voltage).