Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Packet Routing and Information Gathering in Lines, Rings and Trees #
 

Summary: Packet Routing and Information Gathering in Lines,
Rings and Trees #
Yossi Azar + Rafi Zachut #
Abstract
We study the problem of online packet routing and information gathering in lines, rings and
trees. A network consists of n nodes. At each node there is a bu#er of size B. Each bu#er can
transmit one packet to the next bu#er at each time step. The packets injection is under adversarial
control. Packets arriving at a full bu#er must be discarded. In information gathering all packets
have the same destination. If a packet reaches the destination it is absorbed. The goal is to
maximize the number of absorbed packets. Previous studies have shown that even on the line
topology this problem is di#cult to handle by online algorithms. A lower bound of # # n) on
the competitiveness of the Greedy algorithm was presented by Aiello et al in [2]. All other known
algorithms have a polynomial competitive ratio. In this paper we give the first O(log n) competitive
deterministic algorithm for the information gathering problem in lines, rings and trees. We also
consider multi­destination routing where the destination of a packet may be any node. For lines and
rings we show an O(log 2 n) competitive randomized algorithms. Both for information gathering
and for the multi­destination routing our results improve exponentially the previous results.
1 Introduction
Overview: Packet routing networks, have become dominant platform for carrying data. In this paper
we investigate a packet routing and information gathering in lines, rings and trees. In information

  

Source: Azar, Yossi - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences