hrcak mascot   Srce   HID

Izvorni znanstveni članak

An Optimal Station Allocation Policy for Tree Local Area Networks

Debashis Saha ; Dept. of Computer Science & Engg, Jadavpur University, Calcutta, India
Amitava Mukherjee ; Price Waterhouse Associates, Salt Lake, Calcutta, India

Puni tekst: engleski, pdf (4 MB) str. 1-9 preuzimanja: 74* citiraj
APA 6th Edition
Saha, D. i Mukherjee, A. (1997). An Optimal Station Allocation Policy for Tree Local Area Networks. Journal of computing and information technology, 5 (1), 1-9. Preuzeto s https://hrcak.srce.hr/150268
MLA 8th Edition
Saha, Debashis i Amitava Mukherjee. "An Optimal Station Allocation Policy for Tree Local Area Networks." Journal of computing and information technology, vol. 5, br. 1, 1997, str. 1-9. https://hrcak.srce.hr/150268. Citirano 05.03.2021.
Chicago 17th Edition
Saha, Debashis i Amitava Mukherjee. "An Optimal Station Allocation Policy for Tree Local Area Networks." Journal of computing and information technology 5, br. 1 (1997): 1-9. https://hrcak.srce.hr/150268
Harvard
Saha, D., i Mukherjee, A. (1997). 'An Optimal Station Allocation Policy for Tree Local Area Networks', Journal of computing and information technology, 5(1), str. 1-9. Preuzeto s: https://hrcak.srce.hr/150268 (Datum pristupa: 05.03.2021.)
Vancouver
Saha D, Mukherjee A. An Optimal Station Allocation Policy for Tree Local Area Networks. Journal of computing and information technology [Internet]. 1997 [pristupljeno 05.03.2021.];5(1):1-9. Dostupno na: https://hrcak.srce.hr/150268
IEEE
D. Saha i A. Mukherjee, "An Optimal Station Allocation Policy for Tree Local Area Networks", Journal of computing and information technology, vol.5, br. 1, str. 1-9, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/150268. [Citirano: 05.03.2021.]

Sažetak
This paper reports on the simulation results of a heuristic solution to the station allocation problem in a tree topology Local Area Network (LAN). A local network is a data communication network where communication remains confined within a moderate sized area, such as a plant site, an office building or a university campus. Tree LANs with collision avoidance switches and multiple broadcast facility have, recently, become popular due to their suitability for high speed light wave communications. Given a tree LAN with fanout F and given the total number of stations N to be connected, a combinatorial optimization problem arises regarding how to allocate the stations to the leaf nodes so that the total system availability (a network performance criteria) is maximized. This is known as the optimal station assignment problem. In this paper, it is formulated as a non-linear optimization problem which can be solved by the Lagrangean relaxation and the subgradient optimization techniques. A simple heuristic is developed based on these techniques. The simulation studies show that the proposed heuristic is relatively fast operating only in a subspace of the complete solution space.

Ključne riječi
LAN; tree topology; multiple broadcast protocol; concurrent transmissions; Lagrangean relaxation and subgradient heuristic

Hrčak ID: 150268

URI
https://hrcak.srce.hr/150268

Posjeta: 138 *