Outline of a TAC Conservation Approach Numbering JEM Teleconference, Nov. 3, 2010 1.

Slides:



Advertisements
Similar presentations
Part IV: Memory Management
Advertisements

Optimistic Methods for Concurrency Control By : H.T. Kung & John T. Robinson Presenters: Munawer Saeed.
Concurrency: Deadlock and Starvation Chapter 6. Deadlock Permanent blocking of a set of processes that either compete for system resources or communicate.
Understanding Operating Systems Fifth Edition
Submission doc.: IEEE /1357r3 Nov Slide 1 Dynamic TIM and Page Segmentation Date: Authors: Weiping Sun, Seoul National University.
CPSC 335 Dr. Marina Gavrilova Computer Science University of Calgary Canada.
Chapter 11 Indexing and Hashing (2) Yonsei University 2 nd Semester, 2013 Sanghyun Park.
©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree.
Prof. Necula CS 164 Lecture 141 Run-time Environments Lecture 8.
SalesPad SalesPad delivers an all-in-one order entry, inventory and sales management solution integrate seamlessly with Dynamics GP SalesPad simplifies.
File Management Chapter 12. File Management File management system is considered part of the operating system Input to applications is by means of a file.
File Management Chapter 12. File Management A file is a named entity used to save results from a program or provide data to a program. Access control.
CS 536 Spring Run-time organization Lecture 19.
Chapter 12 File Management
Optimized Data Migration within a System of Linked Medical Research Databases By Jared Christopherson U. of Connecticut.
B + -Trees (Part 1) COMP171. Slide 2 Main and secondary memories  Secondary storage device is much, much slower than the main RAM  Pages and blocks.
Run-time Environment and Program Organization
 The missing parts in the picture are the interactions between the PCS network and the PSTN.  This section briefly describes how mobile roaming is managed.
CPE 731 Advanced Computer Architecture Snooping Cache Multiprocessors Dr. Gheith Abandah Adapted from the slides of Prof. David Patterson, University of.
B + -Trees COMP171 Fall AVL Trees / Slide 2 Dictionary for Secondary storage * The AVL tree is an excellent dictionary structure when the entire.
03/17/2008CSCI 315 Operating Systems Design1 Virtual Memory Notice: The slides for this lecture have been largely based on those accompanying the textbook.
Implementation/Acceptance Testing / 1 Implementation and Acceptance Testing Physical Implementation Criteria: 1. Data availability 2. Data reliability.
Chapter 7 Indexing Objectives: To get familiar with: Indexing
Multiprocessor Cache Coherency
Memory Allocation CS Introduction to Operating Systems.
File System. NET+OS 6 File System Architecture Design Goals File System Layer Design Storage Services Layer Design RAM Services Layer Design Flash Services.
1.A file is organized logically as a sequence of records. 2. These records are mapped onto disk blocks. 3. Files are provided as a basic construct in operating.
PELICAN Keys to Quality – GSD Session 11 August 26th, 2008.
CHP - 9 File Structures. INTRODUCTION In some of the previous chapters, we have discussed representations of and operations on data structures. These.
File Management Chapter 12. File Management File management system is considered part of the operating system Input to applications is by means of a file.
Proposal for App Id and Service Provider Id registration Group Name: Shelby Kiewel Source: Shelby Kiewel, iconectiv / Ericsson,
The Treatment of “Spare / Sterilised” Capacity – follow up Draft for discussion purposes only.
Relational Database Concepts. Let’s start with a simple example of a database application Assume that you want to keep track of your clients’ names, addresses,
Database Requirements IMEI/MEID CEIR March 30/31 JEM Geneva.
Copyright © 2007, Oracle. All rights reserved. Managing Concurrent Requests.
Computer Security and Penetration Testing
Centro de Estudos e Sistemas Avançados do Recife PMBOK - Chapter 4 Project Integration Management.
Day Plan 9:00 – 10:30 AM Session I: Use Case normal flow for multimode device 10:30 – 10:45 Break 10: :15 AM Session II: Detailed requirements 12:15.
Lecture Set 14 B new Introduction to Databases - Database Processing: The Connected Model (Using DataReaders)
Secure Credential Manager Claes Nilsson - Sony Ericsson
CY2003 Computer Systems Lecture 09 Memory Management.
Chapter 2 Memory Management: Early Systems Understanding Operating Systems, Fourth Edition.
Outline of a TAC Conservation Approach TSG-S WG1 Tampa, FL, USA, Oct ,
Ch4. Multiprocessors & Thread-Level Parallelism 2. SMP (Symmetric shared-memory Multiprocessors) ECE468/562 Advanced Computer Architecture Prof. Honggang.
Outline of a TAC Conservation Approach TSG-S WG1 Tampa, FL, USA, Oct ,
1 File Management Chapter File Management n File management system consists of system utility programs that run as privileged applications n Concerned.
Submitting Course Outlines for C-ID Designation Training for Articulation Officers Summer 2012.
File Storage Organization The majority of space on a device is reserved for the storage of files. When files are created and modified physical blocks are.
Serverless Network File Systems Overview by Joseph Thompson.
Prepared By Prepared By : VINAY ALEXANDER ( विनय अलेक्सजेंड़र ) PGT(CS),KV JHAGRAKHAND.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 9 Virtual Trunking Protocol.
CE Operating Systems Lecture 17 File systems – interface and implementation.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Virtual Memory Hardware.
Restricted - Confidential Information © GSMA 2008 All GSMA meetings are conducted in full compliance with the GSMA’s anti-trust compliance policy What.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
FDMS modules and units FDMS has 22 unique modules Comprising 3 Maintenance units, 7 Commitment units, 4 Report units, 1 Project unit, 2 Funding units,
Homework Assignment #3 J. H. Wang Nov. 13, 2015.
11.1 Silberschatz, Galvin and Gagne ©2005 Operating System Principles 11.5 Free-Space Management Bit vector (n blocks) … 012n-1 bit[i] =  1  block[i]
State of Georgia Release Management Training
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Module D: Hashing.
CABLING SYSTEM WARRANTY REGISTRATION. PURPOSE OF CABLING REGISTRATION.
CS 241 Discussion Section (12/1/2011). Tradeoffs When do you: – Expand Increase total memory usage – Split Make smaller chunks (avoid internal fragmentation)
W4118 Operating Systems Instructor: Junfeng Yang.
Chapter 2 Memory and process management
Multiway Search Trees Data may not fit into main memory
Physical Database Design and Performance
HOPE STUDY PRODUCT TRAINING PHASE 2
CS Introduction to Operating Systems
Slides developed by Dr. Hesham El-Rewini Copyright Hesham El-Rewini
Presentation transcript:

