• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.3 no.4
• /
• pp.274-279
• /
• 2002

ATM packet switching technologies for the purpose of the B-ISDN service are focused on high performance which represents good qualities on throughput, packet loss, and packet delay. ATM switch designs on a class of parallel interconnection network have been researched. But these are based on the self-routing function of it. It leads to conflict with each other, and to lose the packets. Therefore, this paper proposes the method based on Sort-Banyan network should be adopted for optimal routing algorithm. It is difficult to expect good hardware complexity. For good performance, a switch design based on the development of new routing algorithm is required. For the design of switch network, the packet distributor and multiplane are proposed. They prevent each packet from blocking as being transmitted selectively by two step distributed decision algorithm. This switch will be proved to be a good performance switch network that internal blocking caused from self-routing function is removed. Also, it is expected to minimize the packet loss and decrease the packet delay according to packet transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.745-752
• /
• 2005

BGP is a unique routing protocol in broadband internet. It chooses routing paths considering internet hierarchy and local policies. As BGP routers selectively bypass routing information to a subset of neighboring BGP routers, connectivity by way of a series of links between source and destination nodes does not mean reachability of routing information of the two. In emergency when BGP routers or links over wide range are not available, BGP routers have to use links that are not normally used to keep reachability. This paper listed out the requirements for BGP backup routing and proposed a routing solution that hides most demerits in currently published ones. The proposed backup operates in three tiers according to network damage. Under this rule, BGP routers use tier-0 routing paths at normal. If networks are impaired, they choose tier-1 paths. If networks are seriously damaged, tier-2 paths are allowed to use. Also this paper proves that the proposed backup guarantees stability and safeness. As results, the proposed backup is very adaptive to light network damages as well as serious ones and provides strong routing reachability at all times.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.465-468
• /
• 2007

An intelligent home network system using low-power and low-cost sensor nodes was designed and implemented. In Intelligent Home Network System, active home appliances control is composed of RSSI (Received Signal Strength Indicator) based user indoor location tracking, dynamic multi-hop routing, and learning integration remote-control. Through the remote-control learning, home appliances can be controlled in wireless network environment. User location information for intelligent service is calculated using RSSI based Triangle measurement method, and then the received location information is passed to Smoothing Algorithm to reduce error rate. In order to service Intelligent Home Network, moreover, the sensor node is designed to be held by user. The gathered user data is transmitted through dynamic multi-hop routing to server, and real-time user location & environment information are displayed on monitoring program.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.883-892
• /
• 2002

Mobile IP has been designed only to maintain communications as they move from place to place, so it doesn't guarantee Quality of Service (QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile environment, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS -2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.5
• /
• pp.15-25
• /
• 2007

According to augmentation about interesting and demanding of privacy over the rest few years, researches that provide anonymity have been conducted in a number of applications. The ad hoc routing with providing anonymity protects privacy of nodes and also restricts collecting network information to malicious one. Until recently, quite a number of anonymous routing protocols have been proposed, many of them, however, do not make allowance for authentication. Thus, they should be able to have vulnerabilities which are not only modifying packet data illegally but also DoS(denial of service) attack. In this paper, we propose routing protocol with providing both anonymity and authentication in the mobile ad hoc network such as MANET, VANET, and more. This scheme supports all of the anonymity properties which should be provided in Ad Hoc network. In addition, based on the group signature, authentication is also provided for nodes and packets during route discovery phase. Finally, route discovery includes key-agreement between source and destination in order to transfer data securely.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.