• Title/Summary/Keyword: Traffic Node

Search Result 626, Processing Time 0.027 seconds

Traffic Information Service Model Considering Personal Driving Trajectories

  • Han, Homin;Park, Soyoung
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.951-969
    • /
    • 2017
  • In this paper, we newly propose a traffic information service model that collects traffic information sensed by an individual vehicle in real time by using a smart device, and which enables drivers to share traffic information on all roads in real time using an application installed on a smart device. In particular, when the driver requests traffic information for a specific area, the proposed driver-personalized service model provides him/her with traffic information on the driving directions in advance by predicting the driving directions of the vehicle based on the learning of the driving records of each driver. To do this, we propose a traffic information management model to process and manage in real time a large amount of online-generated traffic information and traffic information requests generated by each vehicle. We also propose a road node-based indexing technique to efficiently store and manage location-based traffic information provided by each vehicle. Finally, we propose a driving learning and prediction model based on the hidden Markov model to predict the driving directions of each driver based on the driver's driving records. We analyze the traffic information processing performance of the proposed model and the accuracy of the driving prediction model using traffic information collected from actual driving vehicles for the entire area of Seoul, as well as driving records and experimental data.

An Improvement of Speed for Wavelength Multiplex Optical Network using Optical Micro Electro Mechanical Switches (광마이크로전자기계 스위치를 이용한 파장다중 광네트워크의 속도 재선)

  • Lee Sang-Wha;Song Hae-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.123-132
    • /
    • 2005
  • In this Paper, we present an improvement of switch node for wavelength multiplex optical network. Currently because of quick increase of internet traffic a big network capacity is demanded. Wavelength multiplex optical network Provides the data transfer of high speed and the transparent characteristic of the data. Therefore optic network configuration is the most powerful technology in the future. It will be able to control the massive traffic from the optical network in order to transmit the multimedia information of very many quantify. Consequently the node where the traffic control is Possible, is demanded. The optical switch node which manages efficiently the multiple wavelength was Proposed. This switch is composed of a optical switch module for switching and a wavelength converter module for wavelength conversion. It will be able to compose the switch fabric without optical/electro or electro/optical conversion using optical MEMS(Micro Electro Mechanical Switches) module. Finally, we present the good test result regarding the operational qualify of the switch fabric and the performance of optical signal from the switch node. The proposed switch node of the optic network will be able to control the massive traffic with all optical.

  • PDF

Optimal Path Searching for Efficient Migration of Mobile Agent (이동 에이전트의 효율적 이주를 위한 최적 경로 탐색)

  • Kim, Kwang-Jong;Ko, Hyun;Kim, Young-Ja;Lee, Yon-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.117-124
    • /
    • 2006
  • In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantify of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal Therefore. this paper presents the migration method of agent which can try to adjust and reassign path to the destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

  • PDF

Survivable Traffic Grooming in WDM Ring Networks

  • Sankaranarayanan, Srivatsan;Subramaniam, Suresh;Choi, Hong-Sik;Choi, Hyeong-Ah
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.93-104
    • /
    • 2007
  • Traffic grooming, in which low-rate circuits are multiplexed onto wavelengths, with the goal of minimizing the number of add-drop multiplexers (ADMs) and wavelengths has received much research attention from the optical networking community in recent years. While previous work has considered various traffic models and network architectures, protection requirements of the circuits have not been considered. In this paper, we consider survivable traffic grooming, or grooming traffic which contains a mix of circuits that need protection and that do not need protection. We assume a unidirectional ring network with all-to-all symmetric traffic with $t\geq1$ circuits between each node pair, of which s require protection. As it turns out, survivable traffic grooming presents a significant tradeoff between the number of wavelengths and the number of ADMs, which is almost non-existent in non-survivable traffic grooming for this type of traffic. We explore this tradeoff for some specific cases in this paper. We also present some new results and solution methods for solving certain non-survivable traffic grooming problems.

The study on Traffic management in Mobile Ad-hoc Network (이동 Ad-hoc 네트워크에서의 트래픽 관리에 관한 연구)

  • 강경인;박경배;유충렬;문태수;정근원;정찬혁;이광배;김현욱
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2002.05a
    • /
    • pp.121-127
    • /
    • 2002
  • In this paper, we propose traffic management support and evaluate the performance through simulation. We suggest traffic management routing protocol that can guarantee reliance according to not only reduction of the Network traffic congestion but also distribution of the network load that prevents data transmission. For performance evaluation, we analyzed the average data reception rate and network load, considering the node mobility. We found that in the mobile Ad Hoc networks, the traffic management service increased the average data reception rate and reduced the network traffic congestion and network load in Mobile Ad Hoc Networks.

  • PDF

