NDLI: On state aggregation for scalable QoS routing

Content Provider	IEEE Xplore Digital Library
Author	Guo, L. Matta, I.
Copyright Year	1998
Description	Author affiliation: Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA (Guo, L.)
Abstract	State (topology) aggregation is the notion of reducing nodal as well as link information to achieve scaling in a large network. In this paper, we compare the performance of three different aggregation schemes, namely, the simple-node scheme, the full-mesh scheme, and the star scheme, which represent a given group of nodes by a single logical node, a complete graph between border nodes, and a star-like graph connecting all of the border nodes, respectively. We obtain transient performance measures for multi-service networks using our Z-iteration method. We restrict the set of candidate paths to short length paths as this has been shown to be an effective way to enhance network performance. Our simulation results indicate that under a uniformly distributed workload, the scheme that has more detailed topology information performs much better, as common sense suggests. More interestingly, however, we found that as the workload becomes skewed, i.e., as it concentrates around few "hot-spot" nodes, the simple-node scheme, which is considered to be the most inaccurate aggregation scheme, appears to perform at least as well as the full-mesh scheme, which on the contrary provides the most detailed information. We attribute this result to the conflicting goals of network utilization efficiency and network load balancing, a conflict that arises when restricting the set of candidate paths.
Starting Page	306
Ending Page	314
File Size	795551
Page Count	9
File Format	PDF
ISBN	0780348745
ISSN	10987789
DOI	10.1109/ATM.1998.675190
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-05-26
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Quality of service Joining processes Educational institutions Computer science Network topology Load management Telecommunication traffic Engineering profession Computer networks
Content Type	Text
Resource Type	Article
Subject	Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Should QoS routing algorithms prefer shortest paths?

On scalable QoS routing: performance evaluation of topology aggregation

Stochastic Partitioning Strategies for Providing Scalable of Quality of Service Routing in Large Networks

Load Distribution for Telecommunications Networks Using Revenue Management

Generalized DCell Structure for Load-Balanced Data Center Networks

State aggregation using network flows for stochastic networks

Partial optimization method of topology aggregation for hierarchical QoS routing

A scalable and efficient inter-domain QoS routing architecture for DiffServ networks

QoS routing in self-organized network

On state aggregation for scalable QoS routing

Similar Documents

Should QoS routing algorithms prefer shortest paths?

On scalable QoS routing: performance evaluation of topology aggregation

Stochastic Partitioning Strategies for Providing Scalable of Quality of Service Routing in Large Networks

Load Distribution for Telecommunications Networks Using Revenue Management

Generalized DCell Structure for Load-Balanced Data Center Networks

State aggregation using network flows for stochastic networks

Partial optimization method of topology aggregation for hierarchical QoS routing

A scalable and efficient inter-domain QoS routing architecture for DiffServ networks

QoS routing in self-organized network

On state aggregation for scalable QoS routing