• Title/Summary/Keyword: network capacity

Search Result 1,894, Processing Time 0.031 seconds

The Analysis of the Subscriber Capacity in a Cell of Data Service HFC Network (데이터 서비스용 HFC망에서 셀당 가입자 수용능력 분석)

  • 장태우
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.371-374
    • /
    • 2001
  • The upstream noise level was measured and analysed for the sample HFC networks to HFC subscriber capacity in the HFC network that is only for cable modem services. The upstream bands were measured not only in HFC networks that have accommodated only cable modem subscribers but in CATV networks that have accommodated cable modem and CATV subscribers. The study says that C/N of HFC networks be maintained though the networks have more cable modem subscribers than CATV networks do. This results are being expected to be used as a basis of network design and management of HFC network provider .

  • PDF

A Heuristic Algorithm for the Reliability Optimization of a Distributed Communication Network

  • Hung, Chih-Young;Yang, Jia-Ren;Park, Dong-Ho;Liu, Yi-Hsin
    • International Journal of Reliability and Applications
    • /
    • v.9 no.1
    • /
    • pp.1-5
    • /
    • 2008
  • A heuristic algorithm for reliability optimization of a distributed network system is developed so that the reliability of a large system can be determined efficiently. This heuristic bases on the determination of maximal reliability set of maximum node capacity, maximal link reliability and maximal node degree.

  • PDF

Option of Network Flow Problem Considering Uncertain Arc Capacity Constraints (불확실한 arc용량제약식들을 고려한 네트워크문제의 최적화)

  • 박주녕;송서일
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.21
    • /
    • pp.51-60
    • /
    • 1990
  • In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.

  • PDF

Base Station Processing Capacity in Wireless Multimedia Networks (무선 멀티미디어 서비스를 위한 기지국 설계용량 분석)

  • Jang, Hee-Seon;Cho, Kee-Sung;Kim, Young-Bu
    • IE interfaces
    • /
    • v.17 no.1
    • /
    • pp.121-127
    • /
    • 2004
  • In this paper, we present the base station(BS) processing capacity to provide the multimedia services in IMT-2000 wireless communication network. The IMT-2000 services are classified into two types, circuit and packet services, and user‘s environments such as indoor, pedestrian and vehicle are considered. Using the parameters of service economics and wireless technology, the user's reference traffic and BS‘s traffic are computed. The traffic is measured by throughput(kbps). Based on the measured traffic, the accommodating users in BS are also evaluated. In addition to, the BS design capacity is presented for varying the number of users and traffic distribution in different user's environments.

Meeting the Demands for Major International Traffic Flows through Railnet Austria's Maintenance and Capacity Planning Regime

  • Herbacek, R.;Petri, K.;Ertl, B.
    • International Journal of Railway
    • /
    • v.1 no.4
    • /
    • pp.134-142
    • /
    • 2008
  • Serving as a strategic crossing point for major corridors in Central Europe, Railnet Austria's Infrastructure Network incurs continual increases in international traffic flows and is therefore subject to accumulating traffic congestion with potential restrictions to infrastructure access. This imposes challenges towards preserving open access to Railnet Austria's existing railway network and hinders quality infrastructure service during maintenance, repair, and upgrading. Through Railnet Austria's experiences, the economic viability of a railway network can be sustained through maintaining open access with good quality service of planned trainpaths, thus representing new challenges for future infrastructure maintenance and capacity planning. Railnet Austria's Capacity Management Department has proven that these challenges can be accommodated more effectively through recent technological developments in data warehousing and software development.

  • PDF

A Study on the Generating Capacity Expansion Characteristics in Jeju Island (제주지역 전력공급 대안과 특성분석)

  • Kim, C.S.;Rhee, C.H.
    • Proceedings of the KIEE Conference
    • /
    • 2004.11b
    • /
    • pp.275-277
    • /
    • 2004
  • Although Jeju island Is connected with main network system by HVDC cable line, it's network assumes the form of independent system in an operating point of view. Therefore Jeju needs it's own independent capacity expansion planning. Continuos growth of demand and increase of antiquated plants in Jeju requires additional generating capacity. This paper analyzes characteristics of two alternatives which include it's own expansion of facilities and capacity expansion of network system for Jeju island. Furthermore this paper evaluates economic efficiency of those alternatives and analyzes long-term program of demand-supply of electricity.

  • PDF