Traffic Flow Control of B-NT for Prevention of Congestion in B-ISDN UNI (B-ISDN UNI에서 폭주를 예방하기 위한 B-NT의 트래픽 흐름 제어)

  • 이숭희;최흥문
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.6
    • /
    • pp.1085-1094
    • /
    • 1994
  • We propose a traffic flow control scheme of B-NT with temporary cell buffering and selective cell discarding to prevent congestion state of the network nodes in B-ISDN systems to reduce or suppress output cell strams towards T interface. We define the states of the network nodes as normal, pre-congestion, and congestion. In a pre-congestion state, the loss-sensitive traffic is temporarily buffered to slow down the rate of the output traffic streams. In a congestion state, the delay-sensitive traffic is selectively discarded to suppress the output traffic streams as possible in addition to the cell buffering. We model the input cell streams and the states of the network nodes with Interrupted Bernoulli Process and 3-state Markov chain to analyze the performance of the proposed scheme in the B-NT system. The appropriate size of the cell buffer is explored by means of simulation and the influence on the performance of the proposed scheme by the network node state is discussed. As results, more than 2,00 cells of buffer size is needed for the control of medium of lower than the medium, degree of congestion occurrence in the network node while the control of high degree of congestion occurrence is nearly impossible.

  • PDF

Performance Evaluation of Signaling and Data Traffic in UMTS Packet Core Networks (UMTS 패킷 코아 망에서 신호 및 데이터 트래픽 성능 분석)

  • Kim, Byung-Chul;Lee, Jae-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.4
    • /
    • pp.25-34
    • /
    • 2004
  • UMTS network, evolved from GSM, includes packet core network that consists of SGSNS and GGSNs. Service providers should consider subscriber mobility, location registration, and subscriber distribution when designing packet core networks and network elements. Since one of the major traffic sources for IMT-2000 will be data which has bursty characteristics, new design guidelines for dimensioning of SGSN and GGSN should be proposed under various constraints of system parameters. In this paper, we first evaluate the performance of signaling traffic for packet call subscribers. After that, we also obtain the impact of bursty data traffic on the SGSN and GGSN by simulation, and suggest new dimensioning guidelines for packet core network of UMTS under various environments.

A Multistage Authentication Strategy for Reliable N-to-N Communication in CGSR based Mobile Ad Hoc Networks (CGSR 기반의 이동 애드 흑 네트워크에서 신뢰성 있는 통신을 위한 노드간 인증 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.659-667
    • /
    • 2005
  • A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

A Scheme of the Distributed Path Assignment in Network with Hierarchical Topology (계층적 망구조에서의 분산 경로 설정 방안)

  • 김형철;홍충선;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.925-930
    • /
    • 2000
  • The Problem of allocating paths is very significant in order to transmit a large amount of various data on the ATM network. Therefore, selecting an optimal path among available paths between the a source node and a target node has been researched. Alternate paths designed in previous PNNI routing is not considered on the group-occupation so that traffic congestion happens, when errors occur in the network which consists of a hierarchical network architecture extendable to a large network, We propose the Top-Down algorithm considering an average of the occupation among the groups reported from a leader node in each group and minimizing a traffic congestion

  • PDF

Approximated Analysis of Mean Waiting Time in Packet Based Priority Token Ring LAN (패킷에 우선도가 있는 토큰링 LAN에서의 평균대기시간의 근사해석)

  • 김영동;이재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.5
    • /
    • pp.453-461
    • /
    • 1989
  • Mean waiting time for each priority packet of each node in packet based priority token ring local area networks(LAN) was approximately analyzed using Bux's token ring LAN results which have not considered priority and Cohbam's head of line(HOL) priority results. In this paper, priority reservation method suggested in the IEEE 802.5 standard was not used. Relative error between numerical results which was presented in this paper and simulation results was identified by +-5%. For traffic intenity, number of node, packet length, transmission speed, line length, token latency, number of priority class and traffic percentage to some heavy trafficd node, mean waiting time of each priority was analyzed.

  • PDF