• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.205-215
• /
• 2008

As static traffic assignment has reached its limitation with ITS policy applications and due to the increase of interest in studies of ITS policies since the late 1980's, dynamic traffic assignment has been considered a tool to overcome such limitations. This study used the Dynameq program, which simulates route choice behavior by macroscopic modeling and dynamic network loading and traffic flow by microscopic modeling in consideration of the feasibility of the analysis of practical traffic policy. The essence of this study is to evaluate the feasibility for analysis in practical transportation policy of using the dynamic traffic assignment technique. The study involves the verification of the values estimated from the dynamic traffic assignment with South Korea's expressway network and dynamic O/D data by comparing results with observed link traffic volumes. This study used dynamic O/D data between each toll booth, which can be accurately obtained from the highway Toll Collection System. Then, as an example of its application, exclusive bus-lane policies were analyzed with the dynamic traffic assignment model while considering hourly variations.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.377-382
• /
• 2005

This paper deals with productivity improvement of stevedoring system by pooling opertaions of transport vehicle at automated container terminal. Usually, in traditional container terminals, grouping operations of transport vehicle are applied for container crane because vehicle routing path is simple and vehicle assignment is easy. But this static assignment(SA) operation that arrsign vehicles to container crane ar apron reduces flexibility of vehicles. Therefore, This paper presented 4 dynamic assignment(DA) method to improve efficiency of vehicles. These 4 dynamic assignment method consider present situations of container crane such as sequence(Se), queue time(Qt), productivity(Pr), numeric of vehicle assignment(Nv), numeric of buffer(Nb) at vehicles assignment. At the results, dynamic assignment operation to consider Qt, Nv, Nb is most efficient and by next time, dynamic assignment operation to consider Se is superior more than static assignment operation. but, dynamic assignment operation to consider Pr or Qt of container crane only is inefficient than static assignment operation.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.1
• /
• pp.56-69
• /
• 2005

In this paper, it is clearly shown that the two well-known necessary and sufficient conditions mp n as generic static output feedback pole-assignment and mp + d(m+p) n+d as generic minimum d-th order dynamic output feedback pole-assignment on complex field, unbelievably, do not match up each other in strictly proper linear systems. For the analysis, a diagram analysis is newly created (which is defined by the analysis of 'convoluted rectangular/dot diagrams' constructed via node-branch conversion of the signal flow graphs of output feedback gain loops). Under this diagram analysis, it is proved that the minimum d-th order dynamic output feedback compensator for pole-assignment in m-input, p-output, n-th order systems is quantitatively decomposed into static output feedback compensator and its associated d number of arbitrary 1st order dynamic elements in augmented (m+d)-input, (p+d)-output, (n+d)-th order systems. Total configuration of the mismatched data is presented in a Table.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1229-1238
• /
• 1999

To maximize the statistical multiplexing gain in wireless ATM MAC, a centralized scheduling function must be provided for the dynamic slot assignment in the wireless ATM access point. Exploiting the dynamic parameters received in the wireless ATM access point, the centralized scheduler will execute a dynamic slot assignment to determine bandwidth required for individual wireless terminal. In this paper, we propose a new scheduling algorithm, which can effectively reduce a burden of the explicit signaling requirement of transmitting the dynamic parameters in a timely manner. We have demonstrated that the proposed approach outperforms the existing schemes in terms of the timeliness of transmitting the dynamic parameters, which is a critical factor to the performance of delay-sensitive service classes, and works as an effective means of dynamic slot assignment without heavily relying on the dynamic parameters in the wireless ATM networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1535-1554
• /
• 2016

This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• ETRI Journal
• /
• v.25 no.4
• /
• pp.211-218
• /
• 2003

This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.137-149
• /
• 2006

In this paper, we suggest a message-based communication protocol and a dynamic role assignment mechanism for efficient cooperation and teamwork of agents in computer game environments. This role assignment mechanism is a new one different from both existing static and dynamic mechanisms, in which all decisions related with role assignment are made at once in design phase or execution phase. According to our mechanism, all possible role sets are determined in design phase. Detail decisions regarding which agent takes what role, however, are made in execution phase. This mechanism for role assignment can minimize the negotiation effort in execution phase. Therefore, this mechanism is quite effective especially in real-time multiagent environments. Through experiments, we show the superiority of the new dynamic role assignment mechanism.

• Convergence Security Journal
• /
• v.11 no.1
• /
• pp.3-10
• /
• 2011

This paper proposes DPA(Dynamic Priority Assignment) MAC protocol to improve the traffic QoS on the HFC-CATV(Hybrid Fiber Coax CAble TeleVision) network. In results, DPA MAC protocol is the best performance compare with to IEEE 802.14a MAC in mean request delay, mean access delay. Also, the paper prove a reliability of proposed protocol through comparison between performance analysis and simulation result of DAP MAC protocol.

• Proceedings of the KOR-KST Conference
• /
• 2002.02a
• /
• pp.97-139
• /
• 2002

The aim of the present study is to find a good quality user equilibrium assignments under time varying condition. For this purpose, this study introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it develops a novel solution algorithm that does not need evaluation of the objective function by modifying the Schittenhelm (1990)'s algorithm. This novel algorithm turns out to be efficient and convenient compared to the conventional Frank-Wolfe (1956) algorithm because the former finds solutions based on routes rather than links so that it can maintain correct flow propagation intrinsically in the time-varying network conditions. The application of dynamic user equilibrium (DUE) assignment model with this novel solution algorithm to test networks including medium-sized one shows that the present DUE assignment model gives rise to high quality discrete time solutions when we adopt the deterministic queuing model for a link performance function, and we associate flows and costs in a proper way.