• Journal of the Korean Society for Railway
• /
• v.20 no.1
• /
• pp.142-155
• /
• 2017

It is anticipated that, in cases in which different train operators share railway network, conflicts may occur among train operators with regard to train operation rate, train priorities, and arrival and departure time; besides this, during times when there is high demand for trains, operators will request train operations intensively, steadily increasing train conflict phenomena. In the present study, train operation sequence, minimum headway, arrival and departure time, train priorities, etc., were analyzed, and while using train departure times as decision variables in variably given train schedules, by adjusting train time requested by train operators, and finally rejecting the train times in cases in which conflict resolution is impossible, so that various constraints can be satisfied, a train slot allocation model was suggested to find the objective function, that is, the maximum number of train slots that can be practically applicable to railway operation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.30-38
• /
• 2006

In this paper, an algerian that provisions absolute and proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through simulation that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.219-227
• /
• 2011

The superframe structure of IEEE 802.15.4, an international standard for low rate WPAN, is composed of CAP(Contention access period) and CFP(Contention free period). CAP is the contention-based access period, while CFP is contention-free access period for supporting QoS by allocating fixed bandwidth. The standard can support QoS for only a few devices, because the maximum number of GTSs is 7. Furthermore, as the value of BO (Beacon order) or SO (Superframe order) increases, the size of a time slot increases. This makes it difficult to precisely allocate bandwidth for any device, because the bandwidth is allocated by the unit of GTS. The proposed scheme of this paper can reduce the waste of BW in CFP by adaptively reducing the size of a time slot in CFP as the value of BO or SO increases and increase the number of GTSs to 127 by modifying the standard. The performance analysis shows that the proposed scheme can dramatically increase the bandwidth utilization during the CFP when comparing with IEEE 802.15.4.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.52-63
• /
• 1998

In this paper, several improvements to a copy network proposed previously for multicast packet switching are described. The improvements provide a solution to some problems inherent in multicasting. The input fairness problem caused by overf low is solved by a dynamic starting point decider(DSD), which can calculate running sums of copy requests starting from any input port. The starting point is changed adaptively in every time slot based on both the fill level of the input buffers in current time slot and the overflow situations of the previous time slot. Using the fill level of the conventional network. The DSD also provides the function of regulating overall copy requests according to the amount of input traffics. This is an essential function in improving overall throughputs of the copy networks. The throughput of a multicast switch can be improved substantially if partial service of copy request is implemented when overflow occurs. Call-splitting can also be implemented by the DSD in a straightforward manner. The hardware for the DSD is derived with the objective of simple architectures for the high speed operation. Simulation study of the copy network under various traffic conditions is presented to evaluate its performance.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.373-382
• /
• 2009

we present more efficient method of a medium access for real-time ubiquitous sensor networks. Proposed MAC protocol is like the randomized CSMA/CA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports from sensor nodes, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using a widely-used network simulation package, NS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time ubiquitous sensor networks which is sensitive to latency.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.57-60
• /
• 2001

This paper has studied the WAP packet transmission time, using WTP SAR algorithm. One method that is improved transfer ability, SAR fragmented WTP total message down from upper layer and then packet is transmitted to RLP frame time slot. In this paper, we analysis the transmission time of WAP packet with variable HLP layer size on the CDMA wireless channel for next generation systems as well as PCS, DCS. From the results, we can obtain the WAP packet transmission time and optimal WTP packet size.

• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.517-527
• /
• 2005

This paper considers a discrete-time queueing system with variable service capacity. Using the supplementary variable method and the generating function technique, we compute the joint probability distribution of queue length and remaining service time at an arbitrary slot boundary, and also compute the distribution of the queue length at a departure time.

• Journal of Korean Society of Environmental Engineers
• /
• v.22 no.5
• /
• pp.939-947
• /
• 2000

Enhanced biological phosphorus removal (EBPR) was performed in an anaerobic/aerobic sequencing batch reactor (SBR). Influent was a synthetic wastewater based on acetate as a carbon source. The sludge age and hydraulic retention time were kept at 10 days and 16 hrs, respectively, Phosphate release during the anaerobic period and phosphate uptake in aerobic period were increased gradually with time. and after about 200 days, steady-state operation could be achieved with complete removal of influent phosphate. Number distribution of microbial community in the sludge performing EBPR was investigated during the steady state operation. 17 rRNA targeted oligonucleotide probes were designed and slot hybridization technique was used to determine the number distribution of each microorganism. In the acetate fed SBR, rRNA belonging to the beta subclass of proteobacteria was the most dominant in total rRNA and rRNA matching to CTE probe was the second, rRNAs of Acinetobacter, Aeromonas and Pseudomonas, which are usually thought as phosphorus accumulating organisms in EBPR processes, constituted less than 10% of total rRNA. From this community analysis, it was inferred that microorganisms belong to the beta subclass of proteobacteia (BET) and CTE such as Rhodocyclus group were important in biological phosphorus removal. Therefore, the role of Acinetobacter, Aeromonas and Pseudomonas in the EBPR might have been overestimated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.73-78
• /
• 2002

In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.