LINK CAPACITY ALLOCATION AND NETWORK CONTROL BY FILTERED INPUT RATE IN HIGH-SPEED NETWORKS

Cited 55 time in webofscience Cited 0 time in scopus
  • Hit : 555
  • Download : 366
We study link capacity allocation for a finite buffer system to transmit multimedia traffic. The queueing process is simulated with real video traffic. Two key concepts are eplored in this study. First, the link capacity requirement at each node is essentially captured by its low-frequency input traffic (filtered at a properly selected cut-off frequency). Second, the low-frequency traffic stays intact as it travels through a finite-buffer system without significant loss. Hence, one may overlook the queueing process at each node for network-wide traffic flow in the low-frequency band. We propose a simple, effective method for link capacity allocation and network control using on-line observation of traffic flow in the low-frequency band. The study explores a new direction for measurement-based traffic control in high-speed networks.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1995-02
Language
ENG
Article Type
Article
Citation

IEEE/ACM TRANSACTIONS ON NETWORKING, v.3, no.1, pp.10 - 25

ISSN
1063-6692
URI
http://hdl.handle.net/10203/1361
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
Link Capacity Allocation and Network Control by Filtered Input Rate in High Speed Networks.pdf(1.61 MB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 55 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0