• Title/Summary/Keyword: Network Resource

Search Result 2,078, Processing Time 0.025 seconds

Fairness Improvement Leaky Bucket Algoriom for Group Connections in ATM Network (ATM 망에서 그룹 연결을 위한 효율적인 공평성 향상 Leaky Bucket 알고리즘)

  • Lee Jae-hwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9B
    • /
    • pp.591-595
    • /
    • 2005
  • In this paper, we propose the fairness improvement leaky bucket (PILB) algorithm as a traffic policing mechanism. In the proposed algorithm, there is a cell buffer for every ATM connection in order to store date cells. Network decides whether an ATM connection obeys the contracted traffic parameter, and stores data cells in the cell buffer if the connection obeys but is considered as violated the contract due to temporary lack of network resource. By using the proposed algorithm, we can obtain the statistical multiplexing gain that is the superiority of packet switching network. Moreover, when a connection tries to transmit more data cells by violating the contracted traffic parameters, the connection is prevented from using excess network resource, which incurs all connections sharing network resource fairly. The performance of the proposed FILB algorithm is investigated by using the simulation. The result shows that the proposed algorithm provides superior performance and all connections within a group share network resource fairly. The proposed algorithm can be applied not only the ATM network but also IP network.

Network Structure of Professional Volleyball Players and Resource Exchange (프로배구 선수의 사회연결망 구조와 자원교환)

  • Lee, Se-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.6
    • /
    • pp.438-447
    • /
    • 2012
  • This study was to explore the social network structure of professional volleyball players and analyze network variables and resource exchange. This study selected 127 players of Korean professional volleyball in ten team of male and female using the purposive sampling method. The research method utilized general social survey of NGQ(Name Generator Question) and interview. To analyze data, NetMiner 3.0 and SNA(social network analysis) were used. The conclusion based on above study method and the result of material analysis are here below. First, social network of professional volleyball players is scale-free network following power law. Centrality and herb of club members' network show up richer-get-richer and poor-get-poor by collecting links of back of beyond. Second, social network structure of professional volleyball players influence resource exchange.

Dynamic Load Balancing Scheme Based on Resource Reservation for Migration of Agents in Pure P2P Network Environments (순수 P2P 네트워크 환경에서 에이전트 이주를 위한 자원 예약 기반 동적 부하 균형 기법)

  • Kim, Kyung-In;Kim, Young-jin;Eom, Young-Ik
    • The KIPS Transactions:PartA
    • /
    • v.11A no.4
    • /
    • pp.257-266
    • /
    • 2004
  • Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

WDM Optical Network Restoration and Spare Resource Planning using Multiple Ring-Cover (다중 링 구조를 이용한 WDM 통신망 복구 및 자원 예약 기법)

  • Hwang, Ho-Young;Lim, Sung-Soo
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.891-900
    • /
    • 2005
  • This paper studies network recovery methods for WDM optical mesh networks, concentrating on improving spare resource utilization. The resource efficiency can be obtained by sharing spare resources needed for network recovery. To improve the sharability of spare resources in WDM networks, methods to share backup paths us well as spare capacity should be studied. The proposed method in this paper uses multiple ring-covers and this method provides fast and simple recovery operation by exploiting the characteristics of logical ring topology, and also provides efficient resource utilization by using multiple distributed backup paths to improve the sharability of overall spare resources in the networks. This method can provide layered reliability to network service by enabling hierarchical robustness against multiple failures. The performance results show that the proposed method provide improved resource efficiency for single failure and enhanced robustness for multiple failures.

Performance Evaluation of the Internet Phone based on Resource Reservation Protocol (자원 예약 프로토콜에 기반한 인터넷 폰의 성능분석)

  • 조재만
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.03a
    • /
    • pp.27-31
    • /
    • 1998
  • The growing usage of multimedia communication applications with specific bandwidth and real-time delivery requirements has created the needs for quality of service(QoS). In response to the growing demand for an integrated services, the Reservation Protocol(RSVP) has been designed to exchange resource reservation among routers in the internet. RSVP protocol provides the quality of service for real-time applications but the network efficiency is reduced because of the limited bandwidth. In order to use network resources efficiently. We compare the resource efficiency of traditional reservation methods with that of the proposed method and evaluate the performance of the internet phone.

  • PDF

