• Title/Summary/Keyword: Forwarding

Search Result 695, Processing Time 0.026 seconds

QUEUEING SYSTEMS WITH N-LIMITED NONSTOP FORWARDING

  • LEE, YUTAE
    • East Asian mathematical journal
    • /
    • v.31 no.5
    • /
    • pp.707-716
    • /
    • 2015
  • We consider a queueing system with N-limited nonstop forwarding. In this queueing system, when the server breaks down, up to N customers can be serviced during the repair time. It can be used to model an assembly line consisting of several automatic stations and a manual backup station. Within the framework of $Geo^X/D/1$ queue, the matrix analytic approach is used to obtain the performance of the system. Some numerical examples are provided.

Routing and Forwarding with Flexible Addressing

  • Poutievski, Leonid B.;Calvert, Kenneth L.;Griffioen, James N.
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.383-393
    • /
    • 2007
  • We present a new network-layer architecture that provides generalized addressing. The forwarding infrastructure is independent of the addressing architecture, so multiple addressing architectures can be used simultaneously. We compare our solution with the existing Internet protocols for unicast and multicast services, given the address assignment used in the Internet. By means of an extensive simulation study, we determine the range of parameters for which the overhead costs(delay, state, and network load) of our service are comparable to those of the Internet.

Control Method for the number of check-point nodes in detection scheme for selective forwarding attacks (선택적 전달 공격 탐지 기법에서의 감시 노드 수 제어기법)

  • Lee, Sang-Jin;Cho, Tae-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.387-390
    • /
    • 2009
  • Wireless Sensor Network (WSN) can easily compromised from attackers because it has the limited resource and deployed in exposed environments. When the sensitive packets are occurred such as enemy's movement or fire alarm, attackers can selectively drop them using a compromised node. It brings the isolation between the basestation and the sensor fields. To detect selective forwarding attack, Xiao, Yu and Gao proposed checkpoint-based multi-hop acknowledgement scheme (CHEMAS). The check-point nodes are used to detect the area which generating selective forwarding attacks. However, CHEMAS has static probability of selecting check-point nodes. It cannot achieve the flexibility to coordinate between the detection ability and the energy consumption. In this paper, we propose the control method for the number fo check-point nodes. Through the control method, we can achieve the flexibility which can provide the sufficient detection ability while conserving the energy consumption.

  • PDF

Distributed Mobility Management Strategy with Pointer Forwarding Technique

  • Wie, Sunghong;Jang, Jaeshin
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.4
    • /
    • pp.248-256
    • /
    • 2015
  • With the dramatic increase in mobile traffic in recent years, some of the limitations of mobility management frameworks have magnified. The current centralized mobility management (CMM) strategy has various problems, such as a suboptimal routing path, low scalability, signaling overhead, and a single point of failure. To overcome these weaknesses in the CMM strategy, the Internet Engineering Task Force has been discussing distributed mobility management (DMM) strategies. The fundamental concept of a DMM strategy is to distribute the mobility anchors closer to the users. While the distribution of mobility anchors results in low-cost traffic delivery, it increases the signaling cost. To reduce this higher signaling cost, we propose a new DMM strategy applying the pointer forwarding technique. The proposed strategy keeps the existing tunnels and extends the traffic path as much as possible. In this paper, we analyze the performance of the pointer forwarding-DMM strategy and discuss its pros and cons.

Design of n Forwarding Engine Supporting Application-based Differential Services in MPLS ATM System

  • Kim, Eung-Ha;Cho, Young-Jong
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1855-1858
    • /
    • 2002
  • A number of MPLS ATM systems have been proposed to increase the access speed of current routers, which only support the best-effort service. However, the MPLS ATM systems have to support the so-called differential service, which discriminates the applications according to the service class because they do not be satisfied the Internet users who use diverse applications. In this paper, to support this differential service a detailed forwarding procedure based on a LSP control method and an application-based marking algorithm is suggested. The LSP control method establishes several different LSPs for each FEC according to the service class and the application-based marking algorithm chooses a proper differential service depending on the application category. Also, a design scheme of forwarding engine, which can be easily implemented with a minimum modification of existing MPLS ATM systems is proposed. And, the best simulation result of high priority application category is gained when the proposed forwarding algorithm is comparedwithexistingalgorithms.

  • PDF

