• 제목/요약/키워드: Stable networks

검색결과 399건 처리시간 0.031초

일반 교통망에서 브라이스 역설 발견 모형 (A Model for Detecting Braess Paradox in General Transportation Networks)

  • 박구현
    • 한국경영과학회지
    • /
    • 제32권4호
    • /
    • pp.19-35
    • /
    • 2007
  • This study is for detecting the Braess Paradox by stable dynamics in general transportation networks. Stable dynamics, suggested by Nesterov and de Palma[18], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model based on link latency function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. The phenomenon that increasing capacity of a network, for example creating new links, may decrease its performance is called Braess Paradox. It has been studied intensively under user equilibrium model with link latency function since Braess[5] demonstrated a paradoxical example. However it is an open problem to detect the Braess Paradox under stable dynamics. In this study, we suggest a method to detect the Paradox in general networks under stable dynamics. In our model, we decide whether Braess Paradox will occur in a given network. We also find Braess links or Braess crosses if a network permits the paradox. We also show an example how to apply it in a network.

교통망에서 다차종 통행을 고려하는 통행배정모형 수립 (A Traffic Assignment Model in Multiclass Transportation Networks)

  • 박구현
    • 한국경영과학회지
    • /
    • 제32권3호
    • /
    • pp.63-80
    • /
    • 2007
  • This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.

안정동력학에 의한 가변수요 통행배정모형 (A Variable Demand Traffic Assignment Model Based on Stable Dynamics)

  • 박구현
    • 한국경영과학회지
    • /
    • 제34권1호
    • /
    • pp.61-83
    • /
    • 2009
  • This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

모바일 Ad-hoc 무선 센서 네트워크에서 안정된 경로의 Life-Time을 지원하기 위한 엔트로피 기반의 라우팅 프로토콜 (An Entropy-Based Routing Protocol for Supporting Stable Route Life-Time in Mobile Ad-hoc Wireless Sensor Networks)

  • 안병구;이주상
    • 한국인터넷방송통신학회논문지
    • /
    • 제8권1호
    • /
    • pp.31-37
    • /
    • 2008
  • 본 논문에서는 모바일 ad-hoc 무선 센서 네트워크에서 안정된 경로의 설정 및 설정된 경로의 lifetime 을 효과적으로 지원하기 위한 엔트로피 기반의 라우팅 프로토콜을 제안한다. 제안된 라우팅 프로토콜의 기본 아이디어 및 특징은 다음과 같다. 첫째, 모바일 노드들의 이동성 정보를 이용한 엔트로피 기반의 안정된 경로 설정. 둘째, 기존의 센서 네트워크는 주로 고정된 노드 환경에서 많은 연구가 되어 왔지만, 본 연구에서는 노드들의 이동성을 고려한 환경에서 연구가 이루어진다. 제안된 라우팅 프로토콜의 성능평가는 OPNET(Optimized Network Engineering Tool)을 사용한 시뮬레이션과 분석을 통하여 이루어졌다. 성능평가를 통하여 제안한 라우팅 프로토콜은 모바일 ad-hoc 무선 센서 네트워크 하에서 안정된 경로의 설정 및 경로의 lifetime을 효과적으로 증가 시킬 수 있음을 알 수 있다.

  • PDF

안정동력학 모형에서 최선 통행료 및 차선 통행료 (First- and Second-best Pricing in Stable Dynamic Models)

  • 박구현
    • 한국경영과학회지
    • /
    • 제34권4호
    • /
    • pp.123-138
    • /
    • 2009
  • This study examined the first- and second-best pricing by stable dynamics in congested transportation networks. Stable dynamics, suggested by Nesterov and de Palma (2003), is a new model which describes and provides a stable state of congestion in urban transportation networks. The first-best pricing in user equilibrium models introduces user-equilibrium in the system-equilibrium by tolling the difference between the marginal social cost and the marginal private cost on each link. Nevertheless, the second-best pricing, which levies the toll on some, but not all, links, is relevant from the practical point of view. In comparison with the user equilibrium model, the stable dynamic model provides a solution equivalent to system-equilibrium if it is focused on link flows. Therefore the toll interval on each link, which keeps up the system-equilibrium, is more meaningful than the first-best pricing. In addition, the second-best pricing in stable dynamic models is the same as the first-best pricing since the toll interval is separately given by each link. As an effect of congestion pricing in stable dynamic models, we can remove the inefficiency of the network with inefficient Braess links by levying a toll on the Braess link. We present a numerical example applied to the network with 6 nodes and 9 links, including 2 Braess links.