The Concept of Human Resource Management in Logistics Processes

  • Shtuler, Iryna;Zabarna, Eleonora;Kyrlyk, Nataliya;Kostovyat, Hanna
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.110-116
    • /
    • 2021
  • The article focuses on the need to deepen the issue of human resource management in logistics processes. It is noted that changes in market conditions and turbulence in the institutional environment require managers to form a highly effective human resources policy capable to ensure the innovative development of the enterprise. Functional strategies for human resource management in logistical processes are proposed, namely: adaptive, innovative, selective and exclusive. Innovative technologies that should be used in the adaptive human resources policy process are identified.

Resource Allocation in Two Hop Relay Network based on PB/MC-CDMA System (PB/MC-CDMA 기반 two-hop 중계 망에서의 자원 할당 방식)

  • Sun, Yan;Lee, Kye-San
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.1
    • /
    • pp.94-99
    • /
    • 2010
  • In this paper, we discuss a proposed two hop relay network with PB/MC-CDMA(partial block MC-CDMA) technique. The main advantages of PB/MC-CDMA system are the increased cell capacity and the high quality of performances. In the system, we employ relay scheme to focus on the coverage reduction and hotspot problem, hotspot is a location where a cluster of users are blocked or dropped for the reason of insufficient frequency resources. Frequency resource allocation scheme is put forward in a three cells system according to each problem. The simulation result shows the performance of the two hop transmission is better than the direct transmission and the proposed network can support much more users to relief hotspot effect compared to the conventional one.

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

  • Zhuang, Wenqin;Chen, Mingkai;Wei, Xin;Li, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1984-2002
    • /
    • 2020
  • With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

Design of High-Performance Lambda Network Based on DRS Model (DRS 모델에 기반한 고성능 람다 네트워크의 설계)

  • Noh, Min-Ki;Ahn, Sung-Jin
    • The Journal of Korean Association of Computer Education
    • /
    • v.12 no.2
    • /
    • pp.77-86
    • /
    • 2009
  • Large-scale applications, that needs large-capacity R&D resources and realtime data transmission, have demanded more stable and high-performance network environment than current Internet environments. Recently, global R&D networks have focuses on utilizing Lambda networking technologies and resource reservation systems to be satisfied with various applications' requirements. In this paper, we modify the existing DRS (Dynamic Right-Sizing) model to reflect various advantages in terms of the stability and high-capacity of Lambda network. In addition, we suggest the design methodology of high-performance Lambda network, which can integrate NRPS (Network Resource Provisioning System) into our modified DRS model.

  • PDF

UAV Network Resource Allocation Algorithm according to the Network Environment and Data Requirement (네트워크 환경 및 데이터 요구사항에 따른 무인기 네트워크 자원할당 알고리즘)

  • Cheon, Hye-Rim;Hwang, Chan-Ho;Lee, Woosin;Yoo, Indeok;Kim, Jae-Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.7
    • /
    • pp.3-11
    • /
    • 2017
  • UAV system has the limitation to allocate enough spectrum bandwidth for the operation of multiple UAVs due to the market expansion. In addition, the communication environment of UAV network varies dynamically due to the UAV's mobility. Thus, to operate the stable UAV system and maximize the transmission data rate, it needs to allocate the resource effectively in the limited bandwidth considering the given network environment. In this paper, we propose the resource allocation algorithm which can maximize the network throughput as well as satisfy the minimum data requirement for the UAV system operation in the given network environment based on TDMA(Time Division Multiple Access). By performance analysis, we show that the proposed algorithm can allocate the resource to satisfy the high network throughput as well as the minimum data requirement in the given network environment.