Download presentation
Presentation is loading. Please wait.
1
Multiaddressing with MAST SAINT 2004, Tokyo D. Crocker Brandenburg InternetWorking http://brandenburg.com/current SAINT 2004, Tokyo D. Crocker Brandenburg InternetWorking http://brandenburg.com/current
2
D. CrockerSAINT 20042 Simultaneous Changing MobileMobile MultiaddressingMultiaddressing IP Independent datagrams Infrastructure works fine Long time to get that way Leave it alone! Multiaddressing Multiple IP Addresses Association of datagrams Like transport: context Like IP: routing choice IP Independent datagrams Infrastructure works fine Long time to get that way Leave it alone! Multiaddressing Multiple IP Addresses Association of datagrams Like transport: context Like IP: routing choice MultihomedMultihomed RenumberRenumber
3
D. CrockerSAINT 20043 MASTMAST Multiple Address Service for Transport Pools of locators, for pairs of endpoints Protected control channel, for maintenance of pools Identify association with TCP-like “Association ID” Peer-to-Peer — No infrastructure needed for core service! Add third-party components when essential Mobile client: Standard transport rendezvous Mobile target:Dynamic “presence” service Endpoint surrogate: Forwarding agent (NAT-like) Multiple Address Service for Transport Pools of locators, for pairs of endpoints Protected control channel, for maintenance of pools Identify association with TCP-like “Association ID” Peer-to-Peer — No infrastructure needed for core service! Add third-party components when essential Mobile client: Standard transport rendezvous Mobile target:Dynamic “presence” service Endpoint surrogate: Forwarding agent (NAT-like)
4
D. CrockerSAINT 20044 MAST Architecture EP= Endpoint TR= Transit EID= Ephemeral IDentifier Presence DNS IP f IP q IP y IP a IP-TR Transport Association (, Port l,, Port r ) Association ( EID l, Port l, EID r, Port r ) MAST EID r IP y IP a EID l IP-EPIP-EPIP-EPIP-EP IP-TR
5
D. CrockerSAINT 20045 MAST Protocol Pool maintenance Send complete locator list, to avoid synchronization problems Send PROBE to peer, to discover your own NAT public address Security – only equal to current IP Domain Name, as registered, global identifier Nonce, internal to association for context reference, anti-hijacking Design the nonce and channel scheme for desired protection Efficiencies MAST is not in critical path of transport startup(!) Can even defer MAST until association is persistent However separate MAST channel adds to packet overhead Pool maintenance Send complete locator list, to avoid synchronization problems Send PROBE to peer, to discover your own NAT public address Security – only equal to current IP Domain Name, as registered, global identifier Nonce, internal to association for context reference, anti-hijacking Design the nonce and channel scheme for desired protection Efficiencies MAST is not in critical path of transport startup(!) Can even defer MAST until association is persistent However separate MAST channel adds to packet overhead
6
D. CrockerSAINT 20046 SLAP: Shared Locator Address Pool Multiple transports Cooperative Reduce packet overhead Share on sets of attributes Issue Synchronizing changes between different control paths Multiple transports Cooperative Reduce packet overhead Share on sets of attributes Issue Synchronizing changes between different control paths MAST TCP IP-TR mTCPSCTP SLAP Assoc-ID = [EID l, EID r, (IP l1, IP r1 ), (IP l2, IP r2 ), … A 1, A 2, … ]
7
D. CrockerSAINT 20047 Evaluating Design Choices Features Multiaddressing Multihoming, mobility, both Infrastructure None, sometimes, always IP version(s) Identifier Registered vs. ephemeral Rendezvous Creating the association After service interruption Features Multiaddressing Multihoming, mobility, both Infrastructure None, sometimes, always IP version(s) Identifier Registered vs. ephemeral Rendezvous Creating the association After service interruption Overhead Per payload packet Control protocol Transport startup delay Scaling impact Constant per association, vs. deferred Administration
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.