Resource Management
Bandwidth Allocation for Virtual Trees
We have proposed a new technique for bandwidth allocation in ATM
networks called Virtual Trees which is analogous to the concept of
Virtual Paths but has additional advantages.
Virtual Trees are source-rooted trees in ATM networks in which Virtual
Circuits originating at the source of the tree but going to different
destinations can share some of the bandwidth pre-allocated to the
Virtual Tree, thus providing an additional multiplexing advantage
over Virtual Paths. Our research has designed algorithms for
allocating the physical bandwidth of a network's links to construct
Virtual Tree configurations for specified traffic patterns. We
have designed a simulation model to study these algorithms and
compared them with Virtual Path configurations. The results of our
simulation study show that the use of Virtual Trees can provide
upto 40\% more bandwidth utilization than what is achieved with
Virtual Paths.
(Supported by the
Federated Research Laboratory (FRL) Consortium in
Advanced Telecommunications/Information Distribution Research Program
(ATIRP)
sponsored by the Army Research Laboratory
(ARL).
Related Publications
- A.S. Sethi, ``A model for Virtual Tree bandwidth allocation in ATM
networks'', Proc. Infocom '95, 14th Annual Joint Conference
of the IEEE Computer and Communications
Societies, Boston, Mass.
(April 1995), pp. 1222-1229.
PDF
- A.S. Sethi and Antonio Mock, ``Virtual Trees - A new technique
for bandwidth allocation in ATM networks''. Proc.
Second International Conference on Telecommunication
Systems Modelling and Analysis'', Nashville, TN
(March 1994), pp. 113-119.
- A. Mock, ``Virtual Trees - A new technique for bandwidth allocation
in ATM networks,'' M.S. Thesis, Dept. of Computer
and Information Sciences, University of Delaware, Newark, DE
(Dec. 1993).
Technical Reports
- A.S. Sethi and P. Ramarao, ``Bandwidth Allocation Algorithms
for Virtual Trees'',
Technical Report No. 97-09, Dept. of Computer
and Information Sciences, University of Delaware, Newark, DE
(December 1996).
Path Management for Battlefield Networks
Battlefield wireless networks can exploit the advantages of Virtual
Trees because of source concatenation
which has an effect very similar to that of Virtual Circuit
multiplexing in ATM networks. The MIL-STD-188-220A protocol uses
source concatenation at both the data link and physical layers.
For this reason, the Intranet Layer in this protocol can use
variations on our bandwidth allocation algorithms to set up
paths in the form of a Virtual Tree to various destinations
to take advantage of source concatenation. We have designed
simulation models using the OPNET network simulation package
to study the performance benefits of source concatenation at
the data link layer.
(Supported by the
Federated Research Laboratory (FRL) Consortium in
Advanced Telecommunications/Information Distribution Research Program
(ATIRP)
sponsored by the Army Research Laboratory
(ARL).
Related Publications
- A.S. Sethi and K. Sivakumar, ``A Performance Study of Source
Concatenation in MIL-STD 188-220B,'' Proc. Third ARL/ATIRP
Annual Conference, College Park, MD (Feb. 1999), pp. 57-62.
PDF
- C. Todd, A.S. Sethi and S. Chamberlain, ``Feedback of
Network Performance to Provide Better Utilization of
Communications Resources,'' Proc. Second ARL/ATIRP
Annual Conference, College Park, MD (Feb. 1998), pp. 311-315.
- A.S. Sethi and P. Ramarao, ``Virtual Tree Path Management
for Battlefield Networks,'' Proc.
MILCOM '97, IEEE Military Communications Conference,
Monterey, CA (Nov. 1997).
PDF
- A.S. Sethi and P. Ramarao, ``Virtual Tree Path Management
for Battlefield Networks,'' Proc. First ARL/ATIRP
Annual Conference, College Park, MD (Jan. 1997), pp. 257-263.
PDF.
Throughput Investigation of Delmarva's Gigabit Link
This project investigates what throughput gains are possible for
Delmarva's network over a gigabit fiber channel using alternatives to TCP
(Delmarva Power & Light is now called Conectiv).
The requirement to rapidly replicate multi-Gigabyte databases in
Delmarva's environment necessitates higher throughputs, thus
warranting an investigation of different approaches to traditional
file transfer over TCP.
The intent of this project is to
evaluate novel alternative approaches, including modified TCP
stacks and the Xpress Transfer Protocol (XTP), in an effort to
build a practical higher performance solution.
(Sponsored by Network Operations,
Conectiv Inc.).
Other Publications in Route Management
- S. Pithani and A.S. Sethi, ``A fuzzy set delay
representation for computer network routing algorithms''.
Proc. Second International Symposium on
Uncertainty Modeling and Analysis, College Park, MD
(April 1993), pp. 286-293.
PDF
- A.S. Sethi and B.B. Madan, ``Connection management in high-speed
networks''. Proc. First Indo-US Workshop on Computer Science,
Bangalore, India (Aug. 1992).
- S. Pithani, ``A routing algorithm for a wide area network using
fuzzy delay estimates,'' M.S. Thesis, Dept. of Computer
and Information Sciences, University of Delaware, Newark, DE
(May 1992).
- S. Ramanathan and A.S. Sethi, ``Load balancing
over multiple trunk lines''. Proc. ICCC-90, the 10th
International Conference on Computer Communication, New Delhi,
India (Nov. 1990), pp. 456-464.
(Also Tech. Rep. 90-09, CIS Dept., Univ. of Delaware.)
Back to Network Management Laboratory
Adarsh Sethi's Homepage