Probability Adjustment Scheme for the Dynamic Filtering in Wireless Sensor Networks Using Fuzzy Logic (무선 센서 네트워크에서 동적 여과를 위한 퍼지 기반 확률 조절 기법)

  • Han, Man-Ho;Lee, Hae-Young;Cho, Tae-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.159-162
    • /
    • 2008
  • Generally, sensor nodes can be easily compromised and seized by an adversary because sensor nodes are hostile environments after dissemination. An adversary may be various security attacks into the networks using compromised node. False data injection attack using compromised node, it may not only cause false alarms, but also the depletion of the severe amount of energy waste. Dynamic en-route scheme for Filtering False Data Injection (DEF) can detect and drop such forged report during the forwarding process. In this scheme, each forwarding nodes verify reports using a regular probability. In this paper, we propose verification probability adjustment scheme of forwarding nodes though a fuzzy rule-base system for the Dynamic en-route filtering scheme for Filtering False Data Injection in sensor networks. Verification probability determination of forwarding nodes use false traffic rate and distance form source to base station.

  • PDF

Cache Management Method for Query Forwarding Optimization in the Grid Database (그리드 데이터베이스에서 질의 전달 최적화를 위한 캐쉬 관리 기법)

  • Shin, Soong-Sun;Jang, Yong-Il;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.13-25
    • /
    • 2007
  • A cache is used for optimization of query forwarding in the Grid database. To decrease network transmission cost, frequently used data is cached from meta database. Existing cache management method has a unbalanced resource problem, because it doesn't manage replicated data in each node. Also, it increases network cost by cache misses. In the case of data modification, if cache is not updated, queries can be transferred to wrong nodes and it can be occurred others nodes which have same cache. Therefore, it is necessary to solve the problems of existing method that are using unbalanced resource of replica and increasing network cost by cache misses. In this paper, cache management method for query forwarding optimization is proposed. The proposed method manages caches through cache manager. To optimize query forwarding, the cache manager makes caching data from lower loaded replicated node. The query processing cost and the network cost will decrease for the reducing of wrong query forwarding. The performance evaluation shows that proposed method performs better than the existing method.

  • PDF

Location Management Scheme by using Jumping Pointer in Distributed HLR Environment (분산 HLR 환경에서 분기포인터를 이용한 위치 관리 기법)

  • Lee, Bo-Kyung;Hwang, Chong-Sun
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.1
    • /
    • pp.30-38
    • /
    • 2000
  • In distributed HLR environment, the pointer forwarding with distributed HLR(Pointer Forwarding Scheme) has been proposed for eliminating the cost of updating multiple HLRs. In Pointer Forwarding Scheme, the find cost can be changed according to from which HLR a call originates. If a user changes PCS registration areas frequently, but receives calls relatively infrequently, and call for such a user originates from any other HLRs than the recently updated HLR, many VLRs should be traversed in order to find that user. In this paper, location tracking with jumping pointer in distributed HLR(Jumping Pointer Scheme) is proposed. The jumping pointer can be connected between the recently updated VLR and the VLR in which the mobile host currently resides. In case of call delivery, the mobile host can be found sooner by using the jumping pointer. In terms of 'find' cost, Jumping Pointer scheme improves about 17% over Forwarding Pointer scheme. Otherwise, Jumping Pointer scheme takes additional update charge in order to manage the jumping pointer. However the total costs of 'find' cost and 'update' cost for Jumping Pointer scheme are cheaper than them for Forwarding Pointer scheme when call-to-mobility ratio is smaller.

  • PDF

CEM-PF: Cost-Effective Mobility Management Scheme Based on Pointer Forwarding in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 포인터 포워딩에 기반한 비용효과적인 이동성관리 기법)

  • Park, Seung-Yoon;Jeong, Jong-Pil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.81-93
    • /
    • 2012
  • We propose efficient mobility management schemes based on pointer forwarding for Proxy Mobile IPv6 Networks(PMIPv6) with the objective to reduce the overall network traffic incurred by mobility management and packet delivery. The proposed schemes are per-user-based, i.e., the optimal threshold of the forwarding chain length that minimizes the overall network traffic is dynamically determined for each individual mobile user, based on the user's specific mobility and service patterns. We demonstrate that there exists an optimal threshold of the forwarding chain length, given a set of parameters characterizing the specific mobility and service patterns of a mobile user. We also demonstrate that our schemes yield significantly better performance than schemes that apply a static threshold to all mobile users. A comparative analysis shows that our pointer forwarding schemes outperform routing-based mobility management protocols for PMIPv6.

MADF: Mobile-Assisted Data Forwarding for Wireless Data Networks

  • Xiaoxin;Gary, Shueng-Han;Biswanath;Bharat
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.216-225
    • /
    • 2004
  • In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.