socket service types the following socket types are
play

Socket Service Types The following socket types are defined: 1. - PDF document

Socket Service Types The following socket types are defined: 1. SOCK_STREAM : stream socket 2. SOCK_DGRAM : datagram socket 3. SOCK_RAW : raw-protocol interface 4. SOCK_RDM : reliably-delivered message 5. SOCK_SEQPACKET : sequenced packet stream


  1. Socket Service Types The following socket types are defined: 1. SOCK_STREAM : stream socket 2. SOCK_DGRAM : datagram socket 3. SOCK_RAW : raw-protocol interface 4. SOCK_RDM : reliably-delivered message 5. SOCK_SEQPACKET : sequenced packet stream More types may be defined in the future 1

  2. IPC Implementation in UNIX STREAM DATAGRAM SEQ-DGM RAW Socket Xerox Domain Internet Domain TCP XNS Decnet Domain Protocol UDP IP Network le0 le1 Socket Layer (specifies required service) •Abstract objects that provide distinct endpoints of communication •Buffering Protocol Layer (implements the service) •Domains and their protocols Network Layer: •Interface to the network hardware 2

  3. FUNCTION CALLS FOR TCP/IP write () read () APPLICATION SPACE KERNEL SPACE SYSTEM write () read () rwuio() soo_rw() sosend () soreceive () SOCKET tcp_usrreq () tcp_input () TCP tcp_output () ip_output () ipintr () IP leoutput () do_protocol() ether_output () leread () NETWORK lestart () leintr () NETWORK 3

  4. IPC Packet/Data Queues Application Application Socket Socket Layer Buffers TCP/IP Layer IP Queue Network Network Layer Queue Network 4

  5. Data Transmission Application Buffer Socket Buffer Data Data Protocol (TCP/IP) IP TCP Data IP TCP Data Network Net IP TCP Data Net IP TCP Data 5

  6. Data Reception Application Buffer Socket Buffer Data Data Data Data Data Protocol (TCP/IP) Data TCP IP Data TCP IP Network Data TCP IP Net Data TCP IP Net 6

  7. Memory Management Requirements • Allocate / deallocate memory fast and efficiently • Handle both small and large packets efficiently • Copy packets efficiently • Trim data from front (headers) or back (trailers) of packets efficiently (without copying) • Preserve packet sequence (streams, sequenced datagrams) • Preserve packet boundaries (datagrams) 7

  8. Solution: Mbufs What is an mbuf (memory buffer)? m_next m_off 12 m_len m_type 128 bytes m_dat 112 4 m_act 8

  9. Mbuf chains and lists Mbufs can be linked to form Chains using the m_next field: m_next m_next m_next or linked to form Lists using the m_act field: m_next m_next m_next m_act m_next m_next m_next m_act 9

  10. Storing Large packets Instead of storing data in the mbuf itself, data can be stored in an external page: m_next 1024 bytes m_off m_len m_type m_dat external page m_act The mbufs are called Cluster Mbufs In a cluster mbuf the m_dat field is always empty 10

  11. Mbuf Allocation/Deallocation During system initialization a pool of memory pages is allocated to the mbuf store: Mbuf Store: kernel memory Never paged out! Some of these pages are used for mbufs. The rest are used as external store for cluster mbufs: Pages containing mbufs Pages for cluster mbufs All free mbufs are on the mbuf free list All free pages are on the page free list 11

  12. Mbuf allocation struct mbuf *m = m_get () Returns a pointer to an mbuf from the free list: mfree m int mclget (m): Given an mbuf attach a page to create a cluster mbuf: m mclfree 12

  13. Mbuf Deallocation struct mbuf *m_free (m): Given an mbuf chain, free the first mbuf and return a pointer to the next mbuf: mfree m n m_free () works on cluster mbufs too int m_freem (m): Free a chain of mbufs 13

  14. Mbuf Copy struct mbuf *m1 = m_copy (m, off, len): Copies len data bytes from m starting at offset off Returns a new mbuf chain m1 Copying a cluster mbuf is accomplished by: • allocating a new mbuf • making m_off to point to the external page • incrementing the reference count of the external page m1 = m_copy (m) results to: m m m1 refcnt = 1 refcnt = 2 14

  15. Trimming an Mbuf int m_adj (m, len): if len is positive, trim len data from head if len is negative, trim len data from tail m_next m_off m_len m_type m_act m_dat 15

  16. Mbuf to Data and Data to Mbuf data = mtod (m, type): Return the address of the data in the mbuf casting it to type e.g.: int *p; p = mtod (m, int *) struct mbuf *m = dtom (ptr): The inverse of mtod () Return the address of the mbuf where ptr resides 16

  17. Making mbuf data contiguous struct mbuf *m1 = m_pullup (m, len): Rearrange mbuf chain m so that len bytes are contiguous in the data area. Return resulting mbuf chain. Copies data if necessary. Needed so that mtod () and dtom () will work (e.g., when accessing protocol headers) 17

  18. Data Movement with Mbufs Application Buffer Physical copy M M M Socket Buffer D D D Physical or logical copy M H TCP/IP D D M H Network Queue D M H D M H Physical copy Network Cluster mbuf containing data M Page containing data D H Mbuf containing header 18

  19. Timers Two types of timers are provided by the OS: • Fast timer: every 200 ms • Slow timer: every 500 ms Every time a timer fires, the list of active connections is traversed and the protocol user request function is called for each connection: Active state state state state connections pr_usrreq (pcb, FASTTIMEO,...) Protocol processing (like retransmissions or delayed ack) can now take place 19

  20. IPC Packet/Data Queues Application Application Socket Socket Layer Buffers TCP/IP Layer IP Queue Network Network Layer Queue Network 20

  21. Kernel Scheduling What is a system call? User Code System Call supervisor bit set supervisor bit cleared Kernel Kernel Code The kernel address space is always mapped into each process’ address space. During a system call, a user process enters the kernel (supervisor bit is set) and executes kernel code. Once processing is done, the supervisor bit is cleared and the process returns to user space. Any normal kernel processing (e.g., scheduling, interrupt processing) is therefore not affected (unless the system call masks interrupts) 21

  22. Sending Data: Datagrams User Process Kernel Socket Layer user process in kernel UDP Layer space IP Layer Network interface packet queue interrupt Network driver Network 22

  23. Receiving Datagrams User Process user process Kernel Socket Layer in kernel space Socket queue packet UDP Layer IP Layer software interrupt packet Protocol queue interrupt Network driver Network 23

  24. Sending Data: Streams User Process user data while there is data to send Socket Layer fill sockbuf; call protocol; sockbuf if sockbuf is full sleep; TCP Layer make a window of packets; IP Layer put packets in network Q; return; packet packet Network driver while packets in queue send a packet; Network 24

  25. Receiving Stream Data User Process Socket Layer wake up application Ack TCP Receive TCP Send IP Receive IP Send interrupt interrupt Network driver Network 25

  26. Delaying Acknowledgment To avoid “silly window”, ack may be delayed: User Process Socket Layer FASTTIMEO interrupt set TF_DELACK TCP Receive TCP Send IP Receive IP Send sw interrupt Ack interrupt interrupt Network driver Network 26

  27. Receiving Acks User Process Socket Layer TCP Receive data TCP Send IP Receive IP Send Ack interrupt interrupt Network driver Network 27

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend