• 한국전자통신학회논문지
• /
• 제17권6호
• /
• pp.1047-1054
• /
• 2022

네트워크 장비의 하드웨어 영역과 소프트웨어 영역을 분리하고 오픈소스 기반의 소프트웨어를 사용하여 네트워크를 정의하는 차세대 네트워크 기술인 SDN의 등장으로 기존 네트워크 체계가 가지고 있던 복잡성과 확장성의 문제를 해결하고 저비용으로 사용자의 환경과 요구조건에 맞춤형 네트워크 구성이 가능해졌다. 하지만, 컨트롤러와 스위치 간에 발생하는 많은 제어 통신으로 인한 네트워크의 부하가 발생할 수 있다는 구조적 단점을 가지고 있어 이를 효과적으로 해결하기 위한 네트워크 부하분산에 대한 많은 연구가 선행되었다. 특히 플로우 테이블과 관련된 부하분산 기법의 기존 연구에서는 플로우 엔트리에 대한 고려 없이 진행된 연구가 많아서 플로우 수가 많아지게 되면 패킷 처리속도가 떨어져 오히려 부하를 가중시키는 결과를 가져오기도 했는데, 본 논문에서는 이러한 문제점을 해결하기 위해 실시간으로 플로우를 모니터링하고 동적 플로우 관리 기법을 적용하여 플로우 수를 적정 수준으로 조절하면서도 높은 패킷 처리속도를 유지할 수 있는 새로운 네트워크 부하분산 기법을 제안한다.

• 대한산업공학회지
• /
• 제10권2호
• /
• pp.37-43
• /
• 1984

For the polymatroidal network, which has set-constraints on arcs, solution procedures to get the weighted maximal flows are investigated. These procedures are composed of the transformation of the polymatroidal network flow problem into a polymatroid intersection problem and a polymatroid intersection algorithm. A greedy polymatroid intersection algorithm is presented, and an example problem is solved. The greedy polymatroid intersection algorithm is a variation of Hassin's. According to these procedures, there is no need to convert the primal problem concerned into dual one. This differs from the procedures of Hassin, in which the dual restricted problem is used.

• 한국경영과학회지
• /
• 제11권2호
• /
• pp.13-26
• /
• 1986

This paper considers the routing problem in session-based communication network, particularly where the pattern of message transmission is characterized by non-bifurcated traffic flows. Due to the discreteness property of its solution space, the problem is formulated as normalized mlticommodity network flows with integer restrictions and an effective penalty system is suggested to solve it. To show its effectiveness, a simple example and a preliminary computational experience are provided. Finally, numerous application areas of the algorithm are suggested.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.608-611
• /
• 2005

The existing wired emergency call such as 119, 112 have its own location information to serving immediate rescue service. For the case of wireless emergency call by mobile phone, the location information should be provided by wireless network. This paper describes the network architecture and protocol for mobile emergency service referring TIAlEWJ-SID-036-A with reviews about technical issues, legacy factors and related researches. The mobile emergency service is divided into mobile emergency rescue service and mobile emergency alert service. The network reference model for mobile emergency rescue service is released in KOREA. In this paper, the interfaces between elements of the network reference model, and service scenarios, message flows are defined. Supplement to mobile emergency rescue service, the network reference model, interfaces and message flows for mobile emergency alert service are developed. The protocol is described by DID, and the proposed works are on processing for domestic standard of TTA.

• 대한산업공학회지
• /
• 제37권4호
• /
• pp.279-288
• /
• 2011

The past researches focused on the supply chain network that consists of factories, distribution centers and retailers for single product type. This research is required because the factory for single product type is advanced to reconfigurable type in order to produce various products, according to customers' various purchase forms and time. This research is also required because in the past researches, the material flows from factories to distribution centers and from distribution centers to retailers, but recently, there are material flows between distribution centers. The supply chain network in this research consists of reconfigurable manufacturing system, multi-layered distribution centers, and retailers. A simulator is developed to analyze the material flow on the supply chain network. The developed simulator is web-based designed by using Java Server Page and MS-SQL, so as to maximize the convenience for users.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.129-132
• /
• 2002

To support UDP-based real-time multimedia applications over the Internet, it is necessary to provide a certain amount of bandwidth within the network so that the performance of the applications will not be seriously affected during periods of congestion. Since the flow rates of some of these applications do not back of during periods of congestion, it is also necessary to protect flow-controlled TCP flows from unresponsive or aggressive UDP flows. To achieve these goals, we propose a simple queue policy to support multimedia applications, called threshold-based queue management (TBQM). TBQM isolates UDP flows efficiently from TCP flows to protect TCP flows while supporting bandwidth requirements of UDP applications that require QoS. In addition, TBQM supports drop fairness between TCP flows without maintaining per-flow state. We also present some experimental results to show that the proposed queue policy can work well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• 대한전기학회논문지
• /
• 제37권7호
• /
• pp.427-433
• /
• 1988

본 논문에서는 계통을 분할하여 분할된 지역간의 경계선로에 대학 조류측정을 하여 계통을 축소하는데 근거한 계통분할 알고리즘을 제시한다. 즉 전력계통을 여러개의 종속계통으로 나누면 반그시 경계선로가 파생되는데 이 경계선로 조류를 정확히 추정할 수 있으면 각 종속계통에 대한 상태추정을 개별적으로 행할 수 있으므로 각 종속계통에 대한 경계선로 조류를 추정하는 면밀한 방법을 제시하였다. 까라서, 제시된 알고리즘을 쓰면 종속계통에서 상태추정을 개별적으로 수행할 수 있기 때문에 계산시간과 메모리 용량을 현저히 줄일 수 있다. 제시된 알고리즘을 IEEE 샘플계통에 적용하여 설계통 적용 가능성을 보였다.

• ETRI Journal
• /
• 제5권2호
• /
• pp.17-28
• /
• 1983

This paper deals with the problem of optimally controlling traffic flows in urban transportation traffic networks. For this, a nonlinear discrete-time model of urban traffic network is first suggested in order to handle the phenomenon of traffic flows such as oversaturatedness and/or undersaturatedness. Then an optimal control problem is formulated and a hierarchical optimization technique is applied, which is based upon a prediction-type two-level method of Hirvonen and Hakkala.