Dive, Dave !

Keep Life Colorful.

Pages

  • Welcome
  • Coding Questions
  • Video Resources
  • My Posts
  • Shared From Others
  • Reload

Monday, August 24, 2015

LTE readings

From http://www.netmanias.com/en/

 

NETMANIAS TECHNICAL DOCUMENTS ON LTE


LTE IP Address Allocation Schemes II: A Case for Two Cities


LTE IP Address Allocation Schemes I: Basic


LTE Charging I: Offline


LTE Policy and Charging Control (PCC)


EMM Procedure 10 & 11. Move to Another City and Attach


EMM Procedure 8 & 9. Handover and Cell Reselection with TAU


EMM Procedure 7. Cell Reselection without TAU


EMM Procedure 6. Handover without TAU - Part 3. S1 Handover


EMM Procedure 6. Handover without TAU - Part 2. X2 Handover


EMM Procedure 6. Handover without TAU - Part 1. Overview of LTE Handover


EMM Procedure 5. Periodic TAU


EMM Procedure 4. Service Request


EMM Procedure 3. S1 Release


EMM Procedure 2. Detach


EMM Procedure 1. Initial Attach - Part 2. Call Flow of Initial Attach


EMM Procedure 1. Initial Attach - Part 1. Cases of Initial Attach


Eleven EMM Cases in an EMM Scenario


LTE EMM and ECM States


LTE QoS: SDF and EPS Bearer QoS


LTE Identification III: EPS Session/Bearer Identifiers


LTE Identification II: NE and Location Identifiers


LTE Identification I: UE and ME Identifiers


LTE Security II: NAS and AS Security


LTE Security I: Concept and Authentication


LTE Network Architecture: Basic

Posted by Unknown at 8/24/2015 12:38:00 AM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Visit Statstics

Visit Statstics
Visit Statstics

Search This Blog

Call me Dave.

  • Unknown
  • Unknown

Courses To Take

  • Data Science and Machine Learning Essentials
  • Implementing Real-Time Analytics with Hadoop in Azure HDInsight
  • Microsoft Virtual Academy

Keep Learning

  • [NTU] - Programming Learning

Interview Questions Solving

  • CPUs
  • 面试的各个方面都谈到了。
  • 各家常考题目
  • 面试十类常见数据结构
  • Leetcode题解。含收费题目
  • Leetcode题解。持续更新2
  • Leetcode题解。持续更新
  • Leetcode题解。水中的鱼
  • Leetcode题解。解说比较详细
  • Leetcode题解。九章的参考解答
  • Leetcode题解。图解
  • Leetcode题解。多解
  • Leetcode题解。C++ && Python
  • Leetcode题解。归类
  • Leetcode题解。分类总结
  • L & L in Java
  • 嵌入式方方面面
  • GSM, LTE, UMTS and IMS Call Flows
  • 微软面试187题精选
  • 《编程之法:面试和算法心得》
  • July 博客中的各个系列
  • MIT-All Open Courses
  • Post to another page.

Favorite Blogs

  • skyline09
    Linux System Programming 学习笔记(三) 标准缓冲I/O - skyline09 - 1.partial block operations are inefficient. The operating system has to “fix up” your I/O by ensuring that everything occurs on block-aligned boundari...
    11 years ago
  • TCP学习笔记
    TCP/IP详解学习笔记(5)-- ICMP:internet 控制报文协议 - newwy - 1.概述 ICMP是(Internet Control Message Protocol)Internet控制报文协议。它是TCP/IP协议族的一个子协议,用于在IP主机、路由器之间传递控制消息。控制消息是指网络通不通、主机是否可达、路由是否可用等网络本身的消息。这些控制消息虽然并不传输用户数据,但是对于用户数...
    11 years ago
  • 包子IT面试培训
    如何快速估计巨大 dataset 中unique 元素的数目 - 在大数据年代,很多简单的经典问题都会因为数据量巨大而变得十分具有挑战。绝大多数传统的精确算法将不再适用,因为对于TB量级的数据量,即使是O(N)的空间复杂度都会让内存不够使用;而当空间严重受限的情况下,传统算法的时间复杂度往往也会因此而暴涨。 Count Unique Items 比如一个简单问题:快速统...
    9 years ago
  • 各种总结
    LeetCode总结 -- 树的构造篇 - 这篇总结主要介绍树中比较常见的一类题型--树的构造。其实本质还是用递归的手法来实现,但是这类题目有一个特点,就是它是构建一棵树,而不是给定一棵树,然后进行遍历,所以实现起来思路上有点逆向,还是要练习一下。LeetCode中关于树的构造的题目有以下几道: Convert Sorted Array to Binary...
    10 years ago
  • 各种面试讨论
    2015届华为校园招聘机试题 - 第一题(60分): 按要求分解字符串,输入两个数M,N;M代表输入的M串字符串,N代表输出的每串字符串的位数,不够补0。例如:输入2,8, “abc” ,“123456789”,则输出为“abc00000”,“12345678“,”90000000” #include #include usin...
    10 years ago
  • 喜刷刷
    C++ Specific Questions - Overloading VS Overriding - Ref: http://stackoverflow.com/questions/429125/override-and-overload-in-c *Overloading* generally means that you have two or more functions in the same sco...
    10 years ago
  • 程序师
    Kubernetes 2.0 将会是什么样子 - HCL已经是Terraform的格式,所以至少我们只需要讨厌一种配置语言,而不是两种。它具有强类型和显式类型。已经有了良好的验证机制。它专门设计用于完成我们要求YAML完成的任务,而且阅读起来并不困难
    19 hours ago
  • 趣味思维 Matrix67
    趣题:正方形棋盘的双向分割 - 下面这个问题来自 2015 年俄罗斯数学竞赛。 一个正方形棋盘能沿着网格线分成 n 个大小形状相同的小块,每块都有 k 个小格。证明:这个正方形棋盘一定能沿着网格线分成 k 个大小形状相同的小块,每块都有 n 个小格。 假设正方形棋盘的边长为 s ,则 nk = s2,即 n/s = s/k。假设它们约分后都...
    3 weeks ago
  • 靖空间
    力扣困难题:接雨水的TwoPoint方法题解 - 解题思路 题目链接: https://leetcode-cn.com/problems/trapping-rain-water/ 属于困难类别的题目,只要理清思路就不难了。 成立条件: 两端必然形成一个大木桶 木板低的一端的雨水必然可以接上,因为另外一个终端有一条更高的木板 算法: 从木板低端开始计算,只要中...
    5 years ago

Labels

  • GG (1)
  • SharedFromOthers (3)

Blog Archive

  • ▼  2015 (144)
    • ►  09 (16)
    • ▼  08 (79)
      • 132 - Palindrome Partitioning II
      • 005 - Longest Palindromic Substring 的 DP 再分析
      • 131 - Palindrome Partitioning
      • 214 - Shortest Palindrome
      • 005 - Longest Palindromic Substring
      • 128 - Longest Consecutive Sequence
      • 072 - Edit Distance
      • 174 - Dungeon Game
      • 037 - Sudoku Solver
      • 268 - Missing Number
      • 130 - Surrounded Regions
      • 200 - Number of Islands
      • 218 - The Skyline Problem
      • LTE readings
      • 221 - Maximal Square
      • 133 - Clone Graph
      • 071 - Simplify Path
      • 150 - Evaluate Reverse Polish Notation
      • 093 - Restore IP Addresses
      • 264 - Ugly Number II
      • 263 - Ugly Number
      • 016 - 3Sum Closest
      • 015–3Sum
      • 258 - Add Digits
      • 257 - Binary Tree Paths
      • 215 - Kth Largest Element in an Array
      • 004 - Median of Two Sorted Arrays
      • 124 - Binary Tree Maximum Path Sum
      • 045 - Jump Game II
      • 164 - Maximum Gap
      • 055 - Jump Game
      • 134 - Gas Station
      • 023 - Merge k Sorted Lists
      • 031 - Next Permutation
      • Mark一下以后看
      • 047 - Permutations II
      • 060 - Permutation Sequence
      • Set static IP for VMwarePlayer
      • 201 - Bitwise AND of Numbers Range
      • 029 - Divide Two Integers
      • 085 - Maximal Rectangle 的DP解法
      • 085 - Maximal Rectangle
      • 084 - Largest Rectangle in Histogram
      • 041 - First Missing Positive
      • 052 - N-Queens II
      • N Queens 问题扩展 - 无穷皇后
      • 051 - N-Queens
      • 206 - Reverse Linked List
      • 092 - Reverse Linked List II
      • 061 - Rotate List
      • 034 - Search for a Range
      • 086 - Partition List
      • 114 - Flatten Binary Tree to Linked List
      • 042 - Trapping Rain Water
      • 011 - Container With Most Water
      • 025 - Reverse Nodes in k-Group
      • 199 - Binary Tree Right Side View
      • 116 - Populating Next Right Pointers in Each Node
      • 117 - Populating Next Right Pointers in Each Node II
      • 024 - Swap Nodes in Pairs
      • 213 - House Robber II
      • 198 - House Robber
      • 147 - Insertion Sort List
      • 082 - Remove Duplicates from Sorted List II
      • 069 - Sqrt(x)
      • 054 - Spiral Matrix
      • 059 - Spiral Matrix II
      • 216 - Combination Sum III
      • 040 - Combination Sum II
      • 022 - Generate Parentheses
      • 017 - Letter Combinations of a Phone Number
      • 039 - Combination Sum
      • 120 - Triangle
      • 050 - Pow(x, n)
      • 063 - Unique Paths II
      • 075 - Sort Colors
      • 242 - Valid Anagram
      • 按公司索面经
      • 076 - Minimum Window Substring
    • ►  07 (32)
    • ►  06 (2)
    • ►  05 (2)
    • ►  04 (6)
    • ►  03 (1)
    • ►  02 (3)
    • ►  01 (3)
  • ►  2014 (26)
    • ►  11 (2)
    • ►  10 (3)
    • ►  09 (2)
    • ►  08 (1)
    • ►  06 (3)
    • ►  05 (8)
    • ►  04 (7)

BU

  • Bmail
  • Bmobile
  • BU Brain
  • BU Dict
  • BlueBus
  • BMap
  • Group Study Room

CS.BU

  • All Courses
  • CS526
  • CS528
  • CS540
  • CS550
  • CS557.2013.fall
  • CS571.Liu
  • CS571.Yang
  • CS575

Scientific American Content: Global

Loading...
Travel theme. Powered by Blogger.