• Journal of Korean Society of Transportation
• /
• v.26 no.6
• /
• pp.123-132
• /
• 2008

Dynamic origin-destination (OD) trip matrix has been widely used for transportation fields such as dynamic traffic assignment, traffic operation and travel demand management, which needs precise OD trip matrix to be collected. This paper presents a quasi-dynamic OD matrix estimation model and applies it to real road network for collecting the dynamic OD matrix. The estimation model combined with dynamic traffic assignment program, DYNASMART-P, is based on GPS embedded in PDA, which developed for collecting sample dynamic OD matrix. The sample OD matrix should be expanded by the value of optimal sampling ratio calculated from minimization program. From application to real network of Jeju, we confirm that the model and its algorithm produce a reasonable solution.

• 한국ITS학회:학술대회논문집
• /
• 2002.11a
• /
• pp.181-184
• /
• 2002

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1732-1743
• /
• 1998

In this paper, we have proposed a channel assignment shceme for the multiple traffic class environment where the traffic volume varies with time. Our basic idea is to assign radio channels considering the characteristics of each traffic class and mobile speed and change the number of allocated channels for each traffic class according to vaiation of traffic volume. To evalute the perfomance of our proposed algorithms, we conducted analyical and simulation studies. We derived new call blocking probability and hand-off failure probability of the proposed scheme analytically. The simulatioh results show that our proposed algorithms can grantee GOS of each traffic class and provide a fairness between the new call and the hand-off call.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1302-1310
• /
• 1997

In this paper, we propose a dynamic code allocation strategy using voice activity detection and evaluate the performance of a dynamic code allocation strategy using voice activeity detection in DS-CDMA system. Proposed method allocates code to mobile terminal according to the residual capacity computed by SIR in the base station. In hot spot traffic loading cell, we find that the performance of proposed method is better than that of a fixed code assignment strategy using voice activity detection. Also, we find that the proposed method provide much improvement in blocking probability against the dynamic code assignment strategy withoug voice activity detection.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.167-170
• /
• 2006

Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In audition, it can create time-complexity problems such as O(W $N^3$) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W $N^2$) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1169-1176
• /
• 2000

In this paper, label assignment schemes considering the IP flow model for the efficient MPLS traffic engineering are proposed and evaluated. Based on the IP flow model, the IP flows are classified into transient flows and base flows. Base flows, which last for a long time, transmit data in high bit rate, and be composed of many packets, have good implications for the MPLS traffic engineering, because they usually cause network congestion. To make use of base flows for the MPLS traffic engineering, we propose two base flow classifiers and label assignment schemes where transient flows are allocated to the default LSPs and base flows to explicit LSPs. Proposed schemes are based on the traffic-driven label triggering method combined with a routing tabel. The first base flow classifier uses both flow size in packet counts and routing entries, and the other one, extending the dynamic X/Y flow classifier, is based on a cut-through ratio. Proposed schemes are shown to minimize the number of labels, not degrading the total cut-through ratio.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.91-98
• /
• 2004

This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.143-155
• /
• 2009

A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.30-37
• /
• 2002

In this paper, we propose a new adaptive slot assignment algorithm called In-VDSA in order to guarantee the QoS(Quality of Service) of VBR(Variable Bit Rate) traffics in wireless ATM and maximize efficiency in use of wireless channels. In the proposed algorithm, the status of terminal buffers is encoded in signed number on the GFC(Generic Flow Control) field of an ATM cell header and piggybacked. And also, the number of slots to be assigned to the next frame is adjusted effectively, which is different to methods in the conventional slot assignment algorithms. As a result, we can guarantee QoS such as CLR(Cell Loss Rate) and cell delay and achieve the higher utilization of channels. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the BONeS tool and comparison with conventional methods.