ENUM Implementation Issues Lawrence Conroy

Slides:



Advertisements
Similar presentations
IETF 71 Philadelphia - ENUM IANA Registration of Enumservices: Guide, Template and IANA Considerations draft-ietf-enum-enumservices-guide-08 B. Hoeneisen.
Advertisements

Analysis by design Statistics is involved in the analysis of data generated from an experiment. It is essential to spend time and effort in advance to.
compilers and interpreters
Carrier/Infrastructure ENUM Requirements draft-lind-infrastructure-enum-reqs-01.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
1 Internet Networking Spring 2005 Tutorial 2 IP Checksum, Fragmentation.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
1 Internet Networking Spring 2004 Tutorial 2 IP Checksum, Fragmentation.
Internet Networking Spring 2003
Chapter 7 Queues. © 2005 Pearson Addison-Wesley. All rights reserved7-2 The Abstract Data Type Queue A queue –New items enter at the back, or rear, of.
1 Internet Networking Spring 2002 Tutorial 2 IP Checksum, Fragmentation.
A question of protocol Geoff Huston APNIC 36. Originally there was RFC791: “All hosts must be prepared to accept datagrams of up to 576 octets (whether.
1 SIP WG meeting 73rd IETF - Minneapolis, MN, USA November, 2008 Return Routability Check draft-kuthan-sip-derive-00 Jiri
Systems Life Cycle A summary of what needs to be done.
IDN over EPP (IDNPROV) IETF BOF, Washington DC November 2004.
IPv6 RADIUS attributes for IPv6 access networks draft-lourdelet-radext-ipv6-access-01 Glen Zorn, Benoit Lourdelet Wojciech Dec, Behcet Sarikaya Radext/dhc.
Computer Science Standard Level Mastery Aspects. Mastery Item Claimed JustificationWhere Listed Arrays Used to store the student data Lines P.
Patient Matching. Process Reviewed secondary (e.g. white papers) and primary literature on patient matching Series of teleconferences to establish scope,
Diameter Extended NAPTR Thursday, November 11, 2010 draft-ietf-dime-extended-naptr Mark Jones Jouni Korhonen IETF 79 Beijing, China.
ENUM Implementation Experiences Lawrence Conroy Roke Manor Research
ENUM Update for voipeer BOF Richard Shockey ENUM co-chair IETF 63 Paris.
Quick-Start for TCP and IP draft-ietf-tsvwg-quickstart-02.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti TSVWG, March 2006 This and earlier presentations::
Lecture 10 Trees –Definiton of trees –Uses of trees –Operations on a tree.
Rfc7180bis: Further TRILL Clarifications, Corrections, and Updates Donald Eastlake Mingui Zhang, Radia Perlman, Ayan Banerjee, Anoop Ghanwani, Sujay Gupta.
You must follow the steps!
(Business) Process Centric Exchanges
Cookies Web Browser and Server use HTTP protocol to communicate and HTTP is a stateless protocol. But for a commercial website it is required to maintain.
© 2006 Pearson Addison-Wesley. All rights reserved8 A-1 Chapter 8 Queues.
ICN and DTN NetInf over BP using BPQ Elwyn Davies Folly Consulting Ltd/Trinity College Dublin or
4395bis irireg Tony Hansen, Larry Masinter, Ted Hardie IETF 82, Nov 16, 2011.
MAIL ROUTING AND THE DOMAIN SYSTEM 指導教授:梁德昭博士 報告學生:蕭有廷 報告日期: 11 月 30 日.
Page 1IETF 65 ENUM WG IETF 65 – ENUM WG IANA Registration for an Enumservice and “tel” Parameter for Calling Name Delivery (CNAM) Information 20 March.
Peering: A Minimalist Approach Rohan Mahy IETF 66 — Speermint WG.
Lists Chapter 4 Slides by Steve Armstrong LeTourneau University Longview, TX  2007,  Prentice Hall.
Digital Logic Lecture 3 Binary Arithmetic By Zyad Dwekat The Hashemite University Computer Engineering Department.
1 Requirements for Internet Routers (Gateways) and Hosts Relates to Lab 3. (Supplement) Covers the compliance requirements of Internet routers and hosts.
Page 1IETF 63 ENUM WG IETF 63 – ENUM WG IANA Registration for an Enumservice Containing Number Portability and PSTN Signaling Information 5 August 2005.
Chapter 8 Queues. © 2004 Pearson Addison-Wesley. All rights reserved 8-2 The Abstract Data Type Queue A queue –New items enter at the back, or rear, of.
Processing Text Excel can not only be used to process numbers, but also text. This often involves taking apart (parsing) or putting together text values.
Draft Recommendations Patient Matching Power Team July 1, 2011.
Higher Computing Software Development -So Far- 5/10/10.
Dynamic Programming & Memoization. When to use? Problem has a recursive formulation Solutions are “ordered” –Earlier vs. later recursions.
MSRP Again! draft-ietf-simple-message- session-09.
Enumservice VOID draft-stastny-enum-void-00 Richard Stastny Lawrence Conroy IETF60 San Diego.
1 IPSec: An Overview Dr. Rocky K. C. Chang 4 February, 2002.
EDNS0 - the need for speed Lawrence Conroy Roke Manor Research This draft has been produced by Lawrence Conroy
IEEE MEDIA INDEPENDENT HANDOVER DCN: XXXX Title: Panasonic’s MIH Proposal (Details) Date Submitted: January, 09,
Chapter 7 A Queues. © 2004 Pearson Addison-Wesley. All rights reserved7 A-2 The Abstract Data Type Queue A queue –New items enter at the back, or rear,
CMPT 120 Topic: Searching – Part 2 and Intro to Time Complexity (Algorithm Analysis)
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Carrier/Infrastructure ENUM Requirements draft-lind-infrastructure-enum-reqs-01.
ENUM Privacy and Security issues drafts/draft-ietf-enum-privacy- security-00.txt.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Telephone Related Queries (TeRQ)
MQTT-255 Support alternate authenticaion mechanisms
Fuzzy Searches Fuzzy searching allows you to search for words with similar spelling to the entered search word. It can be a useful way to ensure that you.
CC 215 Data Structures Queue ADT
Internet Networking Spring 2002
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
A SIP Event Package for DTMF Event Monitoring
RPZ Configuration DNS RPZ Configuration Lecturer: Ron Aitchison
Patterns to KNOW.
  30 A 30 B 30 C 30 D 30 E 77 TOTALS ORIGINAL COUNT CURRENT COUNT
Proposal for Extensible Security
Multi-server Namespace in NFSv4.x Previous and Pending Updates
WebDAV Design Overview
PART 5 Transport Layer.
Queues Chapter 8 © 2011 Pearson Addison-Wesley. All rights reserved.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

ENUM Implementation Issues Lawrence Conroy

11-Nov Things we have seen… There are a number of different NAPTRs “out there” Not all of them are compliant to RFC2916bis It’s an implementation issue how one deals with these But…one should be liberal with what one accepts There’s a list of 8 issues we hit whilst building and testing an RFC2916bis compliant client (and Admin system) - they’re on the ENUM ML Proposal: “living” document to capture the issues and how folks deal with any ambiguities - this is a kind of BCP/Implementor’s Guide - NOT a protocol standard

11-Nov For the -challenged (a) Issue 1 - Case Sensitivity –Are ENUMservices case sensitive or not? –Are flags case sensitive or not? [We treat them both as case insensitive] Issue 2 - E2U at which end? –Some folk publish RFC2916 NAPTRs, some use 2916bis; this means that E2U could be at either end of the service field –One “quick fix” is to treat E2U as a reserved string, so it is NOT a valid ENUMservice [We process everything as an ENUMservice, and then strip the E2U “pseudo-service”]

11-Nov For the -challenged (b) Issue 3 - Non-finals with or without empty service field? –Should the client check and use the service field in a non-final? –Must a registrant populate non-finals with an empty service field? [We publish them with empty field and ignore it in the client] Issue 4 - Does Order “count” across domains? –If one traverses a non-final reference to another domain, AND that domain has NAPTRs with a higher order value BUT there are none appropriate for the client, SHOULD one discard any unprocessed NAPTRs in the “referring” domain? [We treat order as significant only within a domain]

11-Nov For the -challenged (c) Issue 5 - Non-final loop treatment –If there’s a loop in a chain of non-final references, then should one: Give up on the whole query Give up on the reference and carry on as if it wasn’t there? Give up on the whole “nested” set of references and return to any NAPTRs in the original domain? [We give up on the reference and carry on - (option 2)] Issue 6 - Non-final loop detection? –Does one need a full “domain traversed” list, or can on “get away” with a simple ‘recursion count’ for loop detection? –If the latter, what’s a reasonable limit for the number of non-final –references [We keep a count and give up on 5 nested references]

11-Nov For the -challenged (d) Issue 7 - Treatment of NAPTRs with identical preferences –If there are several NAPTRs with the same preference, then must the client randomise its processing of the NAPTRs? [We process them in the order they arrive] Issue 8 - L2R or R2L processing of service field? –If a NAPTR has more than one ENUMservice in its service field, then should the client process them from the left to the right or the other way around? [We process them from left to right]