Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010077499 | TK6570.M6 H46 2004 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
SMS (short message service) and MMS (multimedia message service) are two of the hottest services in wireless communications today, offering customers exciting ways to communicate by sending text and multimedia messages. This comprehensive book offers wireless engineers and managers practical guidance in the planning and implementation of SMS and MMS services with interworking (the ability to successfully send a message when the origin and destination cellular phones do not use the same wireless operator). The book offers professionals various solutions to the common problem of number portability (a situation when a cellular phone has been portedout to another operator while keeping the same number) and provides methods for blocking spam from inbound SMS. Including numerous solved examples, this authoritative reference helps practitioners master of the key concepts they need to understand for their work in the field.
Author Notes
Arnaud Henry-Labordere is a professor of operations research at Ecole Nationale des Ponts et Chaussees, Paris.
Table of Contents
Introduction | p. xiii |
Chapter 1 Standard Procedures for SMS in GSM Networks | p. 1 |
1.1 GSM Network Architecture and Principle of the SMS Procedure | p. 1 |
1.2 Implementation of SMS Services | p. 3 |
1.2.1 SMS-MO Implementation | p. 3 |
1.2.2 The SMS-MT Implementation | p. 6 |
1.2.3 Sending Commands to the SMSC | p. 14 |
1.2.4 Addressing the Foreign Network HLRs for SMS-MT | p. 15 |
1.2.5 Summary of the Network Equipment Model for SMS | p. 16 |
1.3 MAP Dialogue Models at the Application Level | p. 16 |
1.3.1 Request and CNF (Simple) Dialogue | p. 17 |
1.3.2 Concatenated SMS Dialogue: More Message to Send | p. 17 |
1.3.3 Update Location Dialogue | p. 17 |
1.3.4 Send Routing Information for SM Dialogue | p. 18 |
1.4 SCCP Addresses: The Tool for Flexible International Roaming | p. 18 |
1.5 Mobility Procedures | p. 19 |
1.5.1 Update Location Procedure | p. 20 |
1.5.2 Making a Telephone Call to a Mobile | p. 22 |
1.6 GPRS Procedures: The Gc Interface | p. 23 |
1.7 SMS Billing Records and Methods | p. 23 |
1.7.1 SMS-MO CDRs | p. 25 |
1.7.2 SMS-MT CDRs | p. 26 |
1.8 Load Test of an SMSC | p. 26 |
1.8.1 SMS-MT Test Configuration | p. 26 |
1.8.2 Results and Performance Model | p. 26 |
Chapter 2 SS7 Network and Protocol Layers | p. 29 |
2.1 History | p. 29 |
2.2 Efficient and Secure Worldwide Telecommunications | p. 29 |
2.3 MTP Protocol (OSI Layers 1-3) | p. 30 |
2.3.1 MTP Layer 1: Signaling Data Link Level | p. 31 |
2.3.2 MTP Layer 2: Signaling Link Functions | p. 31 |
2.3.3 MTP Layer 3: Signaling Network Functions | p. 34 |
2.4 Signaling Connection Control Part | p. 37 |
2.4.1 SCCP Message Format | p. 38 |
2.4.2 SCCP Layer Architecture | p. 38 |
2.4.3 SCCP Routing | p. 39 |
2.5 Transaction Capability Application Part (TCAP) | p. 42 |
2.5.1 Main Features of TCAP | p. 43 |
2.5.2 TCAP Architecture | p. 43 |
2.5.3 TCAP Operation Invocation Example | p. 44 |
2.6 User-Level Application Parts: MAP, INAP, CAMEL | p. 45 |
2.6.1 User Part Mapping onto TCAP: MAP Example | p. 45 |
2.6.2 Routing Design | p. 48 |
2.6.3 Service-Oriented Design: Application to an SS7-Based Fault-Tolerant System | p. 50 |
2.7 SS7 and VoIP Interworking Overview SIGTRAN | p. 51 |
2.7.1 SCTP | p. 51 |
2.7.2 Interworking with SS7 | p. 52 |
2.7.3 M3UA Layer | p. 52 |
2.7.4 M2UA Layer | p. 52 |
2.7.5 SUA Layer | p. 52 |
2.7.6 TUA Layer | p. 52 |
2.8 Conclusions | p. 52 |
2.8.1 Powerful, Efficient Network Architecture | p. 52 |
2.8.2 Application to a Worldwide SMS Service Network | p. 53 |
Chapter 3 Standard Procedures for SMS in IS-41 Networks | p. 57 |
3.1 Introduction | p. 57 |
3.1.1 IS-41 Networks | p. 57 |
3.1.2 Inefficient Handover Chain Procedure | p. 57 |
3.1.3 MIN and IMSI for IS-41 Networks | p. 59 |
3.2 Implementation of SMS Services | p. 61 |
3.2.1 SMS-MO Implementation | p. 61 |
3.2.2 SMS-MT Implementation | p. 63 |
3.3 IS-41 Procedure for SMS | p. 63 |
3.3.1 Functional Description of IS-41 SMS Services | p. 64 |
3.3.2 IS-41 SMS Protocol Description | p. 68 |
3.3.3 Specification of the SMS Interworking Network IS-41 SMS Router | p. 70 |
3.4 Interworking Between IS-41 and GSM | p. 75 |
3.4.1 GSM Specifications of User Information | p. 75 |
3.4.2 Mapping GSM to IS-637 | p. 76 |
3.4.3 Mapping GSM to IS-136-710 | p. 78 |
3.4.4 SMS Delivery from IS-41 SME to MAP SME | p. 78 |
3.4.5 SMS Delivery from MAP SME to IS-41 SME | p. 82 |
3.4.6 IS-41 Numbering for SMS Delivery | p. 83 |
3.5 Addressing HLRs in TDMA and CDMA Networks for SMS Interworking: Updating Point Code-Based Addressing Information | p. 83 |
Chapter 4 Implementation of Mobile Number Portability and GSM-to-IS-41 Conversion | p. 85 |
4.1 Business Model | p. 85 |
4.2 Basics of Roaming Agreement Implementation | p. 85 |
4.3 Implementations of Number Portability | p. 86 |
4.3.1 MNP Handled by Each Individual Operator (Level N) | p. 87 |
4.3.2 MNP Handled by the Entry International SCCP Gateway (Level N - 1) | p. 90 |
4.3.3 Unregulated Countries' MNP Process Must Be Handled by the SMS Interworking Network | p. 91 |
4.4 SMS Routing Strategies for an SMS Interworking Operator to a Regulated MNP Country | p. 91 |
4.5 MNP for SMS in Countries That Have Both GSM and IS-41 Operators | p. 92 |
4.5.1 SMS-MT GSM to an IS-41 Destination | p. 92 |
4.5.2 SMS-MT from an IS-41 Network to a GSM Destination | p. 95 |
4.6 Identification of the Destination Network | p. 96 |
4.6.1 MMS Interconnection | p. 96 |
4.6.2 Fixed-Line SMS Interconnection | p. 96 |
4.6.3 MMS and Fixed-Line SMS Interconnection Business | p. 97 |
Chapter 5 Barring Inbound SMS-MT | p. 101 |
5.1 Barring Inbound SMS-MT: An Important Business Issue | p. 101 |
5.1.1 Filtering Service Offered by IGPs at the SCCP Level | p. 101 |
5.1.2 Selective E164 Translation Facility Barring of the SMS-MT at the GMSCs SCCP Level | p. 102 |
5.1.3 HLR Barring | p. 103 |
5.1.4 Origin Address Type Barring at the MSC Level | p. 103 |
5.1.5 MAP Barring by the GMSC | p. 103 |
5.2 Barring or Restricting the SMS-MO of One's Own Subscribers | p. 104 |
5.3 Intelligent Barring of SMS-MT | p. 104 |
5.3.1 Origin Address-Based Barring | p. 104 |
5.3.2 Filtering Based on Content of Incoming SMS-MT | p. 105 |
Chapter 6 Virtual SMSC Implementation and Transit Agreements | p. 109 |
6.1 Business Model | p. 109 |
6.2 Principle of the Virtual SMSC: Architecture and Billing of SMS-MO | p. 109 |
6.2.1 Architecture | p. 109 |
6.2.2 Payment Issues | p. 110 |
6.2.3 Billing Coherence: Dynamic Originating SMSC GT | p. 111 |
6.2.4 Use of a Local Virtual SMSC GT in the SIM Card | p. 111 |
6.3 Detailed Implementation of the Virtual SMSC | p. 112 |
6.3.1 Half-SCCP Roaming for SMS-MO | p. 112 |
6.3.2 Failure of Half-SCCP Roaming for SMS-MO | p. 113 |
6.3.3 Solving This Failure Case | p. 113 |
6.4 Implementation of Transit Agreements (SMS-MT) | p. 114 |
6.4.1 Cases When a Virtual SMSC Has All Roaming Agreements of the Operator | p. 114 |
6.4.2 Optimization of the Implementation of a Transit Agreement | p. 118 |
6.4.3 Use of an International Point Code: The Solution in Difficult Setup Cases | p. 118 |
6.5 Super-Routing Gateway and Multiple Virtual SMSCs in the Same Equipment | p. 120 |
Chapter 7 Connecting Mobile Operators for SMS-MO | p. 123 |
7.1 Business Need for an SMS Interworking Operator to Connect Multiple Mobile Operators | p. 123 |
7.2 Principle of the Virtual HLR/MSC Approach | p. 123 |
7.2.1 Relay Mode | p. 123 |
7.2.2 Transparent Mode | p. 125 |
7.2.3 Direct Interrogation of the HLR by the Client Operator | p. 126 |
7.2.4 SMS Interworking Network and the Status Report | p. 127 |
7.3 Configuration the SMSC or GMSC to Route to the Third Party | p. 127 |
7.3.1 GT Address Translation in the GMSC | p. 127 |
7.3.2 Doing the Address Translation in the SMSC | p. 130 |
7.3.3 Use of a Private Conversion Unit | p. 131 |
7.3.4 Intelligent SCCP Routing by Your IGP | p. 133 |
7.4 Creating Third-Party SCCP Routing When a GT Translation Is Unavailable | p. 134 |
7.4.1 Case in Which Connected Operator Acts as Its Own SCCP Gateway | p. 134 |
7.4.2 Case in Which Connected Operator Uses an International SCCP Gateway Service: No Solution | p. 135 |
7.4.3 Case in Which GT Translation Is Not Possible and the Operator Is Not Its Own SCCP Provider: Use a Conversion Unit | p. 135 |
7.4.4 Transmission of Signaling Between a GSM and an IS-41 Network | p. 136 |
7.5 Conclusion | p. 136 |
Chapter 8 Connecting ASPs and ISPs with SMPP | p. 137 |
8.1 Introduction | p. 137 |
8.2 SMPP Sessions | p. 137 |
8.3 SMPP Commands | p. 138 |
8.4 Example of SMPP Sessions | p. 138 |
8.5 Example of Message Operations | p. 138 |
8.5.1 Session Management: Transceiver PDUs | p. 138 |
8.5.2 Message Submission Operation | p. 139 |
8.5.3 Other SMPP Operations | p. 143 |
8.6 GSM IS-41 Interworking Through SMPP | p. 143 |
Chapter 9 MMS Interworking | p. 145 |
9.1 Introduction | p. 145 |
9.2 Standard Model for MMS Sending and Receiving | p. 145 |
9.2.1 MMS Relay/Server | p. 145 |
9.2.2 MMS User Databases | p. 145 |
9.2.3 MMS User Agent | p. 146 |
9.2.4 MMS VAS Applications | p. 146 |
9.3 Standard Protocols for MMS | p. 147 |
9.3.1 MM1 Protocol over WAP | p. 147 |
9.3.2 MM1 over M-IMAP | p. 149 |
9.3.3 MM4 Protocol | p. 150 |
9.3.4 MM7 Protocol | p. 151 |
9.4 MMS Interworking Architectures Using a Third Party | p. 151 |
9.5 Setting Up the MMS Profile in the Cell Phone | p. 156 |
9.5.1 Data Access Profile | p. 157 |
9.5.2 MMSC Profile | p. 159 |
Chapter 10 Optimal Routing Algorithms for an SMS Interworking Network | p. 161 |
10.1 Maximizing the Margin of an SMS Interworking Network | p. 161 |
10.2 Enumerating All Loopless Paths with the Latin Multiplication Algorithms | p. 161 |
10.3 Shortest Path: Djsktra Algorithm | p. 165 |
10.4 Least Cost Path | p. 165 |
10.5 Least Trouble Path | p. 165 |
10.6 The Best Flow Problem--Not a Classical Graph Problem | p. 165 |
10.6.1 Income Model for Customer Charges and Notations | p. 166 |
10.6.2 Noncontinuous Price Function Paid to the Interworking Network for an Unsatisfied Demand | p. 166 |
10.6.3 Continuous Concave Price Function | p. 167 |
10.6.4 Network Model | p. 167 |
10.6.5 Mathematical Model for Optimization | p. 168 |
10.6.6 Algorithm to Find the Global Optimum | p. 171 |
10.6.7 Centralized Network Traffic Regulation Principle | p. 171 |
10.7 Example: Detailed Modeling of a Real SMS Interworking Network | p. 172 |
10.7.1 Modeling a Simple SS7 Router or a Relay | p. 172 |
10.7.2 Modeling Traffic to Subscribers of a Network Hosting an SS7 Router | p. 173 |
10.7.3 Modeling a Virtual SS7 Router with Several IGPs and Transit Agreements | p. 173 |
10.7.4 Connection of Hosting Partners | p. 176 |
10.7.5 Path Valuations | p. 176 |
Chapter 11 INAP and CAMEL Overview and Other Solutions for Prepaid SMS | p. 177 |
11.1 Use of CAMEL for SMS Prepaid Services | p. 178 |
11.1.1 SMS Payment from Prepaid Customers | p. 178 |
11.1.2 Credit Reloading for Prepaid Customers | p. 179 |
11.2 Useful Subset of CAMEL Services for Prepaid Customers | p. 179 |
11.2.1 Example 1: Prepaid SMS | p. 179 |
11.2.2 Example 2: Simple Prepaid Voice Call | p. 179 |
11.2.3 Example 3: Voice Call Rerouted to an Announcement Machine | p. 181 |
11.2.4 Details of Applicable CAMEL Services | p. 182 |
11.2.5 Specificity of the CAMEL Services | p. 183 |
11.3 Implementation: Multiple-Protocol Services-Oriented Platform: CAMEL Gateways | p. 184 |
11.4 Example of Analyzer Traces of a CAMEL Transaction | p. 185 |
11.5 Other Solutions for Prepaid SMS | p. 187 |
11.5.1 Prepaid SMS with Service Nodes | p. 187 |
11.5.2 Prepaid SMS with AoC-Enabled Networks | p. 188 |
Chapter 12 USSD: A Still-Relevant Conversational Application Service | p. 191 |
12.1 USSD Advantages over SMS | p. 191 |
12.2 How Does Mobile-Initiated USSD Service Work? | p. 191 |
12.3 Example of USSD Service | p. 194 |
12.4 USSD Is Free: A Call-Back Application | p. 195 |
Chapter 13 Location-Based Services | p. 197 |
13.1 Location-Based Services: Examples and Revenue Possibilities | p. 197 |
13.2 Mobile-Originated LBS | p. 197 |
13.3 Methods | p. 198 |
13.3.1 MSC Location Method | p. 198 |
13.3.2 Cell ID Method | p. 198 |
13.3.3 Extended Cell ID Method | p. 200 |
13.3.4 Mobile Location Units and BSSAP-LE | p. 200 |
13.4 Other Methods: Mobile Measured Power Level | p. 201 |
13.5 3G UMTS Networks | p. 202 |
13.6 Best Estimate of a Location Using Hyperbolic n-Triangulation | p. 203 |
13.6.1 Algebraic Equation of a Hyperbola | p. 203 |
13.6.2 Finding the Best Localization Estimate | p. 204 |
13.6.3 Exact Solution (True Optimum) | p. 205 |
13.7 Main Results in the Theory of Resultants and Sturm's Theorem | p. 206 |
13.7.1 Purpose of the Theory of Resultants | p. 206 |
13.7.2 Main Result for Two Algebraic Equations | p. 206 |
13.7.3 Sturm's Theorem | p. 208 |
13.7.4 Bounds on the Value of Roots | p. 210 |
13.7.5 Application: Recursive Algorithm to Find All the Real Roots | p. 211 |
Chapter 14 SMS-MO Premium Number Services and Architectures | p. 215 |
14.1 The Premium SMS-MO Number Business | p. 215 |
14.1.1 Use of a GSM Modem: Small Throughput | p. 215 |
14.1.2 Use of a Direct IP Connection to an SMSC: Negotiation and Setup Tasks | p. 216 |
14.2 Virtual Roaming Subscriber Architecture | p. 216 |
14.2.1 Case 1: Omnitel and Third-Party Operator | p. 216 |
14.2.2 Case 2: Mobile Operator Has a Virtual MSC | p. 217 |
14.3 SMS-MO with a Real SIM Card | p. 218 |
14.4 Short Code: A Costly and Time-Consuming Setup | p. 218 |
14.5 FSG Architecture | p. 219 |
Chapter 15 Numbering Plan Creation and Maintenance Algorithms | p. 221 |
15.1 Purpose of Computing Numbering Plans for an SMS Interworking Network | p. 221 |
15.2 Entropy of a Numbering Plan as a Quality Indicator | p. 222 |
15.2.1 Avoiding the Multiple Spanning of HLRs | p. 222 |
15.2.2 Average Entropy of the Numbering Plan | p. 222 |
15.2.3 Resulting Global Entropy | p. 223 |
15.3 "Little Prince" Algorithm to Compute an HLR Numbering Plan | p. 223 |
15.3.1 Numbering Plan After One Try | p. 224 |
15.3.2 Numbering Plan After Two Tries | p. 224 |
15.3.3 Numbering Plan After Three Tries | p. 224 |
15.4 MSC Search Problem | p. 224 |
15.4.1 Problem 1 | p. 225 |
15.4.2 Problem 2 | p. 225 |
15.5 Definitions and Properties | p. 225 |
15.6 Problem 1: Average Number of Searches for a Known N | p. 228 |
15.6.1 Case N = 2 MSCs | p. 228 |
15.6.2 Case N = 3 MSCs | p. 229 |
15.6.3 Asymptotic Bound of M[subscript N] | p. 230 |
15.7 Problem 2: Estimate of the Probability That the Number of MSCs N = j | p. 231 |
Chapter 16 Worked-Out Examples | p. 233 |
16.1 Example 1 | p. 233 |
16.2 Example 2 | p. 250 |
16.3 Example 3 | p. 268 |
16.4 Example 4 | p. 268 |
16.5 Example 5 | p. 269 |
16.6 Example 6 | p. 270 |
16.7 Example 7: Connection of a GSM to a Third-Party SMS Network | p. 280 |
16.8 Example 8: SMS Interworking Between CDMA Networks | p. 294 |
Abbreviations and Acronyms | p. 301 |
About the Authors | p. 319 |
Index | p. 321 |