Outline of a TAC Conservation Approach Numbering JEM Teleconference, Nov. 3,

Introduction Purpose of presentation – Address one possible approach in TAC conservation, – Referring to in the JEM London Sept meeting summary, Option 2 Recommendation – Include in the analysis of Options in efforts of industry consensus building and decision making regarding alleviation of TAC depletion 2

Synopsis TAC continues to exist conceptually – But no specific digits are used for TAC TRRTTTTTSSSSSS Current IMEI Structure Reporting Body ID TAC Serial Number MRRMMMMMST Proposed IMEI Structure Manufacturer Code TAC & Serial Number Reporting Body ID 3

Administration Administration procedures are very similar to existing ones – … but instead of TAC, administrator allocates M-blocks to manufacturers – Manufacturers can allocate serial number space in ST space to multiple “TACs” – Manufacturer can also allocate multiple M-blocks to same “TAC” Manufacturer informs Administrator of new “TAC” and serial number allocations by virtue of database updates – Database is managed by Administrator, and is accessible to operators and other authorized entities 4

Usage Database lookup is used to find out TAC – Entire IMEI is presented to the database – Database returns information such as manufacturer, "TAC", possibly even much more (e.g. date and place of manufacture) – Even in current usage, TAC digits are rarely entered manually, hence entering extra digits is not that burdensome Databases can be implemented first – Retain the current TAC allocation regime at first – Allow operators and others to switch to the new scheme in an un-synchronized fashion 5

Strawman Timeline Objective: Allow un-synchronized transition to new IMEI allocation process over a period of time 2010: JEM proposal finalized 2011: Industry consensus building 2012: Database structures and procedures developed 2013 onward: No TAC allocations made until manufacturer certifies it has databases implemented : Operator back-office transition to use new IMEI structure 2016: Allocation of M codes (new IMEI regime) begins 6

Implementation Considerations Proposed timeline would allow sufficient time to design and build database structure (by end of 2012) JEM could engage in developing requirements for such a structure, e.g.: – Minimum required contents – Access privilege management; Security requirements – Timeliness requirements – Details of access procedures for manufacturers and others – Capacity – Peak lookup rates – Caching capability – etc. Some implementation issues outlined on subsequent slides 7

Conclusion Proposal allows smooth migration from TAC with specific IMEI digits to TAC-like database Database management process can be largely automated with small estimated adjustment of manufacturers’ record keeping processes Proposal is a step toward alignment of GDA and GHA processes – M-block allocation is similar to current MEID allocation process – MEID capability could be aligned with the IMEI one (determination of UE type) by implementing similar database 8

Supplemental Slides Outline of Procedures and Operation 9