Pile bearing capacity prediction in cold regions using a combination of ANN with metaheuristic algorithms

  • Zhou Jingting;Hossein Moayedi;Marieh Fatahizadeh;Narges Varamini
    • Steel and Composite Structures
    • /
    • v.51 no.4
    • /
    • pp.417-440
    • /
    • 2024
  • Artificial neural networks (ANN) have been the focus of several studies when it comes to evaluating the pile's bearing capacity. Nonetheless, the principal drawbacks of employing this method are the sluggish rate of convergence and the constraints of ANN in locating global minima. The current work aimed to build four ANN-based prediction models enhanced with methods from the black hole algorithm (BHA), league championship algorithm (LCA), shuffled complex evolution (SCE), and symbiotic organisms search (SOS) to estimate the carrying capacity of piles in cold climates. To provide the crucial dataset required to build the model, fifty-eight concrete pile experiments were conducted. The pile geometrical properties, internal friction angle 𝛗 shaft, internal friction angle 𝛗 tip, pile length, pile area, and vertical effective stress were established as the network inputs, and the BHA, LCA, SCE, and SOS-based ANN models were set up to provide the pile bearing capacity as the output. Following a sensitivity analysis to determine the optimal BHA, LCA, SCE, and SOS parameters and a train and test procedure to determine the optimal network architecture or the number of hidden nodes, the best prediction approach was selected. The outcomes show a good agreement between the measured bearing capabilities and the pile bearing capacities forecasted by SCE-MLP. The testing dataset's respective mean square error and coefficient of determination, which are 0.91846 and 391.1539, indicate that using the SCE-MLP approach as a practical, efficient, and highly reliable technique to forecast the pile's bearing capacity is advantageous.

An optimal link capacity problem of on-line service telecommunication networks (PSTN과 PSDN을 연결한 데이터 통신망의 회선할당에 관한 연구)

  • Kim, Byung-Moo;Lee, Young-Ho;Kim, Young-Hui;Kim, Yu-Hwan;Park, Seok-Ji;Kim, Joo-Sung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.2
    • /
    • pp.241-249
    • /
    • 1998
  • In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

  • PDF

A Study on Distributed Message Allocation Method of CAN System with Dual Communication Channels (중복 통신 채널을 가진 CAN 시스템에서 분산 메시지 할당 방법에 관한 연구)

  • Kim, Man-Ho;Lee, Jong-Gap;Lee, Suk;Lee, Kyung-Chang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.10
    • /
    • pp.1018-1023
    • /
    • 2010
  • The CAN (Controller Area Network) system is the most dominant protocol for in-vehicle networking system because it provides bounded transmission delay among ECUs (Electronic Control Units) at data rates between 125Kbps and 1Mbps. And, many automotive companies have chosen the CAN protocol for their in-vehicle networking system such as chassis network system because of its excellent communication characteristics. However, the increasing number of ECUs and the need for more intelligent functions such as ADASs (Advanced Driver Assistance Systems) or IVISs (In-Vehicle Information Systems) require a network with more network capacity and the real-time QoS (Quality-of-Service). As one approach to enhancing the network capacity of a CAN system, this paper introduces a CAN system with dual communication channel. And, this paper presents a distributed message allocation method that allocates messages to the more appropriate channel using forecast traffic of each channel. Finally, an experimental testbed using commercial off-the-shelf microcontrollers with two CAN protocol controllers was used to demonstrate the feasibility of the CAN system with dual communication channel using the distributed message allocation method.

The Effect of Internet Neutrality Regulation on Social Welfare Considering Network Congestion and Investment Incentive (혼잡효과와 망투자유인을 고려한 인터넷망 중립성 규제의 경제적 효과분석)

  • Jung, Choong Young;Jung, Song Min
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.3_spc
    • /
    • pp.201-217
    • /
    • 2013
  • This paper analyzes the effect of network neutrality regulation on social welfare using the two-sided market under the network congestion. This paper deals with zero price rule regulation which means the price regulation on the side of content. The results are as follows : First, under the monopoly platform, internet use price, contents price, and the number of internet user and content provider are all decreasing as the network congestion increases. Second, under the monopoly platform internet use price, contents price, and the number of internet user and content provider are all increasing as the network capacity increases. Third, the price of internet use and contents internet use which maximize social welfare are increasing and the number of internet user and content provider are decreasing as the network congestion increases. Fourth, optimal network capacity for monopoly platform provider is less than socially optimal network capacity. Fifth, if network neutrality regulation is enforced, the price of internet use is higher than monopoly platform provider and the price of contents is lower than monopoly platform provider. Also, the number of internet user is less than monopoly platform provider and the number of content provider is more than that. By the way, when network congestion increases, internet use price, the number of internet user, and the number of content provider are decreasing. Sixth, network neutrality regulation is more effective for internet user side than contents provider when network congestion is considered. This means that network neutrality regulation is not effective for contents market side when network congestion is seriously large.