Dynamic capacity allocation and optimal rearrangement for reconfigurable networks

Alan Herschtal; Meir Herzberg

Dynamic capacity allocation and optimal rearrangement for reconfigurable networks

Alan Herschtal, Meir Herzberg

Telstra

Research output: Contribution to conference › Paper › peer-review

8 Scopus citations

Abstract

This paper presents some suitable techniques for assigning and managing bandwidth demands on a logically meshed network so as to enhance the network's traffic carrying ability. The techniques are used to: (a) generate eligible paths for capacity allocation, (b) allocate capacity and (c) reconfigure the logical network. They were tested through simulation studies on a sample network. Selected numerical results are presented.

Original language	English
Pages	946-951
Number of pages	6
State	Published - 1995
Externally published	Yes
Event	Proceedings of the 1995 IEEE Global Telecommunications Conference. Part 2 (of 3) - Singapore, Singapore Duration: 14 Nov 1995 → 16 Nov 1995

Conference

Conference	Proceedings of the 1995 IEEE Global Telecommunications Conference. Part 2 (of 3)
City	Singapore, Singapore
Period	14/11/95 → 16/11/95

Cite this

@conference{5af88fed01844917ad693c1a43e19e45,

title = "Dynamic capacity allocation and optimal rearrangement for reconfigurable networks",

abstract = "This paper presents some suitable techniques for assigning and managing bandwidth demands on a logically meshed network so as to enhance the network's traffic carrying ability. The techniques are used to: (a) generate eligible paths for capacity allocation, (b) allocate capacity and (c) reconfigure the logical network. They were tested through simulation studies on a sample network. Selected numerical results are presented.",

author = "Alan Herschtal and Meir Herzberg",

year = "1995",

language = "אנגלית",

pages = "946--951",

note = "Proceedings of the 1995 IEEE Global Telecommunications Conference. Part 2 (of 3) ; Conference date: 14-11-1995 Through 16-11-1995",

}

TY - CONF

T1 - Dynamic capacity allocation and optimal rearrangement for reconfigurable networks

AU - Herschtal, Alan

AU - Herzberg, Meir

PY - 1995

Y1 - 1995

N2 - This paper presents some suitable techniques for assigning and managing bandwidth demands on a logically meshed network so as to enhance the network's traffic carrying ability. The techniques are used to: (a) generate eligible paths for capacity allocation, (b) allocate capacity and (c) reconfigure the logical network. They were tested through simulation studies on a sample network. Selected numerical results are presented.

AB - This paper presents some suitable techniques for assigning and managing bandwidth demands on a logically meshed network so as to enhance the network's traffic carrying ability. The techniques are used to: (a) generate eligible paths for capacity allocation, (b) allocate capacity and (c) reconfigure the logical network. They were tested through simulation studies on a sample network. Selected numerical results are presented.

UR - https://www.scopus.com/pages/publications/0029517883

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0029517883

SP - 946

EP - 951

T2 - Proceedings of the 1995 IEEE Global Telecommunications Conference. Part 2 (of 3)

Y2 - 14 November 1995 through 16 November 1995

ER -

Dynamic capacity allocation and optimal rearrangement for reconfigurable networks

Abstract

Conference

Other files and links

Fingerprint

Cite this