File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems

TitleEfficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
Authors
KeywordsHeuristic
Scheduling algorithm
TDM switching system
Time slot assignment
Issue Date2001
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26
Citation
Ieee Transactions On Communications, 2001, v. 49 n. 2, p. 351-359 How to Cite?
AbstractTwo efficient time slot assignment algorithms, called the two-phase algorithm for the nonhierarchical and the three-phase algorithm for the hierarchical time-division multiplex (TDM) switching systems, are proposed. The simple idea behind these two algorithms is to schedule the traffic on the critical lines/trunks of a traffic matrix first. The time complexities of these two algorithms are found to be O(LN2) and O(LM2), where L is the frame length, N is the switch size, and M is the number of input/output users connected to a hierarchical TDM switch. Unlike conventional algorithms, they are fast, iterative and simple for hardware implementation. Since no backtracking is used, pipelined packet transmission and packet scheduling can be performed for reducing the scheduling complexity of a transmission matrix to O(N2) and O(M2), respectively. Extensive simulations reveal that the two proposed algorithms give close-to-optimal performance under various traffic conditions.
Persistent Identifierhttp://hdl.handle.net/10722/42885
ISSN
2015 Impact Factor: 2.298
2015 SCImago Journal Rankings: 1.659
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-03-23T04:34:02Z-
dc.date.available2007-03-23T04:34:02Z-
dc.date.issued2001en_HK
dc.identifier.citationIeee Transactions On Communications, 2001, v. 49 n. 2, p. 351-359en_HK
dc.identifier.issn0090-6778en_HK
dc.identifier.urihttp://hdl.handle.net/10722/42885-
dc.description.abstractTwo efficient time slot assignment algorithms, called the two-phase algorithm for the nonhierarchical and the three-phase algorithm for the hierarchical time-division multiplex (TDM) switching systems, are proposed. The simple idea behind these two algorithms is to schedule the traffic on the critical lines/trunks of a traffic matrix first. The time complexities of these two algorithms are found to be O(LN2) and O(LM2), where L is the frame length, N is the switch size, and M is the number of input/output users connected to a hierarchical TDM switch. Unlike conventional algorithms, they are fast, iterative and simple for hardware implementation. Since no backtracking is used, pipelined packet transmission and packet scheduling can be performed for reducing the scheduling complexity of a transmission matrix to O(N2) and O(M2), respectively. Extensive simulations reveal that the two proposed algorithms give close-to-optimal performance under various traffic conditions.en_HK
dc.format.extent182724 bytes-
dc.format.extent25600 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=26en_HK
dc.relation.ispartofIEEE Transactions on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectHeuristicen_HK
dc.subjectScheduling algorithmen_HK
dc.subjectTDM switching systemen_HK
dc.subjectTime slot assignmenten_HK
dc.titleEfficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systemsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0090-6778&volume=49&issue=2&spage=351&epage=359&date=2001&atitle=Efficient+time+slot+assignment+algorithms+for+TDM+hierarchical+and+nonhierarchical+switching+systemsen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/26.905898en_HK
dc.identifier.scopuseid_2-s2.0-0035248103en_HK
dc.identifier.hkuros61698-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035248103&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume49en_HK
dc.identifier.issue2en_HK
dc.identifier.spage351en_HK
dc.identifier.epage359en_HK
dc.identifier.isiWOS:000167225900018-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats