Loading...

Selecting List Cost Route in SMS Networks

Ghanat Bari, Mehrab | 2011

358 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 41859 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Haji, Rasol
  7. Abstract:
  8. Introductions: The routing Problem in SMS networks, start from subscriber called origin and end to other subscriber called destination. SMSs passed throw the switches, relay and routers. When the traffic of a SMS network increase, a global optimization is required to reduce the charge that SMS center must be paid meanwhile maximize total flow and minimize delivery time.
    Methods: in this study after investigation in Short Message service, Routing Algorithms and letreture review, first we used our models for Telephone networks. The total model with Features and constrains was build. In order apply this model on Mobile networks, with using Latin Multy Plications Algorithms we develope a program to find all loopless paths in the network. Finally with using MI Xpress program we could find optimum paths which using them cause to maximize net margin in this network.
    Findings: it is necessary to remind that our goal was to optimize an existing SMS network, and we didn’t want to develop a new structure. Whit using this model, in 1 second period we could rout 1040 SMSs from 1180 SMSs which were demanded.
    Discussion: results shows that this model acts properly in increasing network’s net margin with regard routing maximum flow
  9. Keywords:
  10. Telecommunication ; Routing ; Optimization ; Feature Extraction ; Short Message Service (SMS)

 Digital Object List

 Bookmark

No TOC