A Congestion Control Mechanism for Supporting Differentiated Service in Mobile Ad hoc Networks

  • Kim Jin-Nyun;Ha Nam-Koo;Cho Dong-Hoon;Kim Hyun-Sook;Han Ki-Jun
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.143-146
    • /
    • 2004
  • Differentiated services (DiffServ) has been widely accepted as the service model to adopt for providing quality-of­service (QoS) over the next-generation IP networks. There is a growing need to support QoS in mobile ad hoc networks. Supporting DiffServ in mobile ad hoc networks, however, is very difficult because of the dynamic nature of mobile ad hoc networks, which causes network congestion. The network congestion induces long transfer packet delay and low throughput which make it very difficult to support QoS in mobile ad hoc networks. We propose DiffServ module to support differentiated service in mobile ad hoc networks through congestion control. Our DiffServ module uses the periodical rate control for real time traffic and also uses the best effort bandwidth concession when network congestion occurs. Network congestion is detected by measuring the packet transfer delay or bandwidth threshold of real time traffic. We evaluate our mechanism via a simulation study. Simulation results show our mechanism may offer a low and stable delay and a stable throughput for real time traffic in mobile ad hoc networks.

  • PDF

Wireless Mesh Networks 기반 환경감시서버 설계 (A Design of Environment monitoring Server Based Wireless Mesh Networks)

  • 임혁진;주휘동;이명훈;여현
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2007년도 춘계종합학술대회
    • /
    • pp.671-674
    • /
    • 2007
  • 유비쿼터스 센서 네트워크(Ubiquitous Sensor Networks)는 각종 센서에서 수집한 정보를 무선으로 수집할 수 있도록 구성한 네트워크를 말한다. 이러한 유비쿼터스 센서 네트워크에서 센서 노드는 한정된 전송 거리의 극복과 최적의 경로 설정으로 안정적인 데이터 전송이 중요하다. 이에 본 논문에서는 무선 메쉬 네트워크(Wireless Mesh Networks)를 이용한 센서 노드의 한정된 전송거리를 극복하고자 한다. 따라서 u-farm을 위한 환경감시 시스템은 무선 메쉬 네트워크의 MAP을 적용시켜 안정적인 데이터 전송이 이루어지도록 제안한다.

  • PDF

INDIVIDUAL AND SOCIAL INCENTIVES VERSUS R&D NETWORK RESTRICTION

  • ALGHAMDI, MOHAMAD
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제23권4호
    • /
    • pp.329-350
    • /
    • 2019
  • This paper examines individual and social strategies to form profitable cooperation networks. These two types of strategies measure network stability and efficiency that may not meet in a single network. We apply restrictions on knowledge flows (R&D spillovers) and links formation to integrate these benefits into structures that ensure high outcomes for both strategies. The results suggest that linking the spillovers to the firms' positions and restricting cooperation contribute to reducing the conflict between the individual and social strategies in the development of cooperative networks.

Performance Benefits of Virtual Path Tunneling for Control and Management Flows in the Broadband ATM Network

  • Choi, Jun-Kyun;Kim, Soo-Hyung;Kim, Nam;Sohn, Sung-Won;Choi, Mun-Kee
    • ETRI Journal
    • /
    • 제21권4호
    • /
    • pp.23-28
    • /
    • 1999
  • In this paper, we analyze the performance benefits of broadband ATM networks when the call control and management flows are separated from user data flows. The virtual path tunneling concept for control and management flows are applied to the same physical ATM networks. The behaviors of channel throughput and transfer delay are analyzed. It results that the proposed virtual short-cut paths can maintain the network being stable with acceptable bandwidth. They are very useful to provide the stable control and management capabilities for Internet and mobile applications in the broadband ATM networks. In our numerical results, the effective throughputs of the proposed virtual shout-ut channel are about three times than those of end-to-end user data channels with hop distances of 10, and about two times than those with hop distance of 5 when the link blocking probability increases to 0.1. It concludes that the effective channel bandwidth are greatly reduced down while physical links are not stable and user traffic flows are occasionally overflowed.

  • PDF

CSMA 무선 네트워크에서 안정성 있는 신뢰적 브로드캐스트를 위한 2-폴링 피드백 방법 (2-Polling Feedback Scheme for Stable Reliable Broadcast in CSMA Wireless Networks)

  • 윤원용
    • 한국통신학회논문지
    • /
    • 제37B권12호
    • /
    • pp.1208-1218
    • /
    • 2012
  • IEEE 802.11와 같은 CSMA 무선 네트워크에서 브로드캐스트 전송을 안정성 있게 신뢰적으로 수행하기 위해, 브로드캐스트 송신 노드는 복수의 수신자들에게 충돌 없는 전송을 할 수 있도록 해야 하며 복수 수신자들의 패킷 수신 상태를 유지해야 한다. 본 논문은 무선 네트워크에서 안정적이고 신뢰적인 브로드캐스트를 수행하기 위한 효율적인 피드백 방법인 2-폴링 피드백을 제안한다. 이 방법에서 송신 노드는 두 개의 수신자 노드의 채널 상태를 확인한 후 브로드캐스트 전송을 수행한다. 본 논문은 브로드캐스트 전송을 위한 피드백 방법의 클래스를 분류하고 이들에 대해 성능 분석을 수행한다. 제안한 2-폴링 피드백 방법이 기존 피드백 방법보다 패킷 전송 지연시간과 패킷 안정화 시간 측면에서 우수함을 보인다. 2-폴링 방법은 전체-폴링 방법보다 복잡도가 낮으며, 1-폴링 방법과 비교할 때는 동일한 복잡도에 패킷 안정화 시간이 반 정도 감소함을 알 수 있다.