• 제목/요약/키워드: Network cost

Search Result 3,675, Processing Time 0.034 seconds

Methodology to Estimate the Cost of Network Facilities with ABC and its Application (ABC를 활용한 통신 설비 원가 산정 방법론 및 활용 방안)

  • Yoon, Bong-Kyoo;Yang, Won-Seok
    • IE interfaces
    • /
    • v.20 no.3
    • /
    • pp.395-406
    • /
    • 2007
  • In the telecommunication industry, estimation of the cost of network facilities is very important since depreciation cost of the facilities accounts for a large portion of the product cost. Moreover, cost estimation in the industry becomes more difficult because of increasing indirect cost upon digital convergence, expanding multi-purpose facilities, complexity of service product, etc. Nevertheless, not much seem to have been done in improving estimation methodology of the cost of network facilities. As a result, the quality of cost information on network facilities has deteriorated, and now even decision-makers in the industry dismiss the information. Recently, two major telecommunication companies adopted a new network cost estimation method to deal with the issue. In this paper, we study the concept of new cost estimation method and the procedure to develop and apply it. We also suggest the method to carry out the cost allocation using Matlab which is more efficient and time-saving than other commercial cost calculation packages.

Estimating Telephone Network Structure and Investment Cost Changes (교환/전송 기술진화에 따른 전화교환망 구조변화-시뮬레이션 모형에 의한 사례 분석-)

  • 송석재;장석권;전용수
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1997.10a
    • /
    • pp.138-141
    • /
    • 1997
  • In this study, a simulation model is developed to analyze the effects of routing and scale-economy of transmission facilities on the traffic network topology and investment cost changes in a metropolitan telephone network. Computational experiments showed that the wide deployment of bifurcated routing in a dual-homing configuration reduces significantly the traffic network connectivity and the investment cost. Its enhanced version, when combined with the subscriber network cost model, can be used as a prototype cost proxy model for figuring out the access charges in a multi-operator environment.

  • PDF

A Study on the Topology Design Algorithm for Common Channel Signalling Network (공통선 신호망의 토폴로지 설계 알고리즘에 관한 연구)

  • 이준호;김중규;이상배;박민용
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.5
    • /
    • pp.369-381
    • /
    • 1991
  • In this paper, design algorithms for SMP(Single Mated Pair) and MMP (Multipli Mated Pair) structure of CCS (Common Channel Signaling) network are proposed through the study of the structure of CCS network. High reliability and fast messagy transfer time are the most important requirements for the CCS network. Based on it, three parameters such as monotraffic, reliability (maximum isolated SP(Signalling Point) number when any two STP(Signalling Transfer Points) fail and total network cost are defined. And the proposed algorithms different from preexisted algorithm that minimizes total network cost, maximize monotraffic with two constraints, reliability and total network cost. Comparing the experimental results of the proposed algorithms with those of the preexisted algorithm that minimizes total network cost, shows that the proposed algorithms produce a more reliable topology that has more monotraffic and a little higher total network cost. Additionaly, with the results of the proposed algorithms, SMP and MMP structures are compared.

  • PDF

A Practical Approach for Optimal Design of Pipe Diameters in Pipe Network (배관망에서의 파이프 직경 최적설계에 대한 실용적 해법)

  • Choi Chang-Yong;Ko Sang-Cheol
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.18 no.8
    • /
    • pp.635-640
    • /
    • 2006
  • An optimizer has been applied for the optimal design of pipe diameters in the pipe flow network problems. Pipe network flow analysis, which is developed separately, is performed within the interface for the optimization algorithm. A pipe network is chosen for the test, and optimizer GenOpt is applied with Holder-Mead-O'Niell's simplex algorithm after solving the network flow problem by the Newton-Raphson method. As a result, optimally do-signed pipe diameters are successfully obtained which minimize the total design cost. Design cost of pipe flow network can be considered as the sum of pipe installation cost and pump operation cost. In this study, a practical and efficient solution method for the pipe network optimization is presented. Test system is solved for the demonstration of the present optimization technique.

A Method for Determining the Most Vital Arcs in Minimum Cost Flow Problem (최소비용문제에서 치명호를 결정하는 방법)

  • 안재근;정호연;박순달
    • Journal of the military operations research society of Korea
    • /
    • v.25 no.2
    • /
    • pp.84-96
    • /
    • 1999
  • The purpose of this paper is to find the most vital arc in the minimum cost flow problem. The most vital arc is the arc whose removal results in the greatest influence in the costs or the amount of demands in a given minimum cost flow network. This problem can be well applied to the conflict situations such as military logistics network or communications network. In this situation, network user wants to know which arcs are the most vital to him so that he can reinforce these arcs against attack, while interdictor wants to destroy these arcs which increase the distance of the shortest path most through the network. When one of arcs is removed from the network of the minimum cost flow problem, two kinds of situations can be occurred ; breaking feasibility and increasing cost. In case of breaking feasibility, the rank of arcs are determined using the amount of modified flow in a related network which is made of modifying the optimal alternative of the minimum cost flow problem. The rank of arcs with the increased costs are determined by using a method which finds the directed cycle with the minimum cost in a related network.

  • PDF

Analysis on the Increasing Marginal Revenue of the Network Economy

  • Yang, Jian
    • The Journal of Economics, Marketing and Management
    • /
    • v.6 no.3
    • /
    • pp.10-13
    • /
    • 2018
  • Purpose - On the basis of discussing the network economy concept and the commentary of the marginal revenue decreasing of traditional economic theory, The concept of network economy has just been put forward in recent years. The reason why such a concept appears is that the information technology, marked by computer network, plays an increasingly important role in economic activities. Some people define network economy as an economic form based on network technology and human capital. this paper points out network economy existing the marginal revenue increasing and analyzes the reasons that influencing the marginal revenue increasing. Research design, data, methodology - The network economy has fundamentally changed the traditional economic laws. The economic basis of industrial society is the law of incremental marginal cost, which reflects the socialization of high cost in industrial society. Results - As the number of network members increases, the value of the network increases explosively, and the value increases attract more members to join, resulting in more returns. Conclusion - In conclusion, network economy has changed many aspects of traditional economy, resulting in decreasing marginal cost, decreasing transaction cost in and out of enterprise organizations, and making the effect of increasing scale compensation more prominent. This is of great significance to the information construction in China.

An Investigation of the Relationship between Revenue Water Ratio and the Operating and Maintenance Cost of Water Supply Network (상수관망 유수율과 유지관리 비용의 관계 분석)

  • Kim, Jaehee;Yoo, Kwangtae;Jun, Hwandon;Jang, Jaesun
    • Journal of Korean Society on Water Environment
    • /
    • v.28 no.2
    • /
    • pp.202-212
    • /
    • 2012
  • Due to the deterioration of water supply network and the deficiency of raw water, the water utility of local governments have performed various projects to improve their revenue water ratio. However, it is very difficult to estimate the cost for maintaining the revenue water ratio at higher level after completing the project, because local governments have different conditions affecting the operating and maintenance cost of water supply network. The purpose of this study is to present a procedure to estimate the operating and maintenance cost required to maintain the target revenue water ratio of the water supply network. For this purpose, we estimated the cost used only for operation and maintenance of water supply network of 164 local governments with the aid of K-Mean Clustering Analysis and the data from 40 representative local governments. Then, the regression analysis was performed to find relationship between revenue water ratio and the operating and maintenance cost with two different data sets generated by two classification methods; the first method classifies the local governments by means of k-means clustering, and the other classifies the local governments according to the index standardized by the operating and maintenance cost per unit length of water mains per revenue water ratio. The results shows that the method based on the index standardized by the cost and revenue water ratio of each government produces more reliable results for finding regression equations between revenue water ratio and the operating and maintenance cost only for water supply network. The estimated regression equations for each group can be used to estimate the cost required to keep the target revenue water ratio of the local government.

Design Method for Cost Efficient Survivable Network (효율적 비용의 서바이벌 네트워크 설계방안)

  • Song, Myeong-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.117-123
    • /
    • 2009
  • There are two types of survivability. We find the characteristics of them for networks. And using the dual homing, we analysis the routing cost and link cost. Also we propose the cost-efficient heuristic design method of network topology in order to use survivability. By design samples, we analysis the cost efficiency and show that the new design method can be used to design network topology for survivability easily.

  • PDF

Development of Link Cost Function using Neural Network Concept in Sensor Network

  • Lim, Yu-Jin;Kang, Sang-Gil
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.141-156
    • /
    • 2011
  • In this paper we develop a link cost function for data delivery in sensor network. Usually most conventional methods determine the optimal coefficients in the cost function without considering the surrounding environment of the node such as the wireless propagation environment or the topological environment. Due to this reason, there are limitations to improve the quality of data delivery such as data delivery ratio and delay of data delivery. To solve this problem, we derive a new cost function using the concept of Partially Connected Neural Network (PCNN) which is modeled according to the input types whether inputs are correlated or uncorrelated. The correlated inputs are connected to the hidden layer of the PCNN in a coupled fashion but the uncoupled inputs are in an uncoupled fashion. We also propose the training technique for finding an optimal weight vector in the link cost function. The link cost function is trained to the direction that the packet transmission success ratio of each node maximizes. In the experimental section, we show that our method outperforms other conventional methods in terms of the quality of data delivery and the energy efficiency.

Time-Cost Trade-Off by Lead-Time Adjustment in the PDM Network

  • Kim, Seon-Gyoo
    • Architectural research
    • /
    • v.11 no.2
    • /
    • pp.43-49
    • /
    • 2009
  • Since the late 1980s, the schedule technique applied to the construction industry around the world has rapidly changed from the traditional ADM (Arrow Diagramming Method) to the PDM (Precedence Diagramming Method) technique. The main reason for this change is to overcome the limits and inconveniences of the traditional ADM technique. The time-cost trade-off is one of the core scheduling techniques to establish the best optimized combination plan in terms of a relationship between the cost and schedule. However, most of the schedule-related textbooks and research papers have discussed and proposed applications of a time-cost trade-off technique based only on the Finish to Start relationship. Therefore, there are almost no consideration and discussion of problems or restrictions that emerge when the time-cost trade-off technique is applied to the PDM network that has overlapping relationships. This paper proposes the lead-time adjustment method as a methodology for overcoming some restrictions that are encountered when the time-cost trade-off technique is applied to the overlapping relationships of the PDM network.