Advanced call scheduling for testing a telecommunications network

Voudouris, C; Azarmi, N; Jones, A

dc.contributor.author	Voudouris, C	en
dc.contributor.author	Azarmi, N	en
dc.contributor.author	Jones, A	en
dc.date.accessioned	2014-03-01T01:47:07Z
dc.date.available	2014-03-01T01:47:07Z
dc.date.issued	1998	en
dc.identifier.issn	13583948	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25147
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0032120789&partnerID=40&md5=0abebf9e7edace086d819bb58df6eacb	en
dc.subject.other	Algorithms	en
dc.subject.other	Congestion control (communication)	en
dc.subject.other	Constraint theory	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Optimization	en
dc.subject.other	Problem solving	en
dc.subject.other	Advanced call scheduling	en
dc.subject.other	Telecommunication networks	en
dc.title	Advanced call scheduling for testing a telecommunications network	en
heal.type	journalArticle	en
heal.publicationDate	1998	en
heal.abstract	This paper describes an advanced scheduling system and method for generating large volumes of calls to be used for testing a telecommunications network. The system is capable of preparing large-scale and complex network tests by viewing the task as a scheduling problem. The various requirements of the scheduling problem are analysed and represented as constraints or optimisation criteria. A fast heuristic method is proposed for solving the problem. The approach is based on a greedy algorithm for constructing solutions and it incorporates limited backtracking and dynamic value-ordering heuristics. The algorithm and system are currently being used for call charge verification in BT's PSTN and CSP networks.	en
heal.journalName	BT Technology Journal	en
dc.identifier.volume	16	en
dc.identifier.issue	3	en
dc.identifier.spage	30	en
dc.identifier.epage	37	en