weekly research activity l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Weekly Research Activity PowerPoint Presentation
Download Presentation
Weekly Research Activity

Loading in 2 Seconds...

play fullscreen
1 / 16

Weekly Research Activity - PowerPoint PPT Presentation


  • 270 Views
  • Uploaded on

Weekly Research Activity 2004-06-25 Chul Lee Agenda Session migration L7-based contents distribution: Bin-packing problem CORE-Web Server Administration GUI Evaluation plan SANfs L7 dispatcher Overall system Problem description In case of arbitrary long sessions,

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Weekly Research Activity' - benjamin


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
weekly research activity

Weekly Research Activity

2004-06-25

Chul Lee

Computer Engineering Research Laboratory, EECS, KAIST

agenda
Agenda
  • Session migration
  • L7-based contents distribution:
    • Bin-packing problem
  • CORE-Web Server Administration GUI
  • Evaluation plan
    • SANfs
    • L7 dispatcher
    • Overall system

Computer Engineering Research Laboratory, EECS, KAIST

problem description
Problem description
  • In case of arbitrary long sessions,
    • Large file download, real time streaming, state-full sessions
  • When the backend real servers should be reallocated, gradual reallocation or session migration is needed.
  • Difference from high-availability
    • Requires light-weight and low-overhead technique is needed.

Computer Engineering Research Laboratory, EECS, KAIST

session resumption

Dispatcher

Session table

HTTP

Routing table

TCP

IP-address

IP

Session Resumption

Client’s browser

Real Server

Shopping

Cart

HTTP

HTTP

TCP

TCP

IP

IP

Sync

Real Server

HTTP

TCP

Session fail-over

Session migration

IP

Computer Engineering Research Laboratory, EECS, KAIST

ftp session migration

Dispatcher/Proxy

Session table

FTP

Routing table

TCP

IP-address

IP

FTP Session Migration

Client’s browser

Real Server

FTP

FTP

TCP

TCP

IP

IP

Real Server

URL &

Range request

From XX bytes

FTP

TCP

Session fail-over

Session migration

Proxy stores

session information

IP

Computer Engineering Research Laboratory, EECS, KAIST

streaming session migration

Dispatcher/Proxy

Session table

HTTP

Routing table

TCP

IP-address

IP

Streaming Session Migration

Client’s browser

Real Server

HTTP

HTTP

TCP

TCP

IP

IP

Real Server

URL

HTTP

Proxy stores

session information

TCP

Session fail-over

Session migration

IP

Computer Engineering Research Laboratory, EECS, KAIST

conclusion

large

HTTP

size

TCP

IP

small

static

Update freq.

dynamic

Conclusion
  • Low overhead techniques
    • Application level state preserving
    • Proxy-based seamless session migration
      • To augment a migration module to the current CBWS

Characteristic of state information

Computer Engineering Research Laboratory, EECS, KAIST

our solutions
Our Solutions
  • Rewriting application (server/client)
    • Download manager
    • Server’s state migration
      • Apache Web server plug-in
  • Application-independent
    • Connection migration
    • Also needs soft-state synchronization

Computer Engineering Research Laboratory, EECS, KAIST

references
references
  • http://www.sbg.ac.at/docu/man/oracle/9i/appdev.901/a89857/oci08sca.htm
  • http://edocs.bea.com/wls/docs81/cluster/failover.html
  • http://lvs.idk.com.pl/Joseph.Mack/HOWTO/LVS-HOWTO-6.html#persistent_connection
  • http://lvs.idk.com.pl/Joseph.Mack/HOWTO/LVS-HOWTO-21.html#ss21.2
  • http://www.squid-cache.org/
  • http://tdrwww.exp-math.uni-essen.de/dreibholz/rserpool/
  • https://www.atg.com/repositories/ContentCatalogRepository_en/manuals/Dynamo3.5.1/admin/admin0501.html

Computer Engineering Research Laboratory, EECS, KAIST

contents distribution
Contents distribution

Dispatcher

Clients

Clients

Clients

Real Servers

Computer Engineering Research Laboratory, EECS, KAIST

contents distribution11
Contents distribution
  • Problem description

Bin packing problem

Ref: http://www.cs.arizona.edu/icon/oddsends/bpack/bpack.htm

http://wwweng.murdoch.edu.au/EngModules/m108demo/Section01/Section0102c.html

Hash Function

Dispatcher

abcd

Computer Engineering Research Laboratory, EECS, KAIST

slide12

10%

10%

10%

10%

10%

10%

10%

10%

10%

10%

10%

10%

10%

10%

10%

CORE-Web Server: CPU Load meter

1

2

3

4

90%

5

6

7

8

9

10

11

12

13

14

15

16

Computer Engineering Research Laboratory, EECS, KAIST

slide13

CORE-Web Server: Load History

Load

22:10

17 June

2004

22:20

17 June

2004

22:30

17 June

2004

22:40

17 June

2004

22:00

17 June

2004

Time

Computer Engineering Research Laboratory, EECS, KAIST

slide14

CORE-Web Server: Logical Layout

MySQL

Apache

KID

Apache

Apache

Apache

Apache

Computer Engineering Research Laboratory, EECS, KAIST

questions to be answered
Questions to be answered
  • SANfs
    • What is the most cost-effective configuration?

(For transferring bulk data using FTP)

(For streaming video file using HTTP)

(For reading and writing small data using HTTP, BBS)

  • Dispatcher
    • How many real servers can be attached?(Scalability)
    • How much does TCP hand-off enhance the scalability?
    • Does the Layer 7 switch increase the cache hit and the overall performance?

Computer Engineering Research Laboratory, EECS, KAIST

evaluation of core web
Evaluation of CORE-Web
  • SANfs evaluation
    • Hosts:Disks = ?:?
    • For the most cost-effective setting

With 1 disk

?

Throughput

1

2

3

4

Number of nodes

Computer Engineering Research Laboratory, EECS, KAIST