M-Block and “TAC” Requests M-Block Request/Assignment – Manufacturer requests a block of serial numbers from Administrator – Similar to current process with possible adjustments in application forms – Administrator grants appropriate number of M-blocks (see slide 4) “TAC” Request/Assignment – Can be very similar to current processes of TAC allocation – When new device type is planned, manufacturer notifies Administrator – Information supplied could be identical to current TAC request, e.g. band class(es), power, protocol support, … – Device type “Type_Alloc_Rec” is assigned similar to current TAC, but there is no association with IMEI digits nor restriction of format Format of “Type_Alloc_Rec” to be standardized - illustrative – Type Allocation Record: Type_Alloc_Rec = {,,, …} – is character string as recorded during M-Block request/assignment M-Block and Type_Alloc_Rec assignments are pillars of IMEI database 10

Database Structure Administrator maintains centralized database – When a new M-block or Type_Alloc_Rec is assigned, administrator records in database – Dynamic database with “staleness” period agreed by the industry: quarter, month, week, day, … Database record structure – List of assigned M-blocks – List of Type_Alloc_Rec, and status (active, discontinued) – Segment(s) of serial numbers assigned to produced devices, e.g.: Type_Alloc_RecXYZ: [p1.. q1, p2.. q2, …] … where p, q are beginning and end of an IMEI segment 11

Database Population Process Both Administrator and manufacturers responsible for populating database – M-Block Status (allocated/unallocated): Administrator – Type_Alloc_Rec Assignment: Administrator – Type_Alloc_Rec Segments Allocated: Manufacturer Security – Manufacturer receives proper security credentials at the time of M-block allocation allowing it to populate Type_Alloc_Rec segments in a given M-block – Manufacturer has no access privileges in other than its own M-blocks – Each accredited operator is given security credentials for database queries (one-time event per operator) 12

Queries Only accredited entities can query database – Primarily intended for operators to use – Database may be operationally cashed per agreed procedures and with required degree of security – Manufacturers can query its assigned M-blocks, but not others – Query input: Full IMEI – Query return: Type_Alloc_Rec contents for that IMEI Database technology discussion – Nature of database: a series of entries (X to Y) have same information (terminal type, etc.) – Database can be structured to avoid repetition: A series of segments assigned to Type_Alloc_Rec entries – Lookup consists of searching to determine to which segment an entry belongs Very simple algorithm conducive to efficient fast binary search 13

Process (1 of 2) Process outline is meant as an illustration – Other implementations feasible – Intent is to show it is conducive to automation IMEI storage in UE – IMEI programming procedure: Write to inalterable memory in UE – WORM - Write Once Read Mostly - technique akin to blowing fuses Manufacturing records keeping – Manufacturer must keep close track which IMEI serial numbers are assigned to devices, so that it is assigned only once – As each production run is planned, manufacturer can set aside a segment of serial numbers for each model it produces – Similar process must be in place now with traditional TAC – Difference: manufacturer can share an M-block among multiple UE types, can segment IMEIs of a UE type among multiple M-blocks or non-contiguously within an M-block 14

Process (2 of 2) IMEI database update – Manufacturer periodically updates central database – Update period may be with conventional staleness period (see slide 11), or may be more frequent Example (weekly database updates assumed) – Manufacturer has at its disposal A remaining IMEIs from M-block X, upon having discontinued production of a UE type previously using this M-block – For this week’s production, it is anticipated that A segment will be used up, plus segment B (not more than that, could be fewer) from block X+1 – Factory reserves segments A and B for assignment to this type of UE, showing “reserved” status in internal database – An IMEI is programmed sequentially into each UE, from segment A, then B – At final inspection, IMEI is read from each UE, and database status changed from “reserved” to “produced” (can be done by updating M-block record segments, i.e., no need to have a distinct entry for each UE) – There could be a separate list of IMEI of failed UEs (detail of little relevance) – At the end of the week, manufacturer updates central database by aligning records with its internal ones 15

Protection of Sensitive Data Problem: Manufacturer may require protection of competitive data such as production quantities of a device model – Security of central database information may not be trusted – Each manufacturer has own standards of sensitivity to disclosure Solution: Manufacturer can obfuscate data in the central database – Central database records show a superset of actually allocated IMEIs Looking up an IMEI actually allocated to a device yields correct “TAC” Looking up a hypothetical IMEI not yet allocated may yield incorrect “TAC” or “ghost TAC”, but this is not a concern – Since M-block allocation must have a margin ahead of production, there is always capacity to conceal current production information – As production runs become old news over time, database is updated by removing “misleading” records, thus not wasting IMEI space – Obfuscation regime/algorithm can be randomized, to further conceal sensitive information 16