TLS WG Using SigComp in TLS? Carsten Bormann, 2002-11-20.

Slides:



Advertisements
Similar presentations
More Intel machine language and one more look at other architectures.
Advertisements

Robust Header Compression Mikael Degermark Co-chair, ROHC WG (to be) University of Arizona/ Ericsson Research.
Web security: SSL and TLS
ITIS 1210 Introduction to Web-Based Information Systems Chapter 36 How Music and Audio Work on the Internet.
IP Header compression in UMTS network Thesis Work Presentation Author: Jukka Raunio Supervisor: Prof. Raimo Kantola Instructor: M. Sc. Antti.
Chapter 5 standards for multimedia communications
1 Presence-specific dictionary for Sigcomp draft-garcia-simple-presence-dictionary-02.txt 68 th IETF Prague, Check Republic SIPPING WG 21/22-March-2007.
Chapter 6: Machine dependent Assembler Features
Signaling CompressionROHC WG chairs, Signaling Compression: Overview and Questions Carsten Bormann based on slides from: Hans.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #2 Header Compression.
1  1998 Morgan Kaufmann Publishers Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
Activities in the field of header compression. Center for TeleInFrastructure 2 ROHC working group RFC 3095 ROHC (Framework + RTP. UDP, ESP, uncompressed)
External Sorting R & G Chapter 13 One of the advantages of being
External Sorting R & G Chapter 11 One of the advantages of being disorderly is that one is constantly making exciting discoveries. A. A. Milne.
Internet Networking Spring 2004
1 Internet Networking Spring 2006 Tutorial 14 Header Compression.
1 An Extensible Videoconference Tool for a Collaborative Computing Network Junjun He.
A Simple Two-Pass Assembler
1 Extensions to CRTP RTP Multiplexing using Tunnels Bruce Thompson Tmima Koren Cisco Systems Inc.
Computer Networks: Multimedia Applications Ivan Marsic Rutgers University Chapter 3 – Multimedia & Real-time Applications.
Microprocessor-based systems Curse 7 Memory hierarchies.
1 Transport Layer Lecture 7 Imran Ahmed University of Management & Technology.
1 o characteristics – From an application-level API to the physical layer – CBR, VBR, ABR and UBR – Cell: bytes – Virtual circuits: virtual channel.
Karlstad University IP security Ge Zhang
1 Ericsson Overview of 0-byte ROHC and Voice over IP models.
Real-time Flow Management 2 BOF: Remote Packet Capture Extensions Jürgen Quittek NEC Europe Ltd, Heidelberg, Germany Georg Carle GMD.
© 2006 Open Mobile Alliance Ltd. All Rights Reserved. Used with the permission of the Open Mobile Alliance Ltd. under the terms as stated in this document.
LZRW3 Decompressor dual semester project Part A Mid Presentation Students: Peleg Rosen Tal Czeizler Advisors: Moshe Porian Netanel Yamin
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Performance of Signalling Compression in the Third Generation Mobile Network Jouni Mäenpää S
Queues, Pipes and Sockets. QUEUE A structure with a series of data elements with the first element waiting for an operation Used when an element is not.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt RTSP 2.0 TLS handling Magnus Westerlund draft-ietf-mmusic-rfc2326bis-12.
SIP working group IETF#70 Essential corrections Keith Drage.
Small constants are used quite frequently (50% of operands) e.g., A = A + 5; B = B + 1; C = C - 18; Solutions? Why not? put 'typical constants' in memory.
IP security Ge Zhang Packet-switched network is not Secure! The protocols were designed in the late 70s to early 80s –Very small network.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
1 Chapter Seven CACHE MEMORY AND VIRTUAL MEMORY. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4.
TURN Jonathan Rosenberg Cisco Systems. Changes since last version Moved to behave terminology Many things moved into STUN –Basic request/response formation.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
CS61C L20 Datapath © UC Regents 1 Microprocessor James Tan Adapted from D. Patterson’s CS61C Copyright 2000.
Fundamentals of Programming Languages-II
Diameter Overload DIME WG IETF 87 July, Starting Point DIAMETER_TOO_BUSY provides little guidance on what a Diameter client should do when it receives.
RObust Header Compression WG (ROHC) 66 th IETF Montreal, Canada, July 11, 2006 Meeting Chair: Carsten Bormann WG Chair: Lars-Erik Jonsson.
Building A Network: Cost Effective Resource Sharing
@Yuan Xue CS 285 Network Security Secure Socket Layer Yuan Xue Fall 2013.
Cryptography CSS 329 Lecture 13:SSL.
Instruction Set Architectures Continued. Expanding Opcodes & Instructions.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
CE 454 Computer Architecture
Machine dependent Assembler Features
The Goal: illusion of large, fast, cheap memory
IP Header compression in UMTS network
Direct Cache Structure
IETF#67 – 5-10 November 2006 FECFRAME requirements (draft-ietf-fecframe-req-01) Mark Watson.
Visit for more Learning Resources
IMTC SIP Interconnect and SuperOp
IMTC SIP Interconnect and SuperOp
Signaling Compression for Push-to-talk over Cellular (PoC)
R
Instruction Set.
Computer Architecture
SigComp: Signaling Compression
Network Core and QoS.
Instruction Set Architectures Continued
A Simple Two-Pass Assembler
Chapter 4 Network Layer Computer Networking: A Top Down Approach 5th edition. Jim Kurose, Keith Ross Addison-Wesley, April Network Layer.
Building A Network: Cost Effective Resource Sharing
Index construction: Compression of postings
Index construction: Compression of postings
Systems Architecture I (CS ) Lecture 5: MIPS Instruction Set*
Network Core and QoS.
Presentation transcript:

TLS WG Using SigComp in TLS? Carsten Bormann,

TLS WG SigComp — Signaling compression Problem: SIP signaling takes too long at cellular bandwidths (e.g., 8K at 1K/s = 8 s) –SIP is highly compressible though Problem: Compression heavily encumbered –inhibits standardizing one compression scheme Universal Decompressor Virtual Machine draft-ietf-rohc-sigcomp-07.txt –Approved by IESG for PS (in RFC ed queue)

TLS WG UDVM code example (LZSS) 0f8604a0 c48d00a0 c41e a0 ff8e048c bfff d0f e51d04 22e e fd bfc086 a08906 (from draft-price- rohc-sigcomp- user-guide-01.txt) 67 bytes 13 instructions set (udvm_memory_size, 8192) set (state_length, (udvm_memory_size - 64)) at (32) :index pad (2) set (index_lsb, (index + 1)) :length_value pad (2) :old_pointer pad (2) at (64) :byte_copy_left pad (2) :byte_copy_right pad (2) :input_bit_order pad (2) :decompressed_pointer pad (2) align (64) MULTILOAD (64, 4, circular_buffer, udvm_memory_size, 0, circular_buffer) :decompress_sigcomp_message :next_character INPUT-HUFFMAN (index, end_of_message, 2, 9, 0, 255, 16384, 4, 4096, 8191, 1) COMPARE ($index, 8192, length, end_of_message, literal) :literal OUTPUT (index_lsb, 1) COPY-LITERAL (index_lsb, 1, $decompressed_pointer) JUMP (next_character) :length INPUT-BITS (4, length_value, !) ADD ($length_value, 3) LOAD (old_pointer, $decompressed_pointer) COPY-OFFSET ($index, $length_value, $decompressed_pointer) OUTPUT ($old_pointer, $length_value) JUMP (next_character) :end_of_message END-MESSAGE (0, 0, state_length, 64, decompress_sigcomp_message, 6, 0) :circular_buffer

TLS WG The UDVM approach UDVM Code for a decompressor is small –50–500 B — smaller than a cert –Download it from compressor at start of session –No need to standardize compressors any more UDVM optimized for decompression –May slow down decompression by factor of 3 –Compression is much slower than that anyway

TLS WG SigComp and TLS SigComp runs fine above TLS (or TCP or UDP) –This is one way it is used in SIP Idea: Allow use of SigComp in TLS –Allows use of compression by existing apps –No need to register/standardize zillions of compressors –Instant interoperability of new compressors SigComp can use TLS for parameter negotiation

TLS WG SigComp and TLS: to do Define details of using SigComp in TLS: –Negotiation of SigComp parameters UDVM size, cycles per bit, … –Interaction of SigComp with Record Protocol UDVM startup, block vs. stream mode, … Bar BOF tbd (come to the front at the end)