Efficient algorithms for erasure node placement on slotted dual bus networks

We study the problem of placing erasure nodes among passive stations in a slotted dual bus network. Erasure nodes are known to improve throughput by allowing slot reuse. It is also known that choices made in locating erasure nodes significantly impact network congestion and overall throughput-especially when traffic patterns exhibit a high degree of locality. We present algorithms to determine optimal placements of erasure nodes that improve upon prior work on this problem: we present simpler and faster polynomial-time algorithms and also consider various useful cost measures. These algorithms can be used to solve related placement problems in which limits on congestion and existing placements are given as input, and the goal is to find the minimum number of erasure nodes required to meet the congestion bound.

[1]  Oran Sharon,et al.  On the efficiency of slot reuse in the Dual Bus configuration , 1994, TNET.

[2]  Biswanath Mukherjee,et al.  A Journey Through the DQDB Network Literature , 1992, Perform. Evaluation.

[3]  Moshe Zukerman,et al.  A protocol for eraser node implementation within the DQDB framework , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[4]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[5]  Ahmed E. Kamal.  Efficient multi-segment message transmission with slot reuse on DQDB , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[6]  Oran Sharon,et al.  Schemes for slot reuse in CRMA , 1994, TNET.

[7]  Sarit Mukherjee,et al.  On optimal placement of erasure nodes on a dual bus network , 1995, Proceedings of INFOCOM'95.

[8]  Manoel A. Rodrigues.  Erasure node: performance improvements for the IEEE 802.6 MAN , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[9]  Daniela Panno,et al.  FQDB: A Fair Multisegment MAC Protocol for dual Bus Networks , 1993, IEEE J. Sel. Areas Commun..

[10]  San-qi Li,et al.  A study of slot reuse in dual bus multiple access networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  Bhagirath Narahari,et al.  Efficient algorithms for erasure node placement on DQDB networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[12]  R. Pignatelli,et al.  The 'balanced' erasure node: a mechanism for slot reuse in DQDB protocol , 1991, ICC 91 International Conference on Communications Conference Record.

[13]  San-qi Li,et al.  A Study of Slot Reuse in Dual Bus Multiple Access Networks , 1991, IEEE J. Sel. Areas Commun..