• Title/Summary/Keyword: Multi-Service Routing

Search Result 100, Processing Time 0.025 seconds

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

Cross-Layer Service Discovery Scheme for Hybrid Ad-hoc Networks (하이브리드 애드-혹 네트워크를 위한 크로스-레이어 서비스 검색 기법)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.223-228
    • /
    • 2009
  • Efficient service discovery mechanism is a crucial feature for a hybrid ad-hoc network supporting extension of a wireless ad-hoc network to the Internet. We propose an efficient cross-layer service discovery mechanism using non-disjoint multi-path source routing protocol for hybrid ad-hoc networks. Our scheme has advantages of multi-path routing protocol and cross-layer service discovery. Intuitively, it is not difficult to imagine that the cross-layer service discovery mechanism could result in a decreased number of messages compared to the traditional approach for handling routing independently from service discovery. By simulation, we show that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

Cognitive Routing for Multi-hop Mobile Cognitive Radio Ad Hoc Networks

  • Lee, Jae-Joon;Lim, Jaesung
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.155-161
    • /
    • 2014
  • Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

Service Discovery Scheme for Wireless Ad-hoc Networks (무선 애드-혹 네트워크를 위한 효율적인 서비스 검색 기법)

  • Kim, Moon-Jeong;Lee, Dong-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.13 no.2
    • /
    • pp.245-250
    • /
    • 2008
  • Efficient service discovery mechanism is a crucial feature for the usability of a wireless ad-hoc network. A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration. We propose an efficient service discovery mechanism using non-disjoint multi-path routing protocol for a wireless ad-hoc network. Our scheme has advantages of not only multi-path routing protocol but also cross-layer service discovery. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

A Study on Effective ATM Multi-Path Routing Method (효율적인 ATM 다중 경로 라우팅 기법에 관한 연구)

  • Go, Jang-Hyeok;Lee, Dong-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.3
    • /
    • pp.681-691
    • /
    • 1999
  • It was already proved that ATM stability and flexibility of service application, but because of the various characteristics of traffics and the QoS on user demand caused by them, there are a lot of researches for traffic management method. However, there are a few of researches for ATM routing method acting on traffic management practically. In this paper, we focus on multi-path routing method transporting cells with multiple paths and compare this method with existing single path routing method and analyze multi-path routing method into three elements with simple formula and propose anew methods improving the performance of ATM routing and simulate these methods.

  • PDF

On QoS Routing and Path Establishment in the Presence of Imprecise State Information

  • Yuan, Xin;Duan, Zhenhai
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.356-367
    • /
    • 2007
  • In large networks, maintaining precise global network state information is impossible. The imprecise network state information has significant impacts on Quality-of-Service(QoS) routing and path establishment. In this paper, we develop analytical models for investigating the QoS routing schemes that are designed to tolerate imprecise network state information, and study the performance of various QoS routing schemes, including randomized routing, multi-path routing, and probability based routing, using both the models and simulations. We further propose a new mechanism, called local rerouting, that improves the effectiveness of QoS path establishment in the presence of imprecise global network state information. Local rerouting is orthogonal to existing schemes for dealing with imprecise state information and can be used in conjunction with them to alleviate the impacts of the imprecise information. The results of our performance study indicate that local rerouting is robust and effective.

Design and Implementation of Intelligent Wireless Sensor Network Based Home Network System (무선 센서 네트워크 기반의 지능형 홈 네트워크 시스템 설계 및 구현)

  • Shin, Jae-Wook;Yoon, Ba-Da;Kim, Sung-Gil;Chung, Wan-Young
    • 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.

  • PDF

A Design of Call Routing Agent for Multi-Channel (멀티채널 환경에서의 콜 에이전트 설계 및 구현)

  • Jun, Byung-Uk
    • Journal of Internet Computing and Services
    • /
    • v.9 no.2
    • /
    • pp.139-145
    • /
    • 2008
  • CRM(Customer Relationship Management) improves the competitiveness of small companies to large enterprises. E-mail, SMS (Short Message Service), telephony service, DM (Direct Mail) are used for customer response in many companies. In order to improve company's profit, business diversification is in progress with protecting the succession of existing customers, and the only of new customers. Futhermore, BPR (Business Process Re-engineering) and BPM (Business Process Management) of the CRM can be easily found in many companies, because it is the first contact point to the company at the customer's view. This paper discusses the development of CRM, and proposes a call object routing agent that is the main engine of the CRM. Result of performance evaluation of proposed method show that the system is effective and powerful enough to use at the multi-channel environment.

  • PDF

On the Optimal Routing for City-Wide Synchronous PRT (도심지 서비스를 위한 Synchronous PRT의 최적경로설정)

  • Kim, Dong-Hee
    • Journal of the Korea Safety Management & Science
    • /
    • v.12 no.3
    • /
    • pp.315-320
    • /
    • 2010
  • Recently, there are environmental issues for sustainable transportation system to pursue the energy-efficient and environment-friendly public urban transit. These transportation system needs to offer demand-oriented high-quality service being on the same level with cab service for urban space. PRT(Personal Rapid Transit), small track-guided vehicle, is repeatedly mentioned as a possible alternative for the new urban public transportion system, but but there are not many researches on the operational optimal routing for PRT network. In this paper, the concept of PRT and general optimal routing methods are reviewed. And we suggest the optimal routing method for city-wide PRT network with multi-vehicles and stations, junctions and directional arcs. Futher research directions for PRT routing are presented.

On the Optimal Vehicle Routing of City-Wide PRT based on Synchronization (동기화 기반 City-Wide PRT의 최적경로설정 방안 연구)

  • Kim, Dong-Hee;Lee, Tae-Yun
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • pp.1203-1208
    • /
    • 2010
  • Recently, there are environmental issues for sustainable transportation system to pursue the energy-efficient and environment-friendly public urban transit. These transportation system needs to offer demand-oriented high-quality service being on the same level with cab service for urban space. PRT(Personal Rapid Transit), small track-guided vehicle, is repeatedly mentioned as a possible alternative for the new urban public transportion system, but but there are not many researches on the operational optimal routing for PRT network. In this paper, the concept of PRT and general optimal routing methods are reviewed. And we suggest the optimal routing method for city-wide PRT network with multi-vehicles and stations, junctions and directional arcs. Futher research directions for PRT routing are presented.

  